Abstract
Recent compressed suffix trees targeted to highly repetitive text collections reach excellent compression performance, but operation times in the order of milliseconds. We design a new suffix tree representation for this scenario that still achieves very low space usage, only slightly larger than the best previous one, but supports the operations within microseconds. This puts the data structure in the same performance level of compressed suffix trees designed for standard text collections, which on repetitive collections use many times more space than our new structure. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Navarro, G., & Ordóñez, A. (2014). Faster compressed suffix trees for repetitive text collections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8504 LNCS, pp. 424–435). Springer Verlag. https://doi.org/10.1007/978-3-319-07959-2_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
