Fast, practical algorithms for computing all the repeats in a string (Q626893): Difference between revisions

@@ Property / cites work @@
+Replacing suffix trees with enhanced suffix arrays
+Normal rank
@@ Property / cites work @@
+Q4820869
@@ Property / cites work: Q4820869 / rank @@
+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 @@
+Q4449231
@@ Property / cites work: Q4449231 / rank @@
+Normal rank
@@ Property / cites work @@
+New approaches for computer analysis of nucleic acid sequences.
+Normal rank
@@ Property / cites work @@
+Q4547749
@@ Property / cites work: Q4547749 / rank @@
+Normal rank
@@ Property / cites work @@
+Space Efficient Linear Time Construction of Suffix Arrays
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering a lightweight suffix array construction algorithm
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Substring Equivalence Classes with Suffix Arrays
+Normal rank
@@ Property / cites work @@
+Fast, practical algorithms for computing all the repeats in a string
+Normal rank
@@ Property / cites work @@
+Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
+Normal rank