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]

Authors

Jeong Seop Sim

This author has not been identified. Look up 'Jeong Seop Sim' in Google

Kunsoo Park

This author has not been identified. Look up 'Kunsoo Park' in Google