A three-string approach to the closest string problem (Q414864): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+W32
@@ Property / Mathematics Subject Classification ID: 68W32 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+D20
@@ Property / Mathematics Subject Classification ID: 92D20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6033486
@@ Property / zbMATH DE Number: 6033486 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational biology
@@ Property / zbMATH Keywords: computational biology / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+the closest string problem
@@ Property / zbMATH Keywords: the closest string problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fixed-parameter algorithms
@@ Property / zbMATH Keywords: fixed-parameter algorithms / rank @@
+Normal rank
@@ 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.jcss.2011.01.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2032287082
@@ Property / OpenAlex ID: W2032287082 / rank @@
+Normal rank
@@ Property / cites work @@
+Space and Time Efficient Algorithms for Planted Motif Search
+Normal rank
@@ Property / cites work @@
+Genetic Design of Drugs Without Side-Effects
@@ Property / cites work: Genetic Design of Drugs Without Side-Effects / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized intractability of motif search problems
+Normal rank
@@ Property / cites work @@
+On covering problems of codes
@@ Property / cites work: On covering problems of codes / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Distinguishing string selection problems.
@@ Property / cites work: Distinguishing string selection problems. / rank @@
+Normal rank
@@ Property / cites work @@
+On the closest string and substring problems
@@ Property / cites work: On the closest string and substring problems / rank @@
+Normal rank
@@ Property / cites work @@
+More Efficient Algorithms for Closest String and Substring Problems
+Normal rank
@@ Property / cites work @@
+Closest Substring Problems with Small Distances
@@ Property / cites work: Closest Substring Problems with Small Distances / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Solutions for the Closest-String Problem via Integer Programming
+Normal rank
@@ Property / cites work @@
+Complexities of the Centre and Median String Problems
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for the 1-mismatch problem
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:414864