Suffix arrays: a new method for on-line string searches
@article{Manber1990SuffixAA, title={Suffix arrays: a new method for on-line string searches}, author={U. Manber and E. Myers}, journal={SIAM J. Comput.}, year={1990}, volume={22}, pages={935-948} }
A new and conceptually simple data structure, called a suffixarray, for on-line string searches is introduced in this paper. Constructing and querying suffixarrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffixarrays over suffixtrees is that, in practice, they use three to five times less space. From a complexity standpoint, suffix arrays permit on-line string searches of the type, ‘‘Is W a substring of A?’’ to be answered in time O(P + log… Expand
2,284 Citations
Suffix Arrays for Multiple Strings: A Method for On-Line Multiple String Searches
- Computer Science
- ASIAN
- 1996
- 27
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
- Mathematics, Computer Science
- Algorithmica
- 2013
- 13
- PDF
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
- Computer Science
- CPM
- 2009
- 1
- PDF
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Mathematics, Computer Science
- STOC '00
- 2000
- 207
- Highly Influenced
- PDF
Position heaps: A simple and dynamic text indexing data structure
- Computer Science
- J. Discrete Algorithms
- 2011
- 30
- PDF