Quantifying hybridization in realistic time

Journal of Computational Biology

Volumn 18, Issue 10, 2011, Pages 1305-1318

  Collins, Joshua ^a   Linz, Simone ^b   Semple, Charles ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

agreement forests; fixed parameter tractability; hybridization; interleaving; reticulate evolution

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; COMPUTER SIMULATION; EVOLUTION; GENETICS; HYBRIDIZATION; METHODOLOGY; MOLECULAR EVOLUTION; TIME;

ALGORITHMS; BIOLOGICAL EVOLUTION; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; HYBRIDIZATION, GENETIC; MODELS, GENETIC; TIME FACTORS;

EID: 80053108302     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2009.0166     Document Type: Article

References (25)

1. Abu-Khzam, F.N., Langston, M.A, Shanbhag, P., et al. 2006. Scalable parallel algorithms for FPT problems. Algorithmica 45, 269-284. (Pubitemid 43876792)
2. Ávila, L.F., García, G., Serna, M., et al. 2006. A list of parameterized problems in bioinformatics, [Technical report LSI-06-24-R], Technical University of Catalonia, Barcelona, Spain.
3. Baroni, M., Grünewald, S., Moulton, V., et al. 2005. Bounding the number of hybridisation events for a consistent evolutionary history. J. Math. Biol. 51, 171-182. (Pubitemid 41040209)
4. Baroni, M., Semple, C., and Steel, M. 2006. Hybrids in real time. Syst. Biol. 55, 46-56.
5. Bordewich, M., and Semple, C. 2004. On the computational complexity of the rooted subtree prune and regraft distance. Ann. Combin. 8, 409-423.
6. Bordewich, M., and Semple, C. 2007a. Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Appl. Math. 155, 914-928. (Pubitemid 46436152)
7. Bordewich, M., and Semple, C. 2007b. Computing the hybridization number of two phylogenetic trees is fixedparameter tractable. IEEE Trans. Comput. Biol. Bioinform 4, 458-466. (Pubitemid 47274721)
8. Bordewich, M., Linz, S., St. John, K., et al. 2007. A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinform. 3, 86-98.
9. Chor, B., and Tuller, T. 2005. Maximum likelihood of evolutionary trees is hard. Lect. Notes Comput. Sci. 3500, 296-310. (Pubitemid 41420672)
10. Collins, J. 2009. Rekernelisation algorithms in hybrid phylogenies [M.Sc. Thesis]. University of Canterbury, Christchurch, New Zealand.
11. Dehne, F., Langston, M.A., Luo, X., et al. 2006. The cluster editing problem: Implementations and experiments. Lect. Notes Comput. Sci. 4169, 13-24. (Pubitemid 44609908)
12. Downey, R., and Fellows, M. 1998. Parameterized Complexity (Monographs in Computer Science). Springer, Berlin.
13. Ellstrand, N.C., Whitkus, R., and Rieseberg, L.H. 1996. Distribution of spontaneous plant hybrids. Proc. Natl. Acad. Sci. USA 93, 5090-5093. (Pubitemid 26162875)
14. Flum, J., and Grohe, G. 2006. Parameterized Complexity Theory. Springer, Berlin.
15. Foulds, L.R., and Graham, R.L. 1982. The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3, 43-49.
16. Gramm, J., and Niedermeier, R. 2002. Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. Bioinformatics 18, S128-S139. (Pubitemid 41073227)
17. Gramm, J., and Niedermeier, R. 2003. A fixed-parameter algorithm for minimum quartet inconsistency. J. Comput. Syst. Sci. 67, 723-741.
18. Gramm, J., Nickelsen, A., and Tantau, T. 2008. Fixed-parameter algorithms in phylogenetics. Comput. J. 51, 79-101.
19. Grass Phylogeny Working Group. 2001. Phylogeny and subfamilial classification of the grasses (Poaceae). Ann. Mol. Bot. Gard. 88, 373-457.
20. Hein, J., Jing, T., Wang, L., et al. 1996. On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71, 153-169. (Pubitemid 126391777)
21. Linz, S. 2008. Reticulation in evolution [Ph.D. Dissertation]. Heinrich Heine University, Düsseldorf, Germany.
22. Niedermeier, R., and Rossmanith, P. 2000. A general method to speed up fixed-parameter-tractable algorithms. Inform. Process. Lett. 73, 125-129. (Pubitemid 30560887)
23. Roch, S. 2006. A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. IEEE Trans. Comput. Biol. Bioinform. 3, 1545-5963.
24. Semple, C. 2007. Hybridization networks, 277-314. In Gascuel, O., and Steel, M., eds. Reconstructing Evolution: New Mathematical and Computational Advances. Oxford University Press, New York.
25. Semple, C., and Steel, M. 2003. Phylogenetics. Oxford University Press, New York.