Abstract
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their time complexities are not optimal, however: they always depend on the alphabet size. In this paper we achieve, for the first time, full alphabet-independence in the time complexities of self-indexes, while retaining space optimality. We obtain also some relevant byproducts on compressed suffix trees. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Belazzougui, D., & Navarro, G. (2011). Alphabet-independent compressed text indexing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6942 LNCS, pp. 748–759). https://doi.org/10.1007/978-3-642-23719-5_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
