Podchaser Logo
Home
Fundamental Algorithms in BioinformaticsEpisode from the podcastFundamental Algorithms in Bioinformatics
Next Episode
Lecture 30: Maximum Parsimony and minimum mutation methods

Lecture 30: Maximum Parsimony and minimum mutation methods

Released Sunday, 31st January 2010
Good episode? Give it some love!
Lecture 30: Maximum Parsimony and minimum mutation methods

Lecture 30: Maximum Parsimony and minimum mutation methods

Lecture 30: Maximum Parsimony and minimum mutation methods

Lecture 30: Maximum Parsimony and minimum mutation methods

Sunday, 31st January 2010
Good episode? Give it some love!
Rate Episode
About
InsightsPodchaser Pro
Reviews
Credits
Lists
Transcript

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.

Show More
Rate
Get this podcast via API

From The Podcast

Fundamental Algorithms in Bioinformatics

This course covers fundamental algorithms for efficient analysis of biological sequences and for building evolutionary trees. This is an undergraduate course focusing on the ideas and concepts behind the most central algorithms in biological sequence analysis. Dynamic Programming, Alignment, Hidden Markov Models, Statistical Analysis are emphasized.

Join Podchaser to...

  • Rate podcasts and episodes
  • Follow podcasts and creators
  • Create podcast and episode lists
  • & much more

Episode Tags

Do you host or manage this podcast?
Claim and edit this page to your liking.
,

Unlock more with Podchaser Pro

  • Audience Insights
  • Contact Information
  • Demographics
  • Charts
  • Sponsor History
  • and More!
Pro Features
Podchaser Logo

Podchaser is the ultimate destination for podcast data, search, and discovery. Learn More