Faster exact computation of rSPR distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7924 LNCS, Issue , 2013, Pages 36-47

  Chen, Zhi Zhong ^a   Wang, Lusheng ^b  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

fixed parameter algorithm; Phylogenetic tree; rSPR distance

Indexed keywords

EXACT ALGORITHMS; EXACT COMPUTATIONS; FIXED-PARAMETER ALGORITHMS; PHYLOGENETIC TREES; ROOTED SUBTREE; RSPR DISTANCE;

ALGORITHMS; BIOINFORMATICS;

TREES (MATHEMATICS);

EID: 84884864035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38756-2_7     Document Type: Conference Paper

References (15)

1. Beiko, R.G., Hamilton, N.: Phylogenetic identification of lateral genetic transfer events. BMC Evol. Biol. 6, 159-169 (2006)
2. Bonet, M.L., St. John, K., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. Journal of Computational Biology 13, 1419-1434 (2006)
3. Bordewich, M., McCartin, C., Semple, C.: A 3-approximation algorithm for the subtree distance between phylogenies. Journal of Discrete Algorithms 6, 458-471 (2008)
4. Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8, 409-423 (2005)
5. Chen, Z.-Z., Wang, L.: FastHN: A Fast Tool for Minimum Hybridization Networks. BMC Bioinformatics 13, 155 (2012)
6. Chen, Z.-Z., Wang, L.: An Ultrafast Tool for Minimum Reticulate Networks. Journal of Computational Biology 20(1), 38-41 (2013)
7. Goloboff, P.A.: Calculating SPR distances between trees. Cladistics 24(4), 591-597 (2007)
8. Hein, J., Jing, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71, 153-169 (1996)
9. Hill, T., Nordstrom, K.J., Thollesson, M., Safstrom, T.M., Vernersson, A.K., Fredriksson, R., Schioth, H.B.: SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees. BMC Evolutionary Biology 10, 42 (2010)
10. MacLeod, D., Charlebois, R.L., Doolittle, F., Bapteste, E.: Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement. BMC Evolutionary Biology 5(1), 27 (2005)
11. Rodrigues, E.M., Sagot, M.-F., Wakabayashi, Y.: The maximum agreement forest problem: Approximation algorithms and computational experiments. Theoretical Computer Science 374, 91-110 (2007)
12. Than, C., Ruths, D., Nakhleh, L.: PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships. BMC Bioinformatics 9, 322 (2008)
13. Wu, Y.: A practical method for exact computation of subtree prune and regraft distance. Bioinformatics 25(2), 190-196 (2009)
14. Whidden, C., Beiko, R.G., Zeh, N.: Fast FPT algorithms for computing rooted agreement forests: Theory and experiments. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 141-153. Springer, Heidelberg (2010)
15. Whidden, C., Zeh, N.: A unifying view on approximation and FPT of agreement forests. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol. 5724, pp. 390-402. Springer, Heidelberg (2009)