A polynomial time approximation scheme for the closest substring problem
From MaRDI portal
Recommendations
- On the closest string and substring problems
- Complexity of approximating closest substring problems.
- More efficient algorithms for closest string and substring problems
- An improved lower bound on approximation algorithms for the closest substring problem
- A Lower Bound on Approximation Algorithms for the Closest Substring Problem
Cited in
(20)- On the complexity of finding common approximate substrings.
- On the kernelization complexity of string problems
- Finding similar regions in many sequences
- Hardness results for the center and median string problems under the weighted and unweighted edit distances
- Finding similar regions in many strings
- On the closest string and substring problems
- More efficient algorithms for closest string and substring problems
- A Lower Bound on Approximation Algorithms for the Closest Substring Problem
- On approximating string selection problems with outliers
- scientific article; zbMATH DE number 2086667 (Why is no real title available?)
- A polynomial time approximation scheme for the closest shared center problem
- Parameterized Complexity Analysis for the Closest String with Wildcards Problem
- Combinatorial Pattern Matching
- Lower bounds for approximation schemes for Closest String
- Fundamentals of Computation Theory
- Complexity of approximating closest substring problems.
- Sublinear time approximation schemes for makespan minimization on parallel machines
- Sublinear algorithms for scheduling with chain precedence constraints
- On the longest common rigid subsequence problem
- An improved lower bound on approximation algorithms for the closest substring problem
This page was built for publication: A polynomial time approximation scheme for the closest substring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723943)
