scientific article; zbMATH DE number 1305511

zbMath0929.68086MaRDI QIDQ4252402

Jesper Jansson, Leszek Gąsieniec, Andrzej Lingas

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamming center problem

Mathematics Subject Classification ID

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

Related Items (12)

The consensus string problem for a metric is NP-complete ⋮ Approximation algorithms for Hamming clustering problems ⋮ On approximating string selection problems with outliers ⋮ Unnamed Item ⋮ The k-centre problem for classes of cyclic words ⋮ On the parameterized complexity of clustering problems for incomplete data ⋮ Distinguishing string selection problems. ⋮ Sublinear time motif discovery from multiple sequences ⋮ A parallel multistart algorithm for the closest string problem ⋮ Exact algorithm and heuristic for the closest string problem ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ An algorithm for the maximum likelihood problem on evolutionary trees

This page was built for publication: