Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks
From MaRDI portal
Publication:2304069
DOI10.1007/s00357-018-9279-5zbMath1436.62261OpenAlexW2777621233WikidataQ128987364 ScholiaQ128987364MaRDI QIDQ2304069
Taoyang Wu, Katharina T. Huber, Vincent L. Moulton
Publication date: 6 March 2020
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00357-018-9279-5
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Problems related to evolution (92D15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Constructing the simplest possible phylogenetic network from triplets
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- New common ancestor problems in trees and directed acyclic graphs
- Matching theory
- Trinets encode tree-child and level-2 phylogenetic networks
- Binets: fundamental building blocks for phylogenetic networks
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
This page was built for publication: Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks