2009
DOI: 10.1007/978-3-642-02441-2_5
|View full text |Cite
|
Sign up to set email alerts
|

Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure

Abstract: Abstract. We address the problem of finding the locations of all instances of a string P in a text T , where of T is allowed to facilitate the queries. Previous data structures for this problem include the suffix tree, the suffix array, and the compact DAWG. We modify a data structure called a sequence tree, which was proposed by Coffman and Eve for hashing, and adapt it to the new problem. We can then produce a list of k occurrences of any string P in T in O(||P || + k) time. Because of properties shared by s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
references
References 7 publications
0
0
0
Order By: Relevance