The consensus string problem for a metric is NP-complete

Jeong Seop Sim, Kunsoo Park. The consensus string problem for a metric is NP-complete. J. Discrete Algorithms, 1(1):111-117, 2003. [doi]

Abstract

Abstract is missing.