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²n)
C.	O(m²n³)
D.	O(mn²)
Answer» C. O(m²n³)

Discussion

No Comment Found

Related MCQs

Which of the following is not a variant of BLAST?
Z-score describes the number of standard deviations from the mean score for the database search.
Which of the following is not a benefit of BLAST?
Scan PS is a web-based program that implements a modified version of the Needleman-Wunsch algorithm.
BLASTX uses protein sequences as queries to search against a protein sequence database.
The positional difference for each word between the two sequences is obtained by ________ the position of the ______ sequence from that of the _______ sequence and is expressed as the offset.
BLAST might not find matches for very short sequences.
The second step in FASTA is to narrow down the high similarity regions between the two sequences.
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.
Which of the following is not correct about FASTA?