Space Efficient Linear Time Construction of Suffix Arrays
Authors:
- 27 May 2003
- book chapter
- Published by Springer Nature
- p. 200-210
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Linear-Time Construction of Suffix Arrays2003
- An efficient method for in memory construction of suffix arrays2003
- The Enhanced Suffix Array and Its Applications to Genome Analysis2002
- Optimal Exact String Matching Based on Suffix ArraysLecture Notes in Computer Science, 2002
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications2001
- Alignment of whole genomesNucleic Acids Research, 1999
- Algorithms on Strings, Trees and Sequences1997
- Optimal logarithmic time randomized suffix tree construction1996
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976