A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Phylogenetic Super-networks from Partial Trees
[chapter]
2004
Lecture Notes in Computer Science
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
doi:10.1007/978-3-540-30219-3_33
fatcat:5qy2ixcf4nfyflg47o4ludznny