Charts
Fundamental Algorithms in BioinformaticsEpisode from the podcastFundamental Algorithms in Bioinformatics
Next Episode
Lecture 29; Additive trees and the Neighbor-Joining algorithm

Lecture 29; Additive trees and the Neighbor-Joining algorithm

Released Saturday, 30th January 2010
Good episode? Give it some love!
Lecture 29; Additive trees and the Neighbor-Joining algorithm

Lecture 29; Additive trees and the Neighbor-Joining algorithm

Lecture 29; Additive trees and the Neighbor-Joining algorithm

Lecture 29; Additive trees and the Neighbor-Joining algorithm

Saturday, 30th January 2010
Good episode? Give it some love!
Rate Episode
List
About
InsightsPodchaser Pro
Reviews
Credits
Lists
Transcript

Additive trees and their construction. The Neighbor-Joining algorithm and its use with near-additive data. Bootstrap values and their misuse.

Show More
Rate
List
Get this podcast via API

From The Podcast

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
Do you host or manage this podcast?
Claim and edit this page to your liking.
,
Podchaser Logo

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