Randomized fixed-parameter algorithms for the closest string problem
From MaRDI portal
Publication:261382
DOI10.1007/s00453-014-9952-yzbMath1336.68118OpenAlexW1993117718MaRDI QIDQ261382
Bin Ma, Zhi-Zhong Chen, Lusheng Wang
Publication date: 23 March 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-014-9952-y
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Algorithms on strings (68W32)
Related Items (3)
Polynomial time approximation schemes for all 1-center problems on metric rational set similarities ⋮ Designing and Implementing Algorithms for the Closest String Problem ⋮ Designing and implementing algorithms for the closest string problem
Cites Work
- Unnamed Item
- A three-string approach to the closest string problem
- On covering problems of codes
- On the parameterized intractability of motif search problems
- Improved parameterized set splitting algorithms: A Probabilistic approach
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Distinguishing string selection problems.
- Optimal Solutions for the Closest-String Problem via Integer Programming
- On the closest string and substring problems
- Closest Substring Problems with Small Distances
- Space and Time Efficient Algorithms for Planted Motif Search
- Complexities of the Centre and Median String Problems
- More Efficient Algorithms for Closest String and Substring Problems
- Genetic Design of Drugs Without Side-Effects
- Random Methods for Parameterized Problems
- A linear-time algorithm for the 1-mismatch problem
- Combinatorial Pattern Matching
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- Fixed-parameter tractability of multicut parameterized by the size of the cutset
- Fundamentals of Computation Theory
- Fundamentals of Computation Theory
This page was built for publication: Randomized fixed-parameter algorithms for the closest string problem
