Space Efficient Linear Time Construction of Suffix Arrays
Top Cited Papers
- 27 May 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 200-210
- https://doi.org/10.1007/3-540-44888-8_15
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Linear-Time Construction of Suffix ArraysLecture Notes in Computer Science, 2003
- An efficient method for in memory construction of suffix arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The Enhanced Suffix Array and Its Applications to Genome AnalysisLecture Notes in Computer Science, 2002
- Optimal Exact String Matching Based on Suffix ArraysLecture Notes in Computer Science, 2002
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its ApplicationsLecture Notes in Computer Science, 2001
- Alignment of whole genomesNucleic Acids Research, 1999
- Algorithms on Strings, Trees and SequencesPublished by Cambridge University Press (CUP) ,1997
- Optimal logarithmic time randomized suffix tree constructionLecture Notes in Computer Science, 1996
- 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