Optimal Exact String Matching Based on Suffix Arrays
Authors:
- 18 September 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 31-43
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Opportunistic data structures with applications2002
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications2001
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)2000
- Reducing the space requirement of suffix treesSoftware: Practice and Experience, 1999
- Algorithms on Strings, Trees and Sequences1997
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- The Myriad Virtues of Subword Trees1985
- Linear pattern matching algorithms1973