1 / 18

Counting evolutionary changes

Counting evolutionary changes. the parsimony method requires an algorithm that counts the number of evolutionary changes in a tree. Fitch W.M. 1971. Syst . Zool. 20: 406-416. The Fitch algorithm. the Fitch algorithm counts the number of changes in a tree with nucleotide sequence data

hestia
Download Presentation

Counting evolutionary changes

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Counting evolutionary changes the parsimony method requires an algorithm that counts the number of evolutionary changes in a tree. Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  2. The Fitch algorithm the Fitch algorithm counts the number of changes in a tree with nucleotide sequence data (A, C, T, G) Walter M. Fitch Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  3. The Fitch algorithm for a given site, note the bases observed in the tip species. [C] [A] [C] [A] [G] Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  4. The Fitch algorithm the number of changes equals the number of empty intersections. [C] [A] [C] [A] [G] intersection is empty; create union, count+1. intersection is empty; create union, count+1. [AC] [AG] intersection is empty; create union, count+1. [ACG] intersection not empty; note intersection. [AC] Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  5. The Fitch algorithm is not required for invariant sites (AAAAAAA) sites with a single variant base (AATAAAA) sites with similar patterns (TCTCA = CACAG) Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  6. The Sankoff algorithm in the Sankoff algorithm, not all changes are equally likely. David Sankoff Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  7. The Sankoff algorithm the cost of a transition is 1 purine pyrimidine purine pyrimidine purine pyrimidine purine pyrimidine Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  8. The Sankoff algorithm the cost of a transversion is 2.5. purine pyrimidine [C] [A] [C] [A] [G] purine pyrimidine purine pyrimidine purine pyrimidine Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  9. The Sankoff algorithm [C] [A] [C] [A] [G] AC + AA =2.5 + 0 =2.5 Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  10. The Sankoff algorithm [C] [A] [C] [A] [G] Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  11. The Sankoff algorithm [C] [A] [C] [A] [G] Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  12. The Sankoffalgorithm [C] [A] [C] [A] [G] AC =2.5 AA=0 Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  13. The Sankoffalgorithm [C] [A] [C] [A] [G] CC =0 CA=2.5 Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  14. The Sankoffalgorithm [C] [A] [C] [A] [G] GC =2.5 GG=0 Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  15. The Sankoffalgorithm [C] [A] [C] [A] [G] TC =1 TA=2.5 Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  16. The Sankoffalgorithm [C] [A] [C] [A] [G] AA =0 AA =0 Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  17. The Sankoffalgorithm [C] [A] [C] [A] [G] TT =0 TC =1 minimal cost of tree Fitch W.M. 1971. Syst. Zool. 20: 406-416.

  18. The Sankoff algorithm the Sankoff algorithm is an example of a dynamic programming algorithm – it solves a large problem by first solving some smaller problems. David Sankoff Fitch W.M. 1971. Syst. Zool. 20: 406-416.

More Related