M.Sc. DEGREE EXAMINATION, APRIL 2017
Second Semester
Bioinformatics
COMPUTATIONAL BIOLOGY
(2016 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What is a graph?
2. Define different terminology used for tree.
3. What is the difference between homologs and orthologs
sequences?
4. What is BLAST?
5. Define PAM substitution matrices.
6. Outline the progressive and hierarchical approaches of
MSA.
7. Differentiate between rooted tree and unrooted tree with
suitable example?
8. What is HMM?
9. What is the significance of solvent accessible surface area
of a protein?
10. What is a protein folding?
Sub. Code
502201
RW-187
2
Wk 11
Part B x 5 25)
Answer all questions.
11. Explain about Hamilton path-pseudocode
algorithms.
Or
Discuss the terminologies used in a free and graph.
12. Describe Smith waterman algorithm giving
pseudocode with suitable example.
Or
What is sequence alignment, differentiate between
identity and similarity?
13. Discuss about PAM substitution matrices.
Or
How will you construct phylogenetic tree? Explain
with examples.
14. Discuss different representations used in pattern
recognition.
Or
Discuss artificial neural network and its uses in
gene discovery.
15. What is COMPAPER? Discuss in detail.
Or
Discuss methods available for protein structure
comparison.
RW-187
3
Wk 11
Part C x 10 30)
Answer any three questions.
16. Explain any one algorithm for sorting, and one strategy
or method for finding minima and maxima.
17. Explain BLASTA and FASTA in detail. What is dynamic
programming? write pseudocode for Needleman and
Wunsh in sequence alignment?
18. Discuss in detail about the evolutionary, models of
phytogenetic tree with suitable example.
19. Discuss in detail the workflow of GRAIL for gene
discovery. Describe the algorithm used in the software to
achieve the goal.
20. How will you predict the structure of nucleic acids?
Explain in detail.
————————