Settling the Intractability of Multiple Alignment (2003)
| Venue: | Proc. of the 14th Ann. Int. Symp. on Algorithms and Computation (ISAAC |
| Citations: | 9 - 0 self |
BibTeX
@INPROCEEDINGS{Elias03settlingthe,
author = {Isaac Elias},
title = {Settling the Intractability of Multiple Alignment},
booktitle = {Proc. of the 14th Ann. Int. Symp. on Algorithms and Computation (ISAAC},
year = {2003},
pages = {352--363},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 xed 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, Consensus Patterns and Substring Parsimony are shown NP-hard.
