| Literature DB >> 8790475 |
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.Mesh:
Year: 1994 PMID: 8790475 DOI: 10.1089/cmb.1994.1.337
Source DB: PubMed Journal: J Comput Biol ISSN: 1066-5277 Impact factor: 1.479