Matchings and phylogenetic trees

AUTOR(ES)

Diaconis, Persi W.

FONTE

The National Academy of Sciences

RESUMO

This paper presents a natural coordinate system for phylogenetic trees using a correspondence with the set of perfect matchings in the complete graph. This correspondence produces a distance between phylogenetic trees, and a way of enumerating all trees in a minimal step order. It is useful in randomized algorithms because it enables moves on the space of trees that make random optimization strategies “mix” quickly. It also promises a generalization to intermediary trees when data are not decisive as to their choice of tree, and a new way of constructing Bayesian priors on tree space.

Documentos Relacionados

• Heterozygosity, Heteromorphy, and Phylogenetic Trees in Asexual Eukaryotes
• Bootstrap confidence levels for phylogenetic trees
• Bootstrap confidence levels for phylogenetic trees.
• Genetic Distances and Reconstruction of Phylogenetic Trees from Microsatellite DNA
• Simple method for constructing phylogenetic trees from distance matrices.