Fast Algorithms for Minimum Evolution Rutgers 快速算法的最小进化罗格斯大学.pptVIP

Fast Algorithms for Minimum Evolution Richard Desper, NCBI Olivier Gascuel, LIRMM Overview Statement of phylogeny reconstruction problem and various approaches to solving it. Tree length formula as a function of average distances. Greedy algorithms for tree building and tree swapping. Simulation results. A few extras regarding consistency and branch lengths. Phylogeny Reconstruction General problem: reconstruct the evolutionary history for a set L of extant species. Input: multiple sequence alignment for L or matrix of estimates of pairwise evolutionary distances. Output: weighted phylogeny r