Abstract
Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this case, we want to measure the dissimilarity of the two trees. The rooted subtree prune and regraft (rSPR) distance of the two trees has been used for this purpose, and many algorithms and software tools have been developed for computing the rSPR distance of two given phylogenetic trees. The previously fastest exact algorithm for this problem runs in \(O\left( 2.415^dn\right) \) time, where \(n\) and \(d\) are the number of leaves and the rSPR distance of the input trees, respectively. In this paper, we present a faster exact algorithm which runs in \(O\left( 2.344^dn\right) \) time. Our experiments show that the new algorithm is significantly faster than the newest version (namely, v1.1.1) of the previously best software (namely, rSPR) for RSPR distance.
Similar content being viewed by others
Notes
In other words, we can use a similar argument of Whidden et al. (2010) to prove the correctness of the processing of \(T_1\) and \(F_2\) in this case.
References
Beiko RG, Hamilton N (2006) Phylogenetic identification of lateral genetic transfer events. BMC Evol Biol 6:159–169
Bonet ML, John KSt, Mahindru R, Amenta N (2006) Approximating subtree distances between phylogenies. J Comput Biol 13:1419–1434
Bordewich M, McCartin C, Semple C (2008) A 3-approximation algorithm for the subtree distance between phylogenies. J Discret Algorithms 6:458–471
Bordewich M, Semple C (2005) On the computational complexity of the rooted subtree prune and regraft distance. Ann Combinatorics 8:409–423
Chen Z-Z, Wang L (2012) FastHN: a fast tool for minimum hybridization networks. BMC Bioinform 13:155
Chen Z-Z, Wang L (2013) An ultrafast tool for minimum reticulate networks. J Comput Biol 20(1):38–41
Gasieniec L, Jansson J, Lingas A, Östlin A (1999) On the complexity of constructing evolutionary trees. J Comb Optim 3:183–197
Goloboff PA (2007) Calculating SPR distances between trees. Cladistics 24(4):591–597
Grass Phylogeny Working Group (2001) Phylogeny and subfamilial classification of the grasses (poaceae). Ann Mo Bot Gard 88:373–457
Hein J, Jing T, Wang L, Zhang K (1996) On the complexity of comparing evolutionary trees. Discret Appl Math 71:153–169
Hill T, Nordström KJ, Thollesson M, Säfström TM, Vernersson AK, Fredriksson R, Schiöth HB (2010) SPRIT: identifying horizontal gene transfer in rooted phylogenetic trees. BMC Evolut Biol 10:42
Ma B, Wang L, Zhang L (1999) Fitting distances by tree metrics with increment error. J Comb Optim 3:213–225
Ma B, Zhang L (2011) Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction. J Comb Optim 21:409–422
MacLeod D, Charlebois RL, Doolittle F, Bapteste E (2005) Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement. BMC Evolut Biol 5(1):27
Rodrigues EM, Sagot M-F, Wakabayashi Y (2007) The maximum agreement forest problem: approximation algorithms and computational experiments. Theor Comput Sci 374:91–110
Than C, Ruths D, Nakhleh L (2008) PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships. BMC Bioinform 9:322
Wu Y (2009) A practical method for exact computation of subtree prune and regraft distance. Bioinformatics 25(2):190–196
Whidden C, Beiko RG, Zeh N (2010) Fast FPT algorithms for computing rooted agreement forest: theory and experiments. LNCS 6049:141–153
Whidden C, Zeh N (2009) A unifying view on approximation and FPT of agreement forests. LNCS 5724:390–401
Acknowledgments
Zhi-Zhong Chen was supported in part by the Grant-in-Aid for Scientific Research of the Ministry of Education, Science, Sports and Culture of Japan, under Grant No. 24500023. Lusheng Wang was fully supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 121608].
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, ZZ., Fan, Y. & Wang, L. Faster exact computation of rSPR distance. J Comb Optim 29, 605–635 (2015). https://doi.org/10.1007/s10878-013-9695-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-013-9695-8