„Grammar based compression“
Suchergebnisse
1.000+ Treffer
-
Fast equality test for straight-line compressed strings
-
Combinatorial Pattern Matching – 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
-
Analysis of grammar-based tree compression
-
Human Readable Compression of GFA Paths Using Grammar-Based Code
-
Recursive Parsing and Grammar Compression in the Era of Pangenomics (Invited Talk)
-
Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access
-
Grammar-based compression approach to extraction of common rules among multiple trees of glycans and RNAs
-
Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures
-
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
-
On the Complexity of Grammar-Based Compression over Fixed Alphabets
-
A Space-Saving Approximation Algorithm for Grammar-Based Compression
-
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words
-
Compression by Contracting Straight-Line Programs
-
Constructing Small Tree Grammars and Small Circuits for Formulas
-
Approximation of smallest linear tree grammar
-
Matching of Compressed Patterns with Character-Variables
-
Dictionary-Based Tree Compression (Invited Talk)
-
Leaf languages and string compression
-
Combinatorial and information-theoretic aspects of tree compression
-
Grammar-based compression for strings and trees