Fast Lightweight Suffix Array Construction and Checking
- 27 May 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Distributed and Paged Suffix Trees for Large Genetic DatabasesLecture Notes in Computer Science, 2003
- An efficient method for in memory construction of suffix arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal suffix tree construction with large alphabetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The Enhanced Suffix Array and Its Applications to Genome AnalysisLecture Notes in Computer Science, 2002
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its ApplicationsLecture Notes in Computer Science, 2001
- Quorums from difference coversInformation Processing Letters, 2000
- Suffix Trees on WordsAlgorithmica, 1999
- Sparse suffix treesLecture Notes in Computer Science, 1996
- Designing programs that check their workJournal of the ACM, 1995
- Rapid identification of repeated patterns in strings, trees and arraysPublished by Association for Computing Machinery (ACM) ,1972