On approximating string selection problems with outliers (Q391209): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2013.05.037
@@ Property / DOI: 10.1016/j.tcs.2013.05.037 / 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.2013.05.037
+Normal rank
@@ Property / OpenAlex ID @@
+W2180828828
@@ Property / OpenAlex ID: W2180828828 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Periodicity
@@ Property / cites work: Approximate Periodicity / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle Detection and Correction
@@ Property / cites work: Cycle Detection and Correction / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+A three-string approach to the closest string problem
+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 @@
+On the parameterized intractability of motif search problems
+Normal rank
@@ Property / cites work @@
+On some optimization problems in molecular biology
+Normal rank
@@ Property / cites work @@
+Efficient solutions for the far from most string problem
+Normal rank
@@ Property / cites work @@
+On covering problems of codes
@@ Property / cites work: On covering problems of codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252402
@@ Property / cites work: Q4252402 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized intractability of distinguishing substring selection
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for CLOSEST STRING and related problems
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
+Normal rank
@@ Property / cites work @@
+Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
+Normal rank
@@ Property / cites work @@
+Distinguishing string selection problems.
@@ Property / cites work: Distinguishing string selection problems. / rank @@
+Normal rank
@@ Property / cites work @@
+Finding similar regions in many sequences
@@ Property / cites work: Finding similar regions in many sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723943
@@ Property / cites work: Q2723943 / rank @@
+Normal rank
@@ Property / cites work @@
+More Efficient Algorithms for Closest String and Substring Problems
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+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 @@
+Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2013.05.037
@@ Property / DOI: 10.1016/J.TCS.2013.05.037 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:391209