A contemporary and fundamental problem faced by many evolutionary biologists is how to puzzle together a collection ℘ of partial trees (leaf-labeled trees whose leaves are bijectively labeled by species or, more generally, taxa, each supported by, e.g., a gene) into an overall parental structure that displays all trees in ℘. This already difficult problem is complicated by the fact that the trees in ℘ regularly support conflicting phylogenetic relationships and are not on the same but only overlapping taxa sets. A desirable requirement on the sought after parental structure, therefore, is that it can accommodate the observed conflicts. Phylogenetic networks are a popular tool capable of doing precisely this. However, not much is known about how to construct such networks from partial trees, a notable exception being the Z-closure super-network approach, which is based on the Z-closure rule, and the Q-imputation approach. Although attractive approaches, they both suffer from the fact that the generated networks tend to be multidimensional making it necessary to apply some kind of filter to reduce their complexity.
To avoid having to resort to a filter, we follow a different line of attack in this paper and develop closure rules for generating circular phylogenetic networks which have the attractive property that they can be represented in the plane. In particular, we introduce the novel Y-(closure) rule and show that this rule on its own or in combination with one of Meacham’s closure rules (which we call the M-rule) has some very desirable theoretical properties. In addition, we present a case study based on Rivera et al. “ring of life” to explore the reconstructive power of the M- and Y-rule and also reanalyze an Arabidopsis thaliana data set.
Phylogenetic network Z-closure supernetwork Y-closure rule M-closure rule Partial split Circular split system Ring of life
This is a preview of subscription content, log in to check access.
Fitzpatrick, D., Creevey, C., McInerney, J., 2006. Genome phylogenies indicate a meaningful alpha-proteobacterial phylogeny and support a grouping of the mitochondria with the Rickettsiales. Mol. Biol. Evol. 23, 74–5.
Grünewald, S., Forslund, K., Dress, A., Moulton, V., 2007. QNet: an agglomerative method for the construction of phylogenetic networks from weighted quartets. Mol. Biol. Evol. 24(2), 532–38.
McBreen, K., Lockhart, P.J., 2006. Reconstructing reticulate evolutionary histories in plants. Trends Plant Sci. 11(8), 389–04.
Meacham, C.A., 1983. The recovery of trees from measures of dissimilarity. In: Hodson, F.R., Kendall, D.G., Tatu, P. (Eds.), Mathematics in the Archaeological and Historical Sciences, pp. 387–95. Edinburgh University Press, Edinburgh.
Morrison, D., 2005. Networks in phylogenetic analysis: new tools for population biology. Int. J. Parasitol. 35, 567–82.
Rivera, M.C., Lake, J.A., 2004. The ring of life provides evidence for a genome fusion origin of eukaryotes. Nature 43, 152–55.
Semple, C., Steel, M., 2001. Tree Reconstruction Via Closure Operations on Partial Splits, JOBIM 2000, LNCS, vol. 2066, pp. 126–34. Springer, Berlin.
1.Department of Combinatorics and Geometry (DCG), CAS-MPG Partner Institute for Computational Biology (PICB), Shanghai Institutes for Biological Sciences (SIBS)Chinese Academy of Sciences (CAS)ShanghaiChina
2.School of Computing SciencesUniversity of East AngliaNorwichUK