Computing equality-free and repetitive string factorisations (Q2634669): Difference between revisions

@@ Property / cites work @@
+Q4967170
@@ Property / cites work: Q4967170 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis
+Normal rank
@@ Property / cites work @@
+The complexity of string partitioning
@@ Property / cites work: The complexity of string partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Q2955004
@@ Property / cites work: Q2955004 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Diverse Palindromic Factorization Is NP-complete
@@ Property / cites work: Diverse Palindromic Factorization Is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Exact Block Cover Problem
@@ Property / cites work: On the Exact Block Cover Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Pattern Matching in Strings
@@ Property / cites work: Fast Pattern Matching in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4341774
@@ Property / cites work: Q4341774 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Equality-Free String Factorisations
@@ Property / cites work: Computing Equality-Free String Factorisations / rank @@
+Normal rank