Q. The rigorous dynamic programming method is normally not used for database searching because it is slow and computationally expensive.

View solution

Q. FASTA and BLAST are __________ but __________ for larger datasets.

View solution

Q. Scan PS is a web-based program that implements a modified version of the Needleman-Wunsch algorithm.

View solution

Q. 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.

View solution

Q. In Smith–Waterman algorithm, in initialization Step, the _________ row and ________ column are subject to gap penalty.

View solution

Q. Local sequence alignments are necessary for many cases out of which one is repeated.

View solution

Q. In SW algorithm, to align two sequences of lengths of m and n _________ time is required.

View solution

Q. One of the challenges in SWA is obtaining correct alignments in regions of low similarity between distantly related biological sequences.

View solution

Q. Score can be negative in Smith–Waterman algorithm.

View solution

Q. 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.

View solution