Q. In a multidimensional search matrix, for aligning N sequences, an (N+2)-dimensional matrix is needed to be filled with alignment scores.

View solution

Q. As the amount of computational time and memory space required increases exponentially with the number of sequences, it makes the multidimensional search matrix method computationally prohibitive to use for a large data set.

View solution

Q. Which of the following is untrue about DCA?

View solution

Q. Which of the following is untrue regarding the Progressive Alignment Method?

View solution

Q. Clustal is a progressive multiple alignment program available either as a stand-alone or on-line program.

View solution

Q. Which of the following is untrue regarding the progressive alignment method?

View solution

Q. Which of the following is not a drawback of the progressive alignment method?

View solution

Q. Which of the following is untrue regarding T-Coffee?

View solution

Q. Which of the following is untrue about iterative approach?

View solution

Q. Which of the following is untrue about PRRN?

View solution

Q. The major drawback of the progressive and iterative alignment strategies is that they are largely global alignment based and may therefore fail to recognize conserved domains and motifs among highly divergent sequences of varying lengths.

View solution

Q. Which of the following is untrue about DIALIGN2?

View solution

Q. Match-Box compares segments of some of the nine residues of possible Pair wise alignments.

View solution

Q. Which of the following is not the objective to perform sequence comparison?

View solution

Q. A dotplot is a visual and qualitative technique whereas the sequence alignment is an exact and quantitative measure of similarity of alignments.

View solution

Q. The global sequence alignment is suitable when the two sequences are of dissimilar length, with a negligible degree of similarity throughout.

View solution

Q. The alignment score is the sum of substitution scores and gap penalties in this type of algorithm.

View solution

Q. The substitution matrices are rarely used in this type of matching.

View solution

Q. Which of the following is untrue about Protein substitution matrices?

View solution

Q. In Needleman-Wunsch algorithm, the gaps are scored -2.

View solution