This preview shows page 1. Sign up to view the full content.
Unformatted text preview: character present at that leaf. Prove the correctness of the Fitch algorithm by proving the following claim: After processing an internal node u , the score obtained at u will be the most parsimonious score for the subtree rooted at u . 5. (10 points) Let T and T be two phylogenies for the same set of species. Prove that T can be obtained from T by a sequence of NNI operations. Can you give an upper bound on the number of such operations that are needed? (The minimum such number is called the NNIdistance between T and T and is used to measure the closeness between trees.)...
View Full
Document
 Fall '06
 OLIVEREULENSTEIN
 Algorithms

Click to edit the document details