The following pages link to On covering problems of codes (Q675858):
Displayed 7 items.
- 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)
- Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
- On some optimization problems in molecular biology (Q2643356) (← links)