Publication:4252402
From MaRDI portal
zbMath0929.68086MaRDI QIDQ4252402
Jesper Jansson, Leszek Gąsieniec, Andrzej Lingas
Publication date: 17 June 1999
Related Items
Unnamed Item, The k-centre problem for classes of cyclic words, On approximating string selection problems with outliers, Exact algorithm and heuristic for the closest string problem, Efficient algorithms for consensus string problems minimizing both distance sum and radius, The consensus string problem for a metric is NP-complete, Approximation algorithms for Hamming clustering problems, Distinguishing string selection problems., Sublinear time motif discovery from multiple sequences, A parallel multistart algorithm for the closest string problem, An algorithm for the maximum likelihood problem on evolutionary trees, On the parameterized complexity of clustering problems for incomplete data