scientific article; zbMATH DE number 1305511
From MaRDI portal
Publication:4252402
Recommendations
Cited in
(20)- On approximating string selection problems with outliers
- A parallel multistart algorithm for the closest string problem
- Sublinear time motif discovery from multiple sequences
- Approximation algorithms for Hamming clustering problems
- scientific article; zbMATH DE number 7650314 (Why is no real title available?)
- scientific article; zbMATH DE number 1615274 (Why is no real title available?)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius
- Distinguishing string selection problems.
- The k-centre problem for classes of cyclic words
- The consensus string problem for a metric is NP-complete
- On the Efficiency of the Hamming C-Centerstring Problems
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities
- Exact algorithm and heuristic for the closest string problem
- The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem
- The center location improvement problem under the Hamming distance
- On the parameterized complexity of clustering problems for incomplete data
- An algorithm for the maximum likelihood problem on evolutionary trees
- The Closest Pair Problem under the Hamming Metric
- A comparison of rhythmic dissimilarity measures
- scientific article; zbMATH DE number 1066966 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252402)
