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 Trays and Suffix Trists: Structures for Faster Text Indexing
  • 22
Computing Longest Common Substrings Via Suffix Arrays
  • 15
  • PDF
Simple Linear Work Suffix Array Construction
  • 465
  • PDF
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets
  • 20
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
  • 13
  • PDF
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
  • 1
  • PDF
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
  • 207
  • Highly Influenced
  • PDF
Position heaps: A simple and dynamic text indexing data structure
  • 30
  • PDF
Linear work suffix array construction
  • 375
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...