Optimal superprimitivity testing for strings
Information Processing Letters
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Let sleeping files lie: pattern matching in Z-compressed files
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Pattern Matching and Membership for Hierarchical Message Sequence Charts
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Approximate String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Collage system: a unifying framework for compressed pattern matching
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Regular expression searching on compressed text
Journal of Discrete Algorithms
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM (JACM)
Window subsequence problems for compressed texts
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Theoretical Computer Science
Unification with Singleton Tree Grammars
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Computing longest common substring and all palindromes from compressed strings
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Testing square-freeness of strings compressed by balanced straight line program
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Fast distance multiplication of unit-Monge matrices
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Compressed conjugacy and the word problem for outer automorphism groups of graph groups
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Unification and matching on compressed terms
ACM Transactions on Computational Logic (TOCL)
Leaf languages and string compression
Information and Computation
Compressed membership in automata with compressed labels
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Towards approximate matching in compressed strings: local subsequence recognition
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Isomorphism of regular trees and words
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Compressedword problems for inverse monoids
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Congruence closure of compressed terms in polynomial time
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Fast q-gram mining on SLP compressed strings
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast equality test for straight-line compressed strings
Information Processing Letters
Grammar-based compression in a streaming model
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Computing q-gram non-overlapping frequencies on SLP compressed texts
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences
Indexed multi-pattern matching
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Tracing compressed curves in triangulated surfaces
Proceedings of the twenty-eighth annual symposium on Computational geometry
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters
New algorithms for unification modulo one-sided distributivity and its variants
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Faster algorithm for computing the edit distance between SLP-Compressed strings
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Fast q-gram mining on SLP compressed strings
Journal of Discrete Algorithms
Isomorphism of regular trees and words
Information and Computation
| Hi-index | 0.00 |
What kind of operations can we perform effectively (without full unpacking) with compressed texts? In this paper we consider three fundamental problems: (1) check the equality of two compressed texts, (2) check whether one compressed text is a substring of another compressed text, and (3) compute the number of different symbols (Hamming distance) between two compressed texts of the same length. We present an algorithm that solves the first problem in O(n3) time and the second problem in O(n2m) time. Here n is the size of compressed representation (we consider representations by straight-line programs) of the text and m is the size of compressed representation of the pattern. Next, we prove that the third problem is actually #P-complete. Thus, we indicate a pair of similar problems (equivalence checking, Hamming distance computation) that have radically different complexity on compressed texts. Our algorithmic technique used for problems (1) and (2) helps for computing minimal periods and covers of compressed texts.