Constructing rooted supertrees using distances

DOI10.1016/j.bulm.2004.04.006zbMath1334.92299OpenAlexW2053118947WikidataQ51985157 ScholiaQ51985157MaRDI QIDQ253705

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

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

Related Items (2)

\textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time ⋮ `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers

Uses Software

• PHYLIP
• PAUP*
• RadCon

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