Linear-Time Construction of Suffix Arrays
Authors:
- 27 May 2003
- book chapter
- Published by Springer Nature
- p. 186-199
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On the sorting-complexity of suffix tree constructionJournal of the ACM, 2000
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)2000
- The LCA Problem Revisited2000
- Optimal Parallel Suffix Tree ConstructionJournal of Computer and System Sciences, 1997
- Optimal logarithmic time randomized suffix tree construction1996
- Recursive Star-Tree Parallel Data StructureSIAM Journal on Computing, 1993
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Scaling and related techniques for geometry problems1984
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981