Lecture 30: Maximum Parsimony and minimum mutation methods Fundamental Algorithms in Bioinformatics
-
- Technologie
Building evolutionary trees from sequence data. The Maximum Parsimony criteria, the special case of Perfect Phylogeny, and the Fitch-Hartigon dynamic program to minimize mutations when the tree and a sequence alignment are known.
Building evolutionary trees from sequence data. The Maximum Parsimony criteria, the special case of Perfect Phylogeny, and the Fitch-Hartigon dynamic program to minimize mutations when the tree and a sequence alignment are known.
3 Min.
Top‑Podcasts in Technologie
Mehr von UC Davis
Literature and the Environment, Fall 2008
Timothy Morton
Romanticism, Spring 2009
Timothy Morton
PSC100 - Introduction to Cognitive Psychology
Victoria Cross
Developmental Psychology, Fall 2008
Victoria Cross
Principles of Microeconomics, Winter 2013
Hilary Hoynes
The Inner Workings of Cells, Winter 2008
Ken Kaplan