메뉴 건너뛰기




Volumn 20, Issue 1, 2013, Pages 38-41

An ultrafast tool for minimum reticulate networks

Author keywords

(acyclic) agreement forest; hybridization number; phylogenetic tree; reticulate network; rSPR distance

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; COMPUTER PROGRAM; HYBRIDIZATION; MATHEMATICAL PHENOMENA; MOLECULAR EVOLUTION; PHYLOGENY;

EID: 84872084966     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2012.0240     Document Type: Article
Times cited : (20)

References (13)
  • 1
    • 84856082446 scopus 로고    scopus 로고
    • Fast computation of minimum hybridization networks
    • Albrecht, B., Scornavacca, C., Cenci, A., et al. 2012. Fast computation of minimum hybridization networks. Bioinformatics 28, 191-197.
    • (2012) Bioinformatics , vol.28 , pp. 191-197
    • Albrecht, B.1    Scornavacca, C.2    Cenci, A.3
  • 2
    • 22844448185 scopus 로고    scopus 로고
    • Bounding the number of hybridisation events for a consistent evolutionary history
    • DOI 10.1007/s00285-005-0315-9
    • Baroni, M., Grunewald, S., Moulton, V., et al. 2005. Bounding the number of hybridisation events for a consistent evolutionary history. J. of Math. Biol. 51, 171-182. (Pubitemid 41040209)
    • (2005) Journal of Mathematical Biology , vol.51 , Issue.2 , pp. 171-182
    • Baroni, M.1    Grunewald, S.2    Moulton, V.3    Semple, C.4
  • 3
    • 33645568886 scopus 로고    scopus 로고
    • Phylogenetic identification of lateral genetic transfer events
    • Beiko, R. G., and Hamilton, N. 2006. Phylogenetic identification of lateral genetic transfer events. BMC Evol. Biol. 6, 159-169.
    • (2006) BMC Evol. Biol. , vol.6 , pp. 159-169
    • Beiko, R.G.1    Hamilton, N.2
  • 4
    • 13844266486 scopus 로고    scopus 로고
    • On the computational complexity of the rooted subtree prune and regraft distance
    • DOI 10.1007/s00026-004-0229-z
    • Bordewich, M., and Semple, C. 2005. On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8, 409-423. (Pubitemid 40251118)
    • (2005) Annals of Combinatorics , vol.8 , Issue.4 , pp. 409-423
    • Bordewich, M.1    Semple, C.2
  • 7
    • 84863093047 scopus 로고    scopus 로고
    • A fast tool for minimum hybridization networks
    • Chen, Z.-Z., Wang, L., and Yamanaka, S. 2012. A fast tool for minimum hybridization networks. BMC Bioinformatics 13, 155.
    • (2012) BMC Bioinformatics , vol.13 , pp. 155
    • Chen, Z.-Z.1    Wang, L.2    Yamanaka, S.3
  • 8
    • 80053108302 scopus 로고    scopus 로고
    • Quantifying hybridization in realistic time
    • Collins, L., Linz, S., and Semple, C. 2011. Quantifying hybridization in realistic time. J. of Comput. Biol. 18, 1305-1318.
    • (2011) J. of Comput. Biol. , vol.18 , pp. 1305-1318
    • Collins, L.1    Linz, S.2    Semple, C.3
  • 9
    • 0002291589 scopus 로고    scopus 로고
    • On the complexity of comparing evolutionary trees
    • PII S0166218X96000625
    • Hein, J., Jing, T., Wang, L., et al. 1996. On the complexity of comparing evolutionary trees. Disc. Appl. Math. 71, 153-169. (Pubitemid 126391777)
    • (1996) Discrete Applied Mathematics , vol.71 , Issue.1-3 , pp. 153-169
    • Hein, J.1    Jiang, T.2    Wang, L.3    Zhang, K.4
  • 10
    • 78149273013 scopus 로고    scopus 로고
    • Fast computation of the exact hybridization number of two phylogenetic trees
    • Wang, J., and Wu, Y. 2010. Fast computation of the exact hybridization number of two phylogenetic trees. Proceedings of ISBRA 2010, 203-214.
    • (2010) Proceedings of ISBRA , vol.2010 , pp. 203-214
    • Wang, J.1    Wu, Y.2
  • 11
    • 78149251780 scopus 로고    scopus 로고
    • Fast FPT algorithms for computing rooted agreement forest: Theory and experiments
    • Whidden, C., Beiko, R. G., and Zeh, N. 2010. Fast FPT algorithms for computing rooted agreement forest: theory and experiments. LNCS 6049, 141-153.
    • (2010) LNCS , vol.6049 , pp. 141-153
    • Whidden, C.1    Beiko, R.G.2    Zeh, N.3
  • 12
    • 58349106238 scopus 로고    scopus 로고
    • A practical method for exact computation of subtree prune and regraft distance
    • Wu, Y. 2009. A practical method for exact computation of subtree prune and regraft distance. Bioinformatics, 190-196.
    • (2009) Bioinformatics , pp. 190-196
    • Wu, Y.1
  • 13
    • 77954180873 scopus 로고    scopus 로고
    • Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees
    • Wu, Y. 2010. Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees. Bioinformatics [ISMB] 26, 140-148.
    • (2010) Bioinformatics [ISMB] , vol.26 , pp. 140-148
    • Wu, Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.