Tools
Tools
Huber, Katharina, Moulton, Vincent 
ORCID: https://orcid.org/0000-0001-9371-6435 and Wu, Taoyang ORCID: https://orcid.org/0000-0002-2663-2001
(2019)
Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks.
Journal of Classification, 36 (2).
pp. 200-231.
ISSN 0176-4268
Preview |
PDF (JoC_Huber_etal)
- Published Version
Available under License Creative Commons Attribution. Download (369kB) | Preview |
Abstract
The reconstruction of the evolutionary history of a set of species is an important problem in classification and phylogenetics. Phylogenetic networks are a generalization of evolutionary trees that are used to represent histories for species that have undergone reticulate evolution, an important evolutionary force for many organisms (e.g. plants or viruses). In this paper, we present a novel approach to understanding the structure of networks that are not necessarily binary. More specifically, we define the concept of a closed set and show that the collection of closed sets of a network forms a hierarchy, and that this hierarchy can be deduced from either the subtrees or subnetworks on all 3-subsets. This allows us to also show that closed sets generalize the concept of the SN-sets of a binary network, sets which have proven very useful in elucidating the structure of binary networks. We also characterize the minimal closed sets (under set inclusion) for a special class of networks (2-terminal networks). Taken together, we anticipate that our results should be useful for the development of new phylogenetic network reconstruction algorithms.
Downloads
Downloads per month over past year
Actions (login required)
 |
View Item |