Abstract
The need to index and search huge highly repetitive sequence collections is rapidly arising in various fields, including computational biology, software repositories, versioned collections, and others. In this short survey we briefly describe the progress made along three research lines to address the problem: compressed suffix arrays, grammar compressed indexes, and Lempel-Ziv compressed indexes. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Navarro, G. (2012). Indexing highly repetitive collections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7643 LNCS, pp. 274–279). https://doi.org/10.1007/978-3-642-35926-2_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
