In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets under all fixed metrics: MULTIPLE ALIGNMENT with SP-score, STAR ALIGNMENT, and TREE ALIGNMENT (for a given phylogeny). Earlier these problems have only been shown intractable for sporadic alphabets and distances, here the intractability is settled. Moreover, the construction can be extended to prove NP-hardness results for CONSENSUS PATTERNS and SUBSTRING PARSIMONY. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Elias, I. (2003). Settling the intractability of multiple alignment. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2906, 352–363. https://doi.org/10.1007/978-3-540-24587-2_37
Mendeley helps you to discover research relevant for your work.