Comparative Bioinformatics Midterm II: Fall 2004 - Prof. Charles Francis Delwiche, Exams of Cell Biology

Download Comparative Bioinformatics Midterm II: Fall 2004 - Prof. Charles Francis Delwiche and more Exams Cell Biology in PDF only on Docsity! Name: __________________________ 1/7 Comparative Bioinformatics Midterm II Fall 2004 Objective Answer, part I: For each of the following, select the single best answer or completion of the phrase. (3 points each) 1. Deinococcus radiodurans has been isolated from: a. Radiation "sterilized" canned meat. b. The surface of Mars. c. The inside of an autoclave. d. All of the above. 2. NP-Hard (nonparametric polynomial) problems are a class of problems for which… a. exact solutions become very difficult as the size of the problem increases. b. it is possible to calculate a goodness-of-fit score for a candidate solution. c. heuristic algorithms are widely used to find approximate solutions. d. all of the above. 3. Clusters of Orthologous Groups are identified by… a. reciprocal best hits from "all-against-all" BLAST analyses of genomes. b. phylogenetic analysis of sequences excluded by the "triangle criterion." c. Hierarchical clustering and "synteny-mapping" of chromosomes. d. none of the above. 4. In a Markov process… a. The system is defined by a set of states, the allowed transitions that can occur among these states. b. Probabilities are associated either with the states, or with the allowed transitions. c. The states into which the system can change are dependent only on the state the system is in. d. All of the above. 5. Paralogs are homologous copies of a gene that are related by… a. phylogenetic descent. b. gene duplication. c. at least 85% identity. d. none of the above. Name: __________________________ 2/7 Objective Answer, part II: The groups Archaea, Bacteria, and Eukarya, as well as combinations of these, are listed below. a. Transcription start site with TATA motif (TATA box) b. Formylmethionine as first amino acid in new protein c. Circular chromosomes d. Protein-coding genes organized into operons e. Abundant introns f. DNA bound to histones or histone-like proteins g. Several distinct RNA polymerases that require transcription factors h. Nucleus i. Ether-linked phospholipids For each of the following sets of organisms, circle those of the characteristics shown above that apply to all (or many) of the organisms in that set. (10 points) 6. Archaea a b c d e f g h i 7. Bacteria a b c d e f g h i 8. Eukarya a b c d e f g h i 9. Archaea and Bacteria a b c d e f g h i 10. Archaea and Eukarya a b c d e f g h i Name: __________________________ 5/7 17. We have obtained the following DNA sequence, and would like to determine whether or not it is derived from the Plasmodium genome. We can represent the sequence with a Markov model showing the frequencies with which individual nucleotides follow each other. (25 points) QUERY: AACCTGGTTG ATCCTGCCAG TAGTCATATG CTTGTCTCAA AGATTAAGCC A C G T a b c g h i k l m o p n f e j d a) What dinucleotide pair does transformation "j" represent? b) How often is this dinucleotide pair observed in the sequence above? c) What are the observed frequencies of each transformation? a: b: c: d: e: f: g: h: i: j: k: l: m: n: o: p: d) The Plasmodium genome is 80% A+T. From this we can estimate some relationships among expected transformation frequencies in Plasmodium. Provide a numerical estimate for each of the following values: a+e+h+o = d+l+i+n = ? ________ c+g+k+m = b+f+j+p = ? ________ e) What assumptions did you use to make your inference in (d)? f) [optional] Is the sequence likely to have been derived from Plasmodium? Why? Name: __________________________ 6/7 18. Assume that you have sequence data from four animals, Albatross, Beluga Whale, Cat, and Dugong (10 points). a. Draw the three possible unrooted trees that can interrelate these taxa. b. Draw the three corresponding ROOTED trees that assume that the Albatross is the outgroup. Name: __________________________ 7/7 You may wish to refer to the following algorithm (described by Swofford and Maddison, 1987), which can be used to determine the length of a tree under the parsimony criterion: 1.Assign a state to each terminal node (2). Visit first internal node A. is the intersection of states non-empty? I. Yes: set internal state to this. II. Else: a. set the state to the smallest set containing the states of the daughter nodes b. increase the tree length by 1. 3. Are you at the root of the tree? A. No: go to 2. B. Yes: go to 4. (4). Is the state at this node the same as the outgroup state? A. Yes: Proceed to the next character B. Else: Add one to the length of the tree; proceed to next character 123456789 Albatross GACCGTATA Beluga GTTCCTCTC Cat GTTCCCTTC Dugong GTCCGCTTA 19. Use the Swofford and Maddison algorithm (above) to (a) determine which of the three rooted trees is most parsimonious, and (b) show the node assignments of character states for characters 5 and 6 on the most parsimonious tree (10 points).