The following pages link to (Q4252402):
Displayed 12 items.
- On approximating string selection problems with outliers (Q391209) (← 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)
- The consensus string problem for a metric is NP-complete (Q876700) (← links)
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Sublinear time motif discovery from multiple sequences (Q1736589) (← links)
- A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
- An algorithm for the maximum likelihood problem on evolutionary trees (Q2576441) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- (Q5859848) (← links)
- The k-centre problem for classes of cyclic words (Q6169545) (← links)