A practical method for exact computation of subtree prune and regraft distance

Bioinformatics

Volumn 25, Issue 2, 2009, Pages 190-196

  Wu, Yufeng ^a  

^a University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; COMPUTER PROGRAM; COMPUTER SIMULATION; CONTROLLED STUDY; LINEAR SYSTEM; MATHEMATICAL COMPUTING; NONHUMAN; PHYLOGENETIC TREE; PLANT GRAFTING; PRIORITY JOURNAL; SYSTEM ANALYSIS; SYSTEMS BIOLOGY; TREE PRUNING;

COMPUTATIONAL BIOLOGY; DATABASES, GENETIC; PHYLOGENY; SOFTWARE; USER-COMPUTER INTERFACE;

EID: 58349106238     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btn606     Document Type: Article

References (18)

1. Baroni,M. et al. (2005) Bounding the number of hybridisation events for a consistent evolutionary history. J. Math. Biol., 51, 171-182.
2. Beiko,R.G. and Hamilton,N. (2006) Phylogenetic identification of lateral genetic transfer events. BMC Evol. Biol., 6, 159-169.
3. Bonet,M.L. et al. (2006) Approximating subtree distances between phylogenies. J. Comp. Bio., 13, 1419-1434.
4. Bordewich,M. and Semple,C. (2004) On the computational complexity of the rooted subtree prune and regraft distance. Ann. Combinatorics, 8, 409-423.
5. Bordewich,M. et al. (2007) A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinform., 3, 86-98.
6. Bordewich,M. et al. (2008) A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithm, 6 458-471.
7. Felsenstein,J. (2004) Inferring Phylogenies, Sinauer, Sunderland, MA. Grass Phylogeny Working Group (2001) Phylogeny and subfamilial classification of the grasses (poaceae). Ann. Mo. Bot. Gard., 88, 373-457.
8. Gusfield,D. (2003) Haplotype inference by pure parsimony. In Baeza-Yates,R. et al. (eds), 14th Annual Symposium on Combinatorial Pattern Matching (CPM'03), LNCS, vol. 2676. Springer, pp. 144-155.
9. Hallett,M. and Lagergren,J. (2001) Efficient algorithms for lateral gene transfer problems. In Proceedings of fifth annual conference on Research in Computational Molecular Biology (RECOMB 2001), pp. 149-156.
10. Hein,J. (1990) Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci., 98, 185-200.
11. Hein,J. (1993) A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol., 36, 396-405.
12. Hein,J. et al. (1996) On the complexity of comparing evolutionary trees. Discrete Appl. Math., 71, 153-169.
13. MacLeod,D. et al. (2005) Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement. BMC Evol. Biol., 5, 27.
14. Rodrigues,E.M. et al. (2001) Some approximation results for the maximum agreement forest problem. In LNCS 2129. Springer, London, pp. 159-169.
15. Schmidt,H.A. (2003) Phylogenetic trees from large datasets. PhD thesis, Heinrich-Heine-Universitat, Dusseldorf.
16. Semple,C. (2007) Hybridization networks. In Gascuel,O. and Steel,M. (eds.), Reconstructing Evolution: New Mathematical and Computational Advances. Oxford University Press, New York, pp. 277-314.
17. Semple,C. and Steel,M. (2003) Phylogenetics. Oxford University Press, New York.
18. Song,Y.S. and Hein,J. (2005) Constructing minimal ancestral recombination graphs. J. Comp. Bio., 12, 159-178.