Computing Equality-Free String Factorisations (Q3195710): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-20028-6_32
+Normal rank
@@ Property / OpenAlex ID @@
+W2279704821
@@ Property / OpenAlex ID: W2279704821 / rank @@
+Normal rank
@@ 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