Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070): Difference between revisions

@@ Property / cites work @@
+Parallel detection of all palindromes in a string
@@ Property / cites work: Parallel detection of all palindromes in a string / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for Lempel-Ziv encoding
@@ Property / cites work: Efficient algorithms for Lempel-Ziv encoding / rank @@
+Normal rank
@@ Property / cites work @@
+Developments in Language Theory
@@ Property / cites work: Developments in Language Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4347161
@@ Property / cites work: Q4347161 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal lossless compression via multilevel pattern matching
+Normal rank
@@ Property / cites work @@
+Processing Compressed Texts: A Tractability Border
+Normal rank
@@ Property / cites work @@
+Querying and Embedding Compressed Texts
@@ Property / cites work: Querying and Embedding Compressed Texts / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Longest Common Substring and All Palindromes from Compressed Strings
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A universal algorithm for sequential data compression
+Normal rank
@@ Property / cites work @@
+Compression of individual sequences via variable-rate coding
+Normal rank