scientific article; zbMATH DE number 1305511

zbMATH Open0929.68086MaRDI QIDQ4252402FDOQ4252402

Authors: Jesper Jansson, Leszek Gąsieniec, Andrzej Lingas 

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Hamming center problem

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• Approximation algorithms for Hamming clustering problems
• Title not available (Why is that?)
• 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
• The Closest Pair Problem under the Hamming Metric
• An algorithm for the maximum likelihood problem on evolutionary trees
• A comparison of rhythmic dissimilarity measures
• Title not available (Why is that?)

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)