Exam Year Questions and Answers
Exam Year Questions and Answers
9. In a family of homologous proteins, how would you best determine the most highly
conserved amino acids?
a. Perform a multiple sequence alignment
b. Determine the isolelectric points of the proteins
c. Compare Ramachandran plots of each protein
d. Build a phylogenic tree
e. All of the above
10. If a single organism contains two loci encoding homologous genes as a result of gene
duplication, the encoded proteins are said to be
a. Heterologous
b. Orthologous
c. Xenologous
d. Paralogous
e. Zoologous
11. When using a tool such as WebCutter to produce a restriction map, it is observed that
some restriction enzymes can digest DNA more frequently than others. Why?
a. They can digest within introns as well as exons
b. They have recognition sequences that are palindromic
c. They have higher enzymatic activity
d. They leave a blunt-ended cut
e. Their recognition sequence is shorter
16. The amino acid depicted in the figure can be assigned to two overlapping functional
amino acid groupings. These are:
17. How would you identify transmembrane regions from a protein sequence?
a. Determine the pI of the protein
b. Perform an amino acid content analysis
c. Perform a hydropathy analysis of the protein
d. Identify regions of secondary structure using neural network tools
e. None of the above
SECTION B Note this is a marking scheme guide- I haven’t listed all relevant points.
Answer any 4 of questions 1 – 6. No extra marks given for answering more than 4 questions,
and only the first 4 will be marked. 20 marks per question.
1 or more per point, depending on how well described. Can get marks for any relevant.
1. Describe the major databases that are present in the NCBI ENTREZ suite. What
information does each house? How do we find relevant data within these databases?
Marks for each database mentioned.
Extra marks if described fully
Should list how the databases are queried
Text (can use Boolean query), use descriptors eg [au]
BLAST etc is not a db
2. What is dynamic programming? How is it applied to pairwise alignment? What are the
programs generally used, and how do they make alignments run faster than when
using exhaustive dynamic programming?
Breaks down the problem into states, solves each individually
Will give the optimal sequence alignment
Dome using a matrix
Three stages
Gives a score
Used in BLAST and FASTA.
Make assumptions that homologous sequences will contain words
Word lenghs BLAST 3 for protein, 11 nucleotide
FASTA 2,6
3. Discuss the concept of homology (include the various classes of homologues and how
they arise). How can we search for homologues of a particular nucleotide or amino
acid sequence? How do we know if we have identified a homologue?
Homology is descent from a common ascestor.
No such thing as % homology, homolog or not.
Have orthologues, paralogues and xenologues. Define.
Search using BLAST.
Look at E value.
4. Describe the amino acid substitution matrices that are used in calculating similarity
scores between protein sequences. Comment on the derivation of the matrices, what
information they contain and how they are used. Use the matrix below, and a gap
opening penalty of -11 and extension cost of –1, calculate a score for the match
between the following peptides. Show your alignment and the score.
Describe the PAM and BLOSUM databases, how they were developed.
What do they do?
What do the different numbers refer to?
How are they used in FASTA and BLAST?
AVALEINSTEINSS
A AL INSTE +SS
AMAL-INSTEADSS