In SW algorithm, to align two sequences of lengths of m and n ________ – McqOptions

MCQOPTIONS

1.	In SW algorithm, to align two sequences of lengths of m and n _________ time is required.
A.	O(mn)
B.	O(m<sup>2</sup>n)
C.	O(m<sup>2</sup>n<sup>3</sup>)
D.	O(mn<sup>2</sup>)
Answer» C. O(m<sup>2</sup>n<sup>3</sup>)

Discussion

No Comment Found

Related MCQs

The function of the scoring matrix is to conduct one-to-one comparisons between all components in two sequences and record the optimal alignment results.
Score can be negative in Smith Waterman algorithm.
One of the challenges in SWA is obtaining correct alignments in regions of low similarity between distantly related biological sequences.
In SW algorithm, to align two sequences of lengths of m and n _________ time is required.
Local sequence alignments are necessary for many cases out of which one is repeated.
In Smith Waterman algorithm, in initialization Step, the _________ row and ________ column are subject to gap penalty.
Par Align is a web-based server that uses parallel processors to perform exhaustive sequence comparisons using either a parallelized version of the Smith Waterman algorithm or a heuristic program for further speed gains.
The rigorous dynamic programming method is normally not used for database searching because it is slow and computationally expensive.