Q. In heuristic methods, speed doesn’t vary with the size of database.

View solution

Q. An increase in sensitivity is associated with _______ in selectivity.

View solution

Q. Which of the following is incorrect?

View solution

Q. Currently, there are two major heuristic algorithms for performing database searches: BLAST and FASTA.

View solution

Q. Which of the following is incorrect the ‘word’ method?

View solution

Q. The BLAST program was developed in _______

View solution

Q. In sequence alignment by BLAST, each word from query sequence is typically _______ residues for protein sequences and _______ residues for DNA sequences.

View solution

Q. In sequence alignment by BLAST, the second step is to search a sequence database for the occurrence of these words.

View solution

Q. The final step involves pairwise alignment by extending from the words in both directions while counting the alignment score using the same substitution matrix.

View solution

Q. A recent improvement in the implementation of BLAST is the ability to provide gapped alignment.

View solution

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

View solution

Q. BLASTX uses protein sequences as queries to search against a protein sequence database.

View solution

Q. TBLASTX queries protein sequences to anucleotide sequence database with the sequences translated in all six reading frames.

View solution

Q. Which of the following is not correct about BLAST?

View solution

Q. If one is looking for protein homologs encoded in newly sequenced genomes, one may use TBLASTN, which translates nucleotide database sequences in all six open reading frames.

View solution

Q. Which of the following is not correct about FASTA?

View solution

Q. The first step in FASTA alignment id to arrange the sequences in matrices’ rows and columns in order to be analyzed.

View solution

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

View solution

Q. The second step in FASTA is to narrow down the high similarity regions between the two sequences.

View solution

Q. In FASTA, neighboring high-scoring segments along the same diagonal are selected and joined to form a single alignment.

View solution