Simple Linear Work Suffix Array Construction
Top Cited Papers
- 18 June 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 943-955
- https://doi.org/10.1007/3-540-45061-0_73
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Asynchronous parallel disk sortingPublished by Association for Computing Machinery (ACM) ,2003
- Fast Lightweight Suffix Array Construction and CheckingLecture Notes in Computer Science, 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
- Optimal Exact String Matching Based on Suffix ArraysLecture Notes in Computer Science, 2002
- Nearest common ancestorsPublished by Association for Computing Machinery (ACM) ,2002
- A Theoretical and Experimental Study on the Construction of Suffix Arrays in External MemoryAlgorithmica, 2002
- The LCA Problem RevisitedLecture Notes in Computer Science, 2000
- A NOTE ON COARSE GRAINED PARALLEL INTEGER SORTINGParallel Processing Letters, 1999
- Parallel Merge SortSIAM Journal on Computing, 1988