MIT6_047f08_exam01_2007 - MIT OpenCourseWare...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MIT OpenCourseWare 6.047 / 6.878 Computational Biology: Genomes, Networks, Evolution Fall 2008 For information about citing these materials or our Terms of Use, visit: . 6.047/6.878 Fall 2007 Midterm Exam October 25, 2007 Name: No books, notes or electronic aids (such as calculators) are permitted. Both 6.047 and 6.878 have the same exam and scoring rubric, but they will be considered separately in determining final grades. True/False and Multiple Choice (20 points) Read each statement or question carefully, and circle the correct answer. 1. True / False Given the exponential number of possible alignments, the Needleman-Wunsch algorithm requires exponential space to recover the best alignment, even though it requires only polynomial time to determine its score. 2. True / False While dynamic programming sequence alignment algorithms are guaranteed to find the optimal alignment in quadratic time O ( N 2 ) , bounded dynamic programming is guaranteed to find the optimal alignment in linear time O ( kN ) , where k is the width searched around the diagonal of the matrix. 3. True / False Two sequences of length 10 that have 70% identity (no gaps) are guaranteed to have a stretch of four identical nucleotides in a row. 4. True / False Posterior decoding finds the most probable hidden state path, arg max π P ( X,π ) . 5. Which hierarchical linkage method is used by the UPGMA algorithm?...
View Full Document

Page1 / 7

MIT6_047f08_exam01_2007 - MIT OpenCourseWare...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online