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

View solution

Q. The number of possible global alignments between two sequences of length N is _____

View solution

Q. Which of the following is untrue about Needleman-Wunsch algorithm?

View solution

Q. There are two types matrices involved in the study- score matrices and trace matrices.

View solution

Q. Progressive alignment methods use the dynamic programming method to build an MSA starting with the most related sequences and then progressively adding less related sequences or groups of sequences to the initial alignment.

View solution

Q. Progenitor sequences represented by the ______ branches of the tree are derived by alignment of the _______ sequences.

View solution

Q. CLUSTALW is a more recent version of CLUSTAL with the W standing for ________

View solution

Q. The CLUSTALX provides a graphic interface.

View solution

Q. Which of the following is untrue about CLUSTAL program?

View solution

Q. The initial alignments used to produce the guide tree may be obtained by various methods. Which of the following is not one of them?

View solution

Q. The scoring of gaps in a MSA (Multiple Sequence Alignment) has to be performed in a different manner from scoring gaps in a pair-wise alignment.

View solution

Q. Like other alignment programs, CLUSTAL uses a null score for opening a gap in a sequence alignment and a penalty for extending the gap by one residue.

View solution

Q. Which of the following is untrue about PILEUP program?

View solution

Q. The resulting tree is then used to guide the alignment of the most closely related sequences and groups of sequences. The resulting alignment is a global alignment produced by the Needleman-Wunsch algorithm.

View solution

Q. Iterative methods include repeatedly realigning subgroups of the sequences and then by aligning these subgroups into a local alignment of all of the sequences.

View solution

Q. Which of the following is incorrect regarding PRRP?

View solution

Q. In the program DIALIGN, pairs of sequences are aligned to locate aligned regions that do not include gaps, much like continuous diagonals in a dot matrix plot.

View solution

Q. The Genetic Algorithm method has been recently adapted for MSA(Multiple Sequence Alignment) by Corpet (1998).

View solution

Q. An approach for obtaining a higher-scoring MSA (Multiple Sequence Alignment) by rearranging an existing alignment uses a probability approach called simulated annealing.

View solution

Q. The first step in Genetic Algorithm is arranging the sequences to be aligned in rows.

View solution