Searching for smallest grammars on large sequences and application to DNA (Q414452): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2011.04.006
@@ Property / DOI: 10.1016/j.jda.2011.04.006 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2011.04.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2060610818
@@ Property / OpenAlex ID: W2060610818 / rank @@
+Normal rank
@@ Property / cites work @@
+Replacing suffix trees with enhanced suffix arrays
+Normal rank
@@ Property / cites work @@
+Data structures and algorithms for the string statistics problem
+Normal rank
@@ Property / cites work @@
+Q4737203
@@ Property / cites work: Q4737203 / rank @@
+Normal rank
@@ Property / cites work @@
+Choosing Word Occurrences for the Smallest Grammar Problem
+Normal rank
@@ Property / cites work @@
+The Smallest Grammar Problem
@@ Property / cites work: The Smallest Grammar Problem / rank @@
+Normal rank
@@ Property / cites work @@
+IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS
+Normal rank
@@ Property / cites work @@
+A new challenge for compression algorithms: Genetic sequences
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Q4347161
@@ Property / cites work: Q4347161 / rank @@
+Normal rank
@@ Property / cites work @@
+Grammar-based codes: a new class of universal lossless source codes
+Normal rank
@@ Property / cites work @@
+Linear-time text compression by longest-first substitution
+Normal rank
@@ Property / cites work @@
+Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2011.04.006
@@ Property / DOI: 10.1016/J.JDA.2011.04.006 / rank @@
+Normal rank