scientific article; zbMATH DE number 1305511

MaRDI QIDQ4252402zbMATH OpenFDO

Authors Jesper Jansson, Leszek Gąsieniec, Andrzej Lingas

Publication date 17 June 1999

zbMATH Keywords

Hamming center problem

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximation algorithms for Hamming clustering problems
• scientific article; zbMATH DE number 1615274
• On the closest string and substring problems
• On the Efficiency of the Hamming C-Centerstring Problems

Cited in

(27)

• Distinguishing string selection problems.
• Sublinear time motif discovery from multiple sequences
• The center location improvement problem under the Hamming distance
• The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem
• A parallel multistart algorithm for the closest string problem
• An algorithm for the maximum likelihood problem on evolutionary trees
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities
• On the parameterized complexity of clustering problems for incomplete data
• scientific article; zbMATH DE number 1615274 (Why is no real title available?)
• On approximating string selection problems with outliers
• scientific article; zbMATH DE number 1066966 (Why is no real title available?)
• On computing centroids according to the p-norms of Hamming distance vectors
• On Finding the Jaccard Center
• On the Efficiency of the Hamming C-Centerstring Problems
• The Closest Pair Problem under the Hamming Metric
• A comparison of rhythmic dissimilarity measures
• scientific article; zbMATH DE number 7650314 (Why is no real title available?)
• The k-centre problem for classes of cyclic words
• From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
• From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
• Finding a cluster in incomplete data
• Exact algorithm and heuristic for the closest string problem
• Efficient algorithms for consensus string problems minimizing both distance sum and radius
• On the complexity of finding 1-center spanning trees
• Binary k-center with missing entries: structure leads to tractability
• The consensus string problem for a metric is NP-complete
• Approximation algorithms for Hamming clustering problems

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)