Unique Reconstruction of Tree-Like Phylogenetic Networks from Distances Between Leaves
- 50 Downloads
In this paper, a class of rooted acyclic directed graphs (called TOM-networks) is defined that generalizes rooted trees and allows for models including hybridization events. It is argued that the defining properties are biologically plausible. Each TOM-network has a distance defined between each pair of vertices. For a TOM-network N, suppose that the set X consisting of the leaves and the root is known, together with the distances between members of X. It is proved that N is uniquely determined from this information and can be reconstructed in polynomial time. Thus, given exact distance information on the leaves and root, the phylogenetic network can be uniquely recovered, provided that it is a TOM-network. An outgroup can be used instead of a true root.
KeywordsPhylogeny Network Phylogenetic network
Unable to display preview. Download preview PDF.
- Felsenstein, J., 2004. Inferring Phylogenies. Sinauer, Sunderland, MA.Google Scholar
- Jukes, T.H., Cantor, C.R., 1969. Evolution of protein molecules. In: Osawa, S., Honjo, T. (Eds.), Evolution of Life: Fossils, Molecules, and Culture. Springer-Verlag, Tokyo, pp. 79–95.Google Scholar
- Nakhleh, L., Warnow, T., Randal Linder, C., 2004. Reconstructing reticulate evolution in species—Theory and practice. In: Bourne, P.E., Gusfield, D. (Eds.), Proceedings of the Eighth Annual International Conference on Computational Molecular Biology (RECOMB '04), March 27–31, 2004, San Diego, CA. ACM, New York, pp. 337–346.Google Scholar
- Lusheng Wang, Kaizhong Zhang, and Louxin Zhang. 2001. Wang, L., Zhang, K., Zhang, L., 2001. Perfect phylogenetic networks with recombination. J. Comput. Biol. 8, 69–78.Google Scholar
- Willson, S.J., 2006. Unique solvability of certain hybrid networks from their distances. Ann. Combinat.Google Scholar