M.Sc. DEGREE EXAMINATION, APRIL 2017
Second Semester
Bioinformatics
COMPUTATIONAL APPROACH TO TAXONOMY AND
PHYLOGENY
(2016 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. Define taxonomy.
2. Define paraphyletic grouping.
3. Define convergent evolution.
4. What is speciation?
5. What do you mean by tree to tree distance?
6. What do you mean by topology and branch length of a
phylogenetic tree?
7. Name any three advantages of CLUSTALW over other
softwares.
8. What are the limitations of phylogenetic algorithms?
9. What is bootstrapping?
10. List any four phylogenetic tree construction tools.
Sub. Code
502202
RW-188
2
wk12
Part B x 5 25)
Answer all questions.
11. What is Hardy-Weinberg theorem? Give its
application.
Or
Discuss briefly the role of natural selection in
evolution.
12. Discuss about the concept of origin of new genes and
proteins.
Or
Distinguish between the terms 'inferred 'true
'gene tree' and 'species tree'. Explain why gene
trees and species trees are not equivalent.
13. Describe natural selection process.
Or
Discuss about constructing the phylogenetic tree?
14. Explain genetic diversity and feature diversity in
phylogeny with suitable model.
Or
Explain the applications of Mega?
15. Describe steps involved in phylogenetic tree
construction using Phylip.
Or
Discuss about the plotting and visualisation of
phylogenetic tree.
RW-188
3
wk12
Part C 10 30)
Answer any three questions.
16. What is systematics? Describe the five kingdom system of
classification.
17. Explain how phylogenetic trees are reconstructed,
including DNA sequence alignment and how the accuracy
of tree is assessed.
18. Describe in detail transformed distance and neighbor
joining algorithms in phylogenetic analysis.
19. Discuss about Neighbor-Relation, Neighbor-Joining
method in detail.
20. Describe the ClustalW tool used for Multiple Sequence
Alignment (MSA). What are the considerations we take
while choosing a MSA software for analysis.
———————