Unique determination of some homoplasies at hybridization events

Bulletin of Mathematical Biology

Volumn 69, Issue 5, 2007, Pages 1709-1725

  Willson, Stephen J ^a  

^a Iowa State Universit   (United States)

Author keywords

Homoplasy; Hybridization; Network; Phylogenetic network; Phylogeny

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; BIOLOGICAL MODEL; GENETIC RECOMBINATION; GENETICS; GENOME; HYBRIDIZATION; PHYLOGENY;

ALGORITHMS; ANIMALS; GENOME; HYBRIDIZATION, GENETIC; MODELS, GENETIC; PHYLOGENY; RECOMBINATION, GENETIC;

EID: 34250754966     PISSN: 00928240     EISSN: 15229602     Source Type: Journal    
DOI: 10.1007/s11538-006-9187-4     Document Type: Article

References (18)

1. Bandelt, H.-J., Dress, A., 1986. Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7, 309-343.
2. Bandelt, H.-J., Dress, A., 1992. Split decomposition: A new and useful approach to phylogenetic analysis of distance data. Mol. Phylogenet. Evol. 1, 242-252.
3. Baroni, M., Semple, C., Steel, M., 2004. A framework for representing reticulate evolution. Ann. Comb. 8, 391-408.
4. Camin, J.H., Sokal, R.R., 1965. A method for deducing branching sequences in phylogeny. Evolution 19, 311-326.
5. Felsenstein, J., 2006. Inferring Phylogenies. Sinauer Associates, Sunderland, MA.
6. Dan Gusfield, Gusfield, D., 1991. Efficient algorithms for inferring evolutionary history. Networks 21, 19-28.
7. Dan Gusfield, Satish Eddhu, and Charles Langley, Gusfield, D., Eddhu, S., Langley, C., 2004a. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2, 173-213.
8. Dan Gusfield, Satish Eddhu, and Charles Langley, Gusfield, D., Eddhu, S., Langley, C., 2004b. The fine structure of galls in phylogenetic networks. INFORMS J. Comput. 16, 459-469. Special Issue on Computational Molecular Biology. Bioinformatics.
9. Hein, J., 1990. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185-200.
10. Hein, J., 1993. A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36, 396-405.
11. Huber, K.T., Moulton, V., 2006. Phylogenetic networks from multi-labelled trees. J. Math. Biol. 52, 613-632.
12. Huber, K.T., Oxelman, B., Lott, M., Moulton, V., 2006. Reconstructing the evolutionary history of polyploids from multilabeled trees. Mol. Biol. Evol. 23, 1784-1791.
13. Moret, B.M.E., Nakhleh, L., Warnow, T., Linder, C.R., Tholse, A., Padolina, A., Sun, J., Timme, R., 2004. Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE/ACM Trans. Comput. Biol. Bioinform. 1, 13-23.
14. Nakhleh, L., Warnow, T., Linder, C.R., 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, California), ACM, New York, pp. 337-346.
15. Semple, C., Steel, M., 2003. Phylogenetics. Oxford University Press, Oxford.
16. Wang, L., Zhang, K., Zhang, L., 2001. Perfect phylogenetic networks with recombination. J. Comput. Biol. 8, 69-78.
17. Willson, S.J., 2006a. Unique solvability of certain hybrid networks from their distances. Ann. Combin. 10, 165-178.
18. Willson, S.J., 2006b. Unique reconstruction of tree-like phylogenetic networks from distances between leaves. Bull. Math. Biol. 68, 919-944.