A taxonomy of suffix array construction algorithms
Top Cited Papers
- 6 July 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 39 (2)
- https://doi.org/10.1145/1242471.1242472
Abstract
1Restricted Access: Metadata OnlKeywords
This publication has 22 references indexed in Scilit:
- An efficient, versatile approach to suffix sortingACM Journal of Experimental Algorithmics, 2008
- Compressed full-text indexesACM Computing Surveys, 2007
- Linear work suffix array constructionJournal of the ACM, 2006
- Constructing suffix arrays in linear timeJournal of Discrete Algorithms, 2005
- Antisequential Suffix Sorting for BWT-Based Data CompressionIEEE Transactions on Computers, 2005
- Cache-conscious sorting of large sets of strings with dynamic triesACM Journal of Experimental Algorithmics, 2004
- Space efficient linear time construction of suffix arraysJournal of Discrete Algorithms, 2004
- Replacing suffix trees with enhanced suffix arraysJournal of Discrete Algorithms, 2004
- The string B-treeJournal of the ACM, 1999
- Engineering a sort functionSoftware: Practice and Experience, 1993