1994
DOI: 10.1089/cmb.1994.1.337
|View full text |Cite
|
Sign up to set email alerts
|

On the Complexity of Multiple Sequence Alignment

Abstract: We study the computational complexity o f t wo popular problems in multiple sequence alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the rst problem is NP-complete and the second is MAX SNP-hard. The complexity of tree alignment with a given phylogeny is also considered.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
431
1
9

Year Published

1999
1999
2014
2014

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 781 publications
(441 citation statements)
references
References 15 publications
0
431
1
9
Order By: Relevance
“…It is known as the multiple sequence alignment of the set, and is often considered the "Holy Grail" in computational biology [22]. Multiple sequence alignment is NP-complete [23], which prevents its computation for more than a few short sequences.…”
Section: Nltsmentioning
confidence: 99%
“…It is known as the multiple sequence alignment of the set, and is often considered the "Holy Grail" in computational biology [22]. Multiple sequence alignment is NP-complete [23], which prevents its computation for more than a few short sequences.…”
Section: Nltsmentioning
confidence: 99%
“…Unfortunately, this problem is known to be NP-Hard (Wang and Jiang, 1994), meaning that no polynomial time solution exists (unless P=NP). In other words, the search for vertex median sequences is as hard as the phylogeny search problem over The tree alignment minimization assigns medians {S 7 .…”
Section: The Tree-alignment Problemmentioning
confidence: 99%
“…Since this method is an all-againstall distance evaluation based and is not based on alignment, its time complexity compares favorably with the current Multiple Sequence Alignments. There is no doubt that an optimal multi sequence alignment is more desirable though it is NP-hard [15]. More practical methods such as ClustallW [16,17] use progressive alignment methods for which the time complexity is still O(mL + L 2 ) to which clustering adds an additional term of (m 2 log(m)) where m and L represent the number and length of the aligned sequences respectively.…”
Section: Fig 2 Algorithmic Operation Of the Emm Differentiatormentioning
confidence: 99%