Optimal Exact String Matching Based on Suffix Arrays
- 18 September 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Opportunistic data structures with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its ApplicationsLecture Notes in Computer Science, 2001
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- Reducing the space requirement of suffix treesSoftware: Practice and Experience, 1999
- Algorithms on Strings, Trees and SequencesPublished by Cambridge University Press (CUP) ,1997
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- The Myriad Virtues of Subword TreesPublished by Springer Nature ,1985
- Linear pattern matching algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973