A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Phylogenetic consensus networks: Computing a consensus of 1-nested phylogenetic networks
[article]
2021
arXiv
pre-print
An important and well-studied problem in phylogenetics is to compute a consensus tree so as to summarize the common features within a collection of rooted phylogenetic trees, all whose leaf-sets are bijectively labeled by the same set (X) of species. More recently, however, it has become of interest to find a consensus for a collection of more general, rooted directed acyclic graphs all of whose sink-sets are bijectively labeled by (X), so called rooted phylogenetic networks. These networks are
arXiv:2107.09696v1
fatcat:4zdm67gwajbsjbybzyjtjof4yq