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.

  • Copyright The Regents of the University of California, Davis campus, 2015. All Rights Reserved.

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

  • Copyright The Regents of the University of California, Davis campus, 2015. All Rights Reserved.

Top Podcasts In Technology

Lex Fridman Podcast
Lex Fridman Podcast
Lex Fridman
Acquired
Acquired
Ben Gilbert and David Rosenthal
All-In with Chamath, Jason, Sacks & Friedberg
All-In with Chamath, Jason, Sacks & Friedberg
All-In Podcast, LLC
Hard Fork
Hard Fork
The New York Times
Darknet Diaries
Darknet Diaries
Jack Rhysider
Your Undivided Attention
Your Undivided Attention
Tristan Harris and Aza Raskin, The Center for Humane Technology

More by UC Davis

World Economic History before the Industrial Revolution, Spring 2009
World Economic History before the Industrial Revolution, Spring 2009
Gregory Clark
PSC100 - Introduction to Cognitive Psychology
PSC100 - Introduction to Cognitive Psychology
Victoria Cross
Fundamental Algorithms in Bioinformatics
Fundamental Algorithms in Bioinformatics
Dan Gusfield
Developmental Psychology, Fall 2008
Developmental Psychology, Fall 2008
Victoria Cross
Principles of Macroeconomics 2014
Principles of Macroeconomics 2014
Ann Stevens
Overcoming Public Speaking Anxiety
Overcoming Public Speaking Anxiety
Margaret Swisher and Barbara Myslik