Phylogenetic Super-Networks from Partial Trees. (2004)
Acyclic directed graphs (ADGs) are increasingly being viewed as more appropriate for representing certain evolutionary relationships, particularly in biology, than rooted trees. In this paper, we develop a framework for the analysis of these graphs which we call hybrid phylogenies. We are particularly interested in the problem whereby one is given a set of phylogenetic trees and wishes to determine a hybrid phylogeny that 'embeds' each of these trees and which requires the smallest number of hybridisation events. We show that this quantity can be greatly reduced if additional species are involved, and the investigate other combinatorial aspects of this and related questions.
CitationHuson, D.H., Dezulian, T., Klöpper, T., Steel, M.A. (2004) Phylogenetic Super-Networks from Partial Trees.. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(4), pp. 151-158.
This citation is automatically generated and may be unreliable. Use as a guide only.
Keywordsmolecular evolution; phylogeny; partial trees; networks; closure operations
Showing items related by title, author, creator and subject.
Semple, C.; Steel, M. (Springer-VerlagUniversity of Canterbury. Mathematics and Statistics., 2001)A fundamental problem in biological classi cation is the reconstruction of phylogenetic trees for a set X of species from a collection of either subtrees or qualitative characters. This task is equivalent to tree reconstruction ...
Francis A; Semple C; Steel M (2017)Phylogenetic networks are a type of directed acyclic graph that represent how a set X of present-day species are descended from a common ancestor by processes of speciation and reticulate evolution. In the absence of ...
Grünewald, S.; Humphries, P. J.; Semple, C. (University of Canterbury. Dept. of Mathematics and Statistics, 2005)A collection P of leaf-labelled trees is compatible if there exists a single leaf-labelled tree that displays each of the trees in P. Despite its difficulty, determining the compatibility of P is a fundamental task in ...