Article
Licensed
Unlicensed
Requires Authentication
Algorithmics on SLP-compressed strings: A survey
-
Markus Lohrey
Published/Copyright:
November 27, 2012
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.
Received: 2012-06-06
Published Online: 2012-11-27
Published in Print: 2012-12-01
© 2012 by Walter de Gruyter Berlin Boston
You are currently not able to access this content.
You are currently not able to access this content.
Keywords for this article
Algorithms for compressed strings;
compressed word problems;
computational complexity
