This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: optimal assignments of characters in the Sankoff algorithm for the Weighted Small Parsimony problem. Illustrate the procedure with the example on p.373 for the binary tree and δ given in Fig.10.18. [30 points] 4. Evolutionary trees have been constructed based on clustering approach, distance based approach, and character based approach and phylogenetic tree approach. Discuss their advantages and disadvantages and discuss what kind of data are used in these methods and how such data can be obtained. [10 points] 5. (a) Fill in the table below so that the matrix is ultrametric and obtain the ultrametric tree. [15 points] 5 (b) Define phylogenetic tree. State a necessary and sufficient condition for a n x m binary matrix to have a phylogenetic tree. Can you construct a phylogenetic tree for the following matrix? (10 points] 1 2 3 4 5 A 1 1 0 0 0 B 0 0 1 0 1 C 1 1 0 0 1 D 0 0 1 1 0 E 0 1 0 0 1...
View
Full
Document
This note was uploaded on 06/12/2011 for the course CAP 5510 taught by Professor Staff during the Spring '08 term at University of Central Florida.
 Spring '08
 Staff

Click to edit the document details