Comparing and displaying phylogenetic trees using edge union networks
Abstract
The general problem of representing collections of trees as a single graph has led to many tree summary techniques. Many consensus approaches take sets of trees (either inferred as separate gene trees or gleaned from the posterior of a Bayesian analysis) and produce a single “best” tree. In scenarios where horizontal gene transfer or hybridization are suspected, networks may be preferred, which allow for nodes to have two parents, representing the fusion of lineages. One such construct is the cluster union network (CUN), which is constructed using the union of all clusters in the input trees. The CUN has a number of mathematically desirable properties, but can also present edges not observed in the input trees. In this paper we define a new network construction, the edge union network (EUN), which displays edges if and only if they are contained in the input trees. We also demonstrate that this object can be constructed with polynomial time complexity given arbitrary phylogenetic input trees, and so can be used in conjunction with network analysis techniques for further phylogenetic hypothesis testing.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Mar 05, 2019
- Source ID
- 10.1111/cla.12374
Entities
People
- Miriam Miyagi
- Ward C. Wheeler
Organizations
- American Museum of Natural History
- Defense Advanced Research Projects Agency
- Harvard University
- National Science Foundation