Pages that link to "Item:Q336747"
From MaRDI portal
The following pages link to The selective fixing algorithm for the closest string problem (Q336747):
Displaying 9 items.
- On a cyclic string-to-string correction problem (Q911767) (← links)
- An improved algorithm for solving the banded cyclic string-to-string correction problem (Q1129017) (← links)
- An improved integer linear programming formulation for the closest 0-1 string problem (Q1652195) (← links)
- Improved LP-based algorithms for the closest string problem (Q1762033) (← links)
- Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
- Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
- Randomized and Parameterized Algorithms for the Closest String Problem (Q5165596) (← links)
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)