Question

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

a.

outer, outermost

b.

inner, outermost

c.

inner, innermost

d.

outer, innermost

Answer: (b).inner, outermost

Interact with the Community - Share Your Thoughts

Uncertain About the Answer? Seek Clarification Here.

Understand the Explanation? Include it Here.

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

Similar Questions

Explore Relevant Multiple Choice Questions (MCQs)

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

Q. The CLUSTALX provides a graphic interface.

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

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?

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.

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.

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

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.

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.

Q. Which of the following is incorrect regarding PRRP?

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.

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

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

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

Q. The second step in the Genetic Algorithm comprises of scoring of the 100 initial MSAs by the sum of pairs method.

Q. In Genetic Algorithm, in the mutation process _______

Q. The HMM is a statistical model that considers few combinations of matches and gaps to generate an alignment of a set of sequences.

Q. Which of the following is not true about iterative methods?

Q. Which of the following is not among the methods for finding localized sequence similarity?

Q. Profiles are found by performing the _____ MSA of a group of sequences and then removing the _______ regions in the alignment into a smaller MSA.

Recommended Subjects

Are you eager to expand your knowledge beyond Bioinformatics? We've handpicked a range of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of various subjects. Happy exploring!