Parameterized complexity analysis for the closest string with wildcards problem (Q495996): Difference between revisions

@@ Property / describes a project that uses @@
+HapCUT
@@ Property / describes a project that uses: HapCUT / 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.tcs.2015.06.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2180648128
@@ Property / OpenAlex ID: W2180648128 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Polynomial and APX-hard cases of the individual haplotyping problem
+Normal rank
@@ Property / cites work @@
+A three-string approach to the closest string problem
+Normal rank
@@ Property / cites work @@
+A Closer Look at the Closest String and Closest Substring Problem
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+On the parameterized intractability of motif search problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+On covering problems of codes
@@ Property / cites work: On covering problems of codes / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796705
@@ Property / cites work: Q4796705 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252342
@@ Property / cites work: Q4252342 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+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 @@
+A dynamic programming algorithm for the \(k\)-haplotyping problem
+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 @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4408101
@@ Property / cites work: Q4408101 / rank @@
+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
@@ Property / cites work @@
+An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs
+Normal rank
@@ Property / cites work @@
+Haplotype assembly from aligned weighted SNP fragments
+Normal rank