Jump to ContentJump to Main Navigation
Show Summary Details

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board Member: Blackburn, Simon R. / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Schäge, Sven / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year

SCImago Journal Rank (SJR) 2015: 1.208
Source Normalized Impact per Paper (SNIP) 2015: 2.294
Impact per Publication (IPP) 2015: 1.103

Mathematical Citation Quotient (MCQ) 2015: 0.48

See all formats and pricing

Algorithmics on SLP-compressed strings: A survey

Markus Lohrey
  • Institut für Informatik, Universität Leipzig, Augustusplatz 10–11, 04109 Leipzig, Germany
  • Email:
Published Online: 2012-11-27 | DOI: https://doi.org/10.1515/gcc-2012-0016


Results on algorithmic problems on strings that are given in a compressed form via straight-line programs are surveyed. A straight-line program is a context-free grammar that generates exactly one string. In this way, exponential compression rates can be achieved. Among others, we study pattern matching for compressed strings, membership problems for compressed strings in various kinds of formal languages, and the problem of querying compressed strings. Applications in combinatorial group theory and computational topology and to the solution of word equations are discussed as well. Finally, extensions to compressed trees and pictures are considered.

Keywords: Algorithms for compressed strings; compressed word problems; computational complexity

About the article

Received: 2012-06-06

Published Online: 2012-11-27

Published in Print: 2012-12-01

Citation Information: , ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc-2012-0016. Export Citation

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

Markus Lohrey and Christian Mathissen
Information and Computation, 2013, Volume 224, Page 71
Artur Jeż
Theory of Computing Systems, 2014, Volume 55, Number 4, Page 685
Alexander Tiskin
Algorithmica, 2015, Volume 71, Number 4, Page 859
Volker Diekert, Olga Kharlampovich, and Atefeh Mohajeri Moghaddam
International Journal of Algebra and Computation, 2015, Volume 25, Number 01n02, Page 81
Travis Gagie, Paweł Gawrychowski, and Simon J. Puglisi
Journal of Discrete Algorithms, 2015, Volume 32, Page 64

Comments (0)

Please log in or register to comment.
Log in