Improved optimization modelling for the closest string and related problems
From MaRDI portal
Recommendations
- Optimal solutions for the closest-string problem via integer programming
- An improved integer linear programming formulation for the closest 0-1 string problem
- A closer look at the closest string and closest substring problem
- Improved LP-based algorithms for the closest string problem
- Optimum Solution of the Closest String Problem via Rank Distance
Cites work
- scientific article; zbMATH DE number 2081011 (Why is no real title available?)
- A parallel multistart algorithm for the closest string problem
- An optimization modelling for string selection in molecular biology using Pareto optimality
- Distinguishing string selection problems.
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- On covering problems of codes
- On some multiobjective optimization problems arising in biology
- On some optimization problems in molecular biology
- On the closest string and substring problems
- Optimal solutions for the closest-string problem via integer programming
Cited in
(8)- Improved LP-based algorithms for the closest string problem
- Optimal solutions for the closest-string problem via integer programming
- An optimization modelling for string selection in molecular biology using Pareto optimality
- Best approximations of fitness functions of binary strings
- An improved integer linear programming formulation for the closest 0-1 string problem
- Optimum Solution of the Closest String Problem via Rank Distance
- A closer look at the closest string and closest substring problem
- scientific article; zbMATH DE number 7203332 (Why is no real title available?)
This page was built for publication: Improved optimization modelling for the closest string and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651767)
