Pages that link to "Item:Q2890443"
From MaRDI portal
The following pages link to Optimal solutions for the closest-string problem via integer programming (Q2890443):
Displaying 19 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← links)
- The selective fixing algorithm for the closest string problem (Q336747) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- An optimization modelling for string selection in molecular biology using Pareto optimality (Q639159) (← links)
- Improved optimization modelling for the closest string and related problems (Q651767) (← links)
- Exact algorithm and heuristic for the closest string problem (Q716344) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- An improved integer linear programming formulation for the closest 0-1 string problem (Q1652195) (← links)
- Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
- Efficient solutions for the far from most string problem (Q1761847) (← links)
- A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029) (← links)
- Improved LP-based algorithms for the closest string problem (Q1762033) (← links)
- A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
- An algorithm for the maximum likelihood problem on evolutionary trees (Q2576441) (← links)
- Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
