On approximating string selection problems with outliers
From MaRDI portal
Publication:391209
DOI10.1016/j.tcs.2013.05.037zbMath1296.68202OpenAlexW2180828828MaRDI QIDQ391209
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.037
Related Items (2)
On the role of metaheuristic optimization in bioinformatics ⋮ Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A three-string approach to the closest string problem
- On covering problems of codes
- On the parameterized intractability of motif search problems
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Distinguishing string selection problems.
- Efficient solutions for the far from most string problem
- Finding similar regions in many sequences
- Parameterized intractability of distinguishing substring selection
- On some optimization problems in molecular biology
- Detecting high log-densities
- Approximate Periodicity
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Closest Substring Problems with Small Distances
- More Efficient Algorithms for Closest String and Substring Problems
- Cycle Detection and Correction
- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- Genetic Design of Drugs Without Side-Effects
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- Some optimal inapproximability results
- Algorithms – ESA 2005
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
This page was built for publication: On approximating string selection problems with outliers
