Abstract
We survey the complexity issues related to several algorithmic problems for compressed one- and two-dimensional texts without explicit decompression: pattern-matching, equality-testing, computation of regularities, subsegment extraction, language membership, and solvability of word equations. Our basic problem is one- and two-dimensional pattern-matching together with its variations. For some types of compression the pattern-matching problems are unfeasible (NP-hard), for other types they are solvable in polynomial time and we discuss how to reduce the degree of corresponding polynomials.
Cite
CITATION STYLE
Rytter, W. (1999). Algorithms on compressed strings and arrays? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1725, pp. 48–65). Springer Verlag. https://doi.org/10.1007/3-540-47849-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
