3 min
Lecture 30: Maximum Parsimony and minimum mutation methods Fundamental Algorithms in Bioinformatics
-
- Technology
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 Technology
More by UC Davis
Principles of Macroeconomics 2014
Ann Stevens
Principles of Microeconomics, Winter 2013
Hilary Hoynes
Romanticism, Spring 2009
Timothy Morton
Literature and the Environment, Fall 2008
Timothy Morton
World Economic History before the Industrial Revolution, Spring 2009
Gregory Clark
PSC100 - Introduction to Cognitive Psychology
Victoria Cross