On the complexity of multiple sequence alignment
- PMID: 8790475
- DOI: 10.1089/cmb.1994.1.337
On the complexity of multiple sequence alignment
Abstract
We study the computational complexity of two popular problems in multiple sequence alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the first problem is NP-complete and the second is MAX SNP-hard. The complexity of tree alignment with a given phylogeny is also considered.
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
Other Literature Sources
Miscellaneous