Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Compressed Text Indexing

  • Veli MäkinenEmail author
  • Gonzalo Navarro
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_83

Years and Authors of Summarized Original Work

  • 2005; Ferragina, Manzini

Problem Definition

Given a text string\( { T = t_1 t_2 \dots t_n } \)


Compressed full-text indexing Self-indexing Space-efficient text indexing 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Burrows M, Wheeler D (1994) A block sorting lossless data compression algorithm. Technical report 124, Digital Equipment CorporationGoogle Scholar
  2. 2.
    Ferragina P, Giancarlo R, Manzini G, Sciortino M (2005) Boosting textual compression in optimal linear time. J ACM 52(4):688–713MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Ferragina P, Manzini G (2005) Indexing compressed texts. J ACM 52(4):552–581MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Ferragina P, Manzini G, Mäkinen V, Navarro G (2007) Compressed representation of sequences and full-text indexes. ACM Trans Algorithms 3(2):Article 20MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Grossi R, Gupta A, Vitter J (2003) High-order entropy-compressed text indexes. In: Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 841–850Google Scholar
  6. 6.
    Jacobson G (1989) Space-efficient static trees and graphs. In: Proceedings of the 30th IEEE symposium on foundations of computer science (FOCS), pp 549–554Google Scholar
  7. 7.
    Mäkinen V, Navarro G (2005) Succinct suffix arrays based on run-length encoding. Nord J Comput 12(1):40–66MathSciNetzbMATHGoogle Scholar
  8. 8.
    Mäkinen V, Navarro G (2006) Dynamic entropy-compressed sequences and full-text indexes. In: Proceedings of the 17th annual symposium on combinatorial pattern matching (CPM). LNCS, vol 4009. Extended version as TR/DCC-2006-10, Department of Computer Science, University of Chile, July 2006, pp 307–318Google Scholar
  9. 9.
    Manber U, Myers G (1993) Suffix arrays: a new method for on-line string searches. SIAM J Comput 22(5):935–948MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Manzini G (2001) An analysis of the Burrows-Wheeler transform. J ACM 48(3):407–430MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Navarro G, Mäkinen V (2007) Compressed full-text indexes. ACM Comput Surv 39(1):Article 2Google Scholar
  12. 12.
    Raman R, Raman V, Rao S (2002) Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proceedings of the 13th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 233–242Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceHelsinki Institute for Information Technology (HIIT), University of HelsinkiHelsinkiFinland
  2. 2.Department of Computer ScienceUniversity of ChileSantiagoChile