Jump to ContentJump to Main Navigation
Show Summary Details
More options …

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


CiteScore 2016: 0.35

SCImago Journal Rank (SJR) 2016: 0.372
Source Normalized Impact per Paper (SNIP) 2016: 0.517

Mathematical Citation Quotient (MCQ) 2016: 0.23

Online
ISSN
1869-6104
See all formats and pricing
More options …

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

Abstract.

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

© 2012 by Walter de Gruyter Berlin Boston. Copyright Clearance Center

Comments (0)

Please log in or register to comment.
Log in