CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2004 vol.1 Issue No.04 - October-December
Issue No.04 - October-December (2004 vol.1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2004.44
<p><b>Abstract</b>—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogenetic super-network from such data and provides an efficient algorithm for doing so, called the Z-closure method. Additionally, the questions of assigning lengths to the edges of the network and how to restrict the "dimensionality” of the network are addressed. Applications to a set of five published partial gene trees relating different fungal species and to six published partial gene trees relating different grasses illustrate the usefulness of the method and an experimental study confirms its potential. The method is implemented as a plug-in for the program SplitsTree4.</p>
Molecular evolution, phylogeny, partial trees, networks, closure operations.
Daniel H. Huson, Tobias Dezulian, Tobias Kl?pper, Mike A. Steel, "Phylogenetic Super-Networks from Partial Trees", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.1, no. 4, pp. 151-158, October-December 2004, doi:10.1109/TCBB.2004.44