Computing consensus networks for collections of 1-nested phylogenetic networks
From MaRDI portal
Publication:6075713
DOI10.7155/jgaa.00633zbMath1522.92038arXiv2107.09696OpenAlexW4386144284MaRDI QIDQ6075713
Vincent L. Moulton, Andreas Spillner, Katharina T. Huber
Publication date: 20 September 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.09696
Problems related to evolution (92D15) Applications of graph theory (05C90) Systems biology, networks (92C42)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On encodings of phylogenetic networks of bounded level
- All that glisters is not galled
- Phylogenetic graph models beyond trees
- Consensus n-trees
- Computing the maximum agreement of phylogenetic networks
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Trinets encode tree-child and level-2 phylogenetic networks
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Phylogeny
- Axiomatic Consensus Theory in Group Choice and Biomathematics
- The Transitive Reduction of a Directed Graph
This page was built for publication: Computing consensus networks for collections of 1-nested phylogenetic networks