Constructing rooted supertrees using distances

DOI10.1016/J.BULM.2004.04.006MaRDI QIDQ253705zbMATH OpenOpenAlexWikidataFDO

Authors Stephen J. Willson

Publication date 8 March 2016

Published in Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.bulm.2004.04.006

zbMATH Keywords

branching informationdistance informationleaf setrooted supertrees

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15) Software, source code, etc. for problems pertaining to biology (92-04)

Recommendations

• A supertree method for rooted trees
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• Extending the limits of supertree methods
• scientific article; zbMATH DE number 1746436
• scientific article; zbMATH DE number 1974598

Cited in

(13)

• `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers
• The triangles method to build \(X\)-trees from incomplete distance matrices
• A supertree method for rooted trees
• scientific article; zbMATH DE number 1974600 (Why is no real title available?)
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Extending the limits of supertree methods
• A Class of General Supertree Methods for Nested Taxa
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
• Optimizing phylogenetic supertrees using answer set programming
• Explosions and hot spots in supertree methods
• Convergence of maximum likelihood supertree reconstruction
• scientific article; zbMATH DE number 1974604 (Why is no real title available?)
• Representations of partial leaf sets in phylogenetic tree space

Describes a project that uses

Uses Software

• PHYLIP
• PAUP*
• RadCon

This page was built for publication: Constructing rooted supertrees using distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q253705)