Text algorithms
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Estimating DNA sequence entropy
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for grammar-based compression
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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)
Some Theory and Practice of Greedy Off-Line Textual Substitution
DCC '98 Proceedings of the Conference on Data Compression
Grammar-based codes: a new class of universal lossless source codes
IEEE Transactions on Information Theory
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
A fully linear-time approximation algorithm for grammar-based compression
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
One-dimensional staged self-assembly
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Indexes for highly repetitive document collections
Proceedings of the 20th ACM international conference on Information and knowledge management
Improving time and space complexity for compressed pattern matching
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
One-dimensional staged self-assembly
Natural Computing: an international journal
| Hi-index | 0.00 |
We present almost linear time (O(n驴log |驴|) time) O(log n)- ratio approximation of minimal grammar-based compression of a given string of length n over an alphabet 驴 and O(k 驴 log n) time transformation of LZ77 encoding of size k into a grammar-based encoding of size O(k 驴 log n). Computing exact size of the minimal grammar-based compression is known to be NP-complete. The basic novel tool is the AVL-grammar.