The consensus string problem for a metric is NP-complete

From MaRDI portal
Publication:876700

DOI10.1016/S1570-8667(03)00011-XzbMath1118.68449MaRDI QIDQ876700

Jeong Seop Sim, Kun Soo Park

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)




Related Items (12)



Cites Work




This page was built for publication: The consensus string problem for a metric is NP-complete