Fast algorithms for finding a minimum repetition representation of strings and trees (Q2446339): Difference between revisions

@@ 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.dam.2012.12.013
+Normal rank
@@ Property / OpenAlex ID @@
+W1978358522
@@ Property / OpenAlex ID: W1978358522 / rank @@
+Normal rank
@@ Property / cites work @@
+Variations on the Common Subexpression Problem
@@ Property / cites work: Variations on the Common Subexpression Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The exact number of squares in Fibonacci words
@@ Property / cites work: The exact number of squares in Fibonacci words / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for finding and representing all the tandem repeats in a string
+Normal rank
@@ Property / cites work @@
+WORD COMPLEXITY AND REPETITIONS IN WORDS
@@ Property / cites work: WORD COMPLEXITY AND REPETITIONS IN WORDS / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for finding all repetitions in a string
+Normal rank
@@ Property / cites work @@
+Fast algorithms for finding a minimum repetition representation of strings and trees
+Normal rank
@@ Property / cites work @@
+Modeling by shortest data description
@@ Property / cites work: Modeling by shortest data description / rank @@
+Normal rank
@@ Property / cites work @@
+Simple and flexible detection of contiguous repeats using a suffix tree
+Normal rank
@@ Property / cites work @@
+A universal algorithm for sequential data compression
+Normal rank