Q. Z-score describes the number of standard deviations from the mean score for the database search.

View solution

Q. In FASTA, For a Z-score > 15, the match can be considered extremely ______ with _____ of a homologous relationship.

View solution

Q. BLAST uses a _______ to find matching words, whereas FASTA identifies identical matching words using the _____

View solution

Q. Which of the following is not a benefit or a factual of FASTA over BLAST?

View solution

Q. The use of low-complexity masking in the BLAST procedure means that it may have higher specificity than FASTA because potential false positives are reduced.

View solution

Q. Which of the following is not a benefit of BLAST?

View solution

Q. BLAST might not find matches for very short sequences.

View solution

Q. BLAST often produces several short HSPs rather than a single aligned region.

View solution

Q. FASTA is derived from logic of the dot plot.

View solution

Q. The gapped portion in the diagonals represents matches in FASTA.

View solution

Q. The initiation of FASTA format has ____ symbol.

View solution

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