From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055): Difference between revisions

@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+A locally adaptive data compression scheme
@@ Property / cites work: A locally adaptive data compression scheme / rank @@
+Normal rank
@@ Property / cites work @@
+Linear approximation of shortest superstrings
@@ Property / cites work: Linear approximation of shortest superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3681047
@@ Property / cites work: Q3681047 / rank @@
+Normal rank
@@ Property / cites work @@
+Boosting textual compression in optimal linear time
+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 @@
+Q3659988
@@ Property / cites work: Q3659988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4681771
@@ Property / cites work: Q4681771 / rank @@
+Normal rank
@@ Property / cites work @@
+Burrows-Wheeler transform and Sturmian words
@@ Property / cites work: Burrows-Wheeler transform and Sturmian words / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of the Burrows—Wheeler transform
@@ Property / cites work: An analysis of the Burrows—Wheeler transform / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed representations of sequences and full-text indexes
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank