Article thumbnail

Pattern Matching on Sparse Suffix Trees

By Roman Kolpakov, Gregory Kucherov and Tatiana Starikovskaya


International audienceWe consider a compact text index based on evenly spaced sparse suffix trees of a text [9]. Such a tree is defined by partitioning the text into blocks of equal size and constructing the suffix tree only for those suffixes that start at block boundaries. We propose a new pattern matching algorithm on this structure. The algorithm is based on a notion of suffix links different from that of [9] and on the packing of several letters into one computer wor

Topics: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Publisher: IEEE Computer Society
Year: 2011
DOI identifier: 10.1109/CCP.2011.45
OAI identifier: oai:HAL:hal-00681844v1
Provided by: HAL - UPEC / UPEM
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal-upec-upem.archives... (external link)
  • https://hal-upec-upem.archives... (external link)
  • https://hal-upec-upem.archives... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.