Designing and Implementing Algorithms for the Closest String Problem
From MaRDI portal
Publication:4632205
Recommendations
- Designing and implementing algorithms for the closest string problem
- Exact algorithm and heuristic for the closest string problem
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- A recursive exact algorithm for the closest string problem
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- More efficient algorithms for closest string and substring problems
- Randomized and Parameterized Algorithms for the Closest String Problem
- Algorithms for closest and farthest string problems via rank distance
- The selective fixing algorithm for the closest string problem
Cites work
- A three-string approach to the closest string problem
- Distinguishing string selection problems.
- Enumerating Neighbour and Closest Strings
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- More efficient algorithms for closest string and substring problems
- On covering problems of codes
- Randomized fixed-parameter algorithms for the closest string problem
Cited in
(5)- Designing and implementing algorithms for the closest string problem
- Randomized fixed-parameter algorithms for the closest string problem
- A three-string approach to the closest string problem
- A three-string approach to the closest string problem
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
This page was built for publication: Designing and Implementing Algorithms for the Closest String Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632205)