Settling the intractability of multiple alignment.
Multiple alignment is a core problem in computational biology that has received much attention over the years, both in the line of heuristics and hardness results. In most expositions of the problem it is referred to as NP-hard and references are given to one of the available hardness results. However, previous to this paper not even the most elementary variation of the problem, multiple alignment under the unit metric, had been proved hard. The aim of this paper is to settle the NP-hardness of the most common variations of multiple alignment. The following variations are shown NP-hard for all metrics over binary or larger alphabets: MULTIPLE ALIGNMENT WITH SP-SCORE, STAR ALIGNMENT, and TREE ALIGNMENT (for a given phylogeny). In addition, NP-hardness results are provided for CONSENSUS PATTERNS and SUBSTRING PARSIMONY.
Elias
Isaac
I
Department of Numerical Analysis and Computer Science, KTH, Stockholm, Sweden. isaac@nada.kth.se
D001483:Base Sequence; D019295:Computational Biology / Q000379:methods*; D016415:Sequence Alignment / Q000379:methods*