Complexities of the Centre and Median String Problems

DOI10.1007/3-540-44888-8_23zbMath1279.68107OpenAlexW1589348829MaRDI QIDQ3550844

Eric Rivals, François Nicolas

Publication date: 6 April 2010

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44888-8_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

A three-string approach to the closest string problem ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings ⋮ Hardness results for the center and median string problems under the weighted and unweighted edit distances ⋮ Randomized fixed-parameter algorithms for the closest string problem

This page was built for publication: Complexities of the Centre and Median String Problems