The consensus string problem for a metric is NP-complete

Authors:
Jeong Seop Sim;Kunsoo Park
Affiliations:
Electronics and Telecommunications Research Institute, Daejeon 305-350, South Korea;School of Computer Science and Engineering, Seoul National University, Seoul 151-742, South Korea
Venue:
Journal of Discrete Algorithms
Year:
2003

Citing 10
Cited 7

Trees, stars, and multiple biological sequence alignment

SIAM Journal on Applied Mathematics
Mapping and interpreting biological information

Communications of the ACM
Mapping the genome: some combinatorial problems arising in molecular biology

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More on the complexity of common superstring and supersequence problems

Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Finding similar regions in many strings

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distinguishing string selection problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation algorithms for the Hamming center problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
Banishing Bias from Consensus Sequences

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching

A probabilistic beam search approach to the shortest common supersequence problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
An artificial immune system-inspired multiobjective evolutionary algorithm with application to the detection of distributed computer network intrusions

ICARIS'07 Proceedings of the 6th international conference on Artificial immune systems
A class of generalized median contour problem with exact solution

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Generalized median string computation by means of string embedding in vector spaces

Pattern Recognition Letters
Implicitly intersecting weighted automata using dual decomposition

NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Evolutionary weighted mean based framework for generalized median computation with application to strings

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Ensemble clustering by means of clustering embedding in vector spaces

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set S of strings, a consensus string of S based on consensus error is a string w that minimizes the sum of the distances between w and all the strings in S. In this paper, we show that the problem of finding a consensus string based on consensus error is NP-complete when the penalty matrix is a metric.