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
Liquidmatrix Security Digest Podcast
Liquidmatrix Security Digest
freeCodeCamp Podcast
freeCodeCamp.org
Reply All
Gimlet
寶博朋友說
葛如鈞(寶博士) & SoundOn 製作團隊
Waveform: The MKBHD Podcast
Vox Media Podcast Network
Sound Design Live - Career building interviews on live sound, theatre, AV, recording, and sound system tuning
Nathan Lively - Online Courses for Live Sound Engineers ?
More by UC Davis
UC Davis Commencement Speakers
University of California, Davis
Futures and Options
Collin Carter
Landscape Conservation & Sustainability: Fall 2015
Steve Greco
2013 Conference on the Affordable Care Act and Low Income Populations
UC Davis Center for Poverty Research
Technology and Future Landscapes, Spring 2015
Claire Napawan
Landscape Engagements, Winter 2015
Clinton Brad Wilcox