Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algorithmics on SLP-compressed strings: A survey

Algorithmics on SLP-compressed strings: A survey 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Algorithmics on SLP-compressed strings: A survey

Lohrey, Markus
Groups - Complexity - Cryptology , Volume 4 (2) – Dec 1, 2012
Download PDF
59 pages

Loading next page...
 
/lp/de-gruyter/algorithmics-on-slp-compressed-strings-a-survey-22phBbwTBh

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © 2012 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2012-0016
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Groups - Complexity - Cryptology – de Gruyter

Published: Dec 1, 2012

There are no references for this article.