The following pages link to (Q4252342):
Displaying 22 items.
- The selective fixing algorithm for the closest string problem (Q336747) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications (Q507397) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
- The consensus string problem for a metric is NP-complete (Q876700) (← links)
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- The approximate period problem for DNA alphabet. (Q1401415) (← links)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- Distinguishing string selection problems. (Q1427861) (← 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)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← 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)
- Heuristic approaches to the distinguishing substring selection problem (Q1791942) (← links)
- Hard problems in similarity searching (Q1885825) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- RNA multiple structural alignment with longest common subsequences (Q2385486) (← links)
- Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
- On some optimization problems in molecular biology (Q2643356) (← links)
- On some multiobjective optimization problems arising in biology (Q2995503) (← links)
