The following pages link to (Q4474112):
Displayed 12 items.
- Configurations and minority in the string consensus problem (Q289911) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications (Q507397) (← 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)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
- Hard problems in similarity searching (Q1885825) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)