메뉴 건너뛰기




Volumn 9, Issue 2, 2012, Pages 372-384

Algorithms for reticulate networks of multiple phylogenetic trees

Author keywords

lower bounds of reticulate numbers; Phylogenetic trees; reticulate networks

Indexed keywords

BEST PROGRAM; EXPERIMENTAL DATA; FIXED-PARAMETER ALGORITHMS; LOWER BOUNDS; PHYLOGENETIC TREES;

EID: 84863073616     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2011.137     Document Type: Article
Times cited : (38)

References (18)
  • 1
    • 33645568886 scopus 로고    scopus 로고
    • Phylogenetic identification of lateral genetic transfer events
    • R.G. Beiko and N. Hamilton, "Phylogenetic Identification of Lateral Genetic Transfer Events" BMC Evolutionary Biology, vol. 6, pp. 159-169, 2006.
    • (2006) BMC Evolutionary Biology , vol.6 , pp. 159-169
    • Beiko, R.G.1    Hamilton, N.2
  • 2
    • 13844266486 scopus 로고    scopus 로고
    • On the computational complexity of the rooted subtree prune and regraft distance
    • DOI 10.1007/s00026-004-0229-z
    • M. Bordewich and C. Semple, "On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance" Annals of Combinatorics, vol. 8, pp. 409-423, 2005. (Pubitemid 40251118)
    • (2005) Annals of Combinatorics , vol.8 , Issue.4 , pp. 409-423
    • Bordewich, M.1    Semple, C.2
  • 3
    • 33947231094 scopus 로고    scopus 로고
    • Computing the minimum number of hybridization events for a consistent evolutionary history
    • DOI 10.1016/j.dam.2006.08.008, PII S0166218X06003957
    • M. Bordewich and C. Semple, "Computing the Minimum Number of Hybridization Events for a Consistent Evolutionary History" Discrete Applied Math., vol. 155, pp. 914-928, 2007. (Pubitemid 46436152)
    • (2007) Discrete Applied Mathematics , vol.155 , Issue.8 , pp. 914-928
    • Bordewich, M.1    Semple, C.2
  • 4
    • 34547977053 scopus 로고    scopus 로고
    • Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable
    • DOI 10.1109/TCBB.2007.1019
    • M. Bordewich and C. Semple, "Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable" IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 4, no. 3, pp. 458-466, July 2007. (Pubitemid 47274721)
    • (2007) IEEE/ACM Transactions on Computational Biology and Bioinformatics , vol.4 , Issue.3 , pp. 458-466
    • Bordewich, M.1    Semple, C.2
  • 5
    • 78149247301 scopus 로고    scopus 로고
    • HybridNet: A tool for constructing hybridization networks
    • http://www.cs.cityu.e du.hk/lwang/software/Hn/notess2.pdf
    • Z.-Z. Chen and L. Wang, "HybridNet: A Tool for Constructing Hybridization Networks" Bioinformatics, vol. 26, pp. 2912-2913, http://rnc.r.dendai.ac.jp/~chen/notess2.pdf or http://www.cs.cityu.edu.hk/ ~lwang/software/Hn/notess2.pdf), 2010.
    • (2010) Bioinformatics , vol.26 , pp. 2912-2913
    • Chen, Z.-Z.1    Wang, L.2
  • 6
    • 80053108302 scopus 로고    scopus 로고
    • Quantifying hybridization in realistic time
    • L. Collins, S. Linz, and C. Semple, "Quantifying Hybridization in Realistic Time" J. Computational Biology, vol. 18, pp. 1305-1318, http://www.math.canterbury.ac.nz/~c.semple/software.shtml], 2011.
    • (2011) J. Computational Biology , vol.18 , pp. 1305-1318
    • Collins, L.1    Linz, S.2    Semple, C.3
  • 8
    • 0002291589 scopus 로고    scopus 로고
    • On the complexity of comparing evolutionary trees
    • PII S0166218X96000625
    • J. Hein, T. Jing, L. Wang, and K. Zhang, "On the Complexity of Comparing Evolutionary Trees" Discrete Applied Math., vol. 71, pp. 153-169, 1996. (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
    • 0036184745 scopus 로고    scopus 로고
    • Generating samples under a Wright-Fisher neutral model of genetic variation
    • R. Hudson, "Generating Samples under the Wright-Fisher Neutral Model of Genetic Variation" Bioinformatics, vol. 18, pp. 337-338, 2002. (Pubitemid 34183119)
    • (2002) Bioinformatics , vol.18 , Issue.2 , pp. 337-338
    • Hudson, R.R.1
  • 12
    • 0024144496 scopus 로고
    • On finding lowest common ancestors: Simplification and parallelization
    • B. Schieber and U. Vishkin, "On Finding Lowest Common Ancestors: Simplification and Parallelization" SIAM J. Computing, vol. 17, pp. 1253-1262, 1988.
    • (1988) SIAM J. Computing , vol.17 , pp. 1253-1262
    • Schieber, B.1    Vishkin, U.2
  • 16
    • 78149251780 scopus 로고    scopus 로고
    • Fast FPT algorithms for computing rooted agreement forest: Theory and experiments
    • C. Whidden, R.G. Beiko, and N. Zeh, "Fast FPT Algorithms for Computing Rooted Agreement Forest: Theory and Experiments" Proc. Int'l Symp. Experimental Algorithms, pp. 141-153, 2010.
    • (2010) Proc. Int'l Symp. Experimental Algorithms , pp. 141-153
    • Whidden, C.1    Beiko, R.G.2    Zeh, N.3
  • 17
    • 58349106238 scopus 로고    scopus 로고
    • A practical method for exact computation of subtree prune and regraft distance
    • Y. Wu, "A Practical Method for Exact Computation of Subtree Prune and Regraft Distance" Bioinformatics, vol. 25, pp. 190-196, 2009.
    • (2009) Bioinformatics , vol.25 , pp. 190-196
    • Wu, Y.1
  • 18
    • 77954180873 scopus 로고    scopus 로고
    • Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees
    • Y. Wu, "Close Lower and Upper Bounds for the Minimum Reticulate Network of Multiple Phylogenetic Trees" Bioinformatics, vol. 26, pp. 140-148, 2010.
    • (2010) Bioinformatics , vol.26 , pp. 140-148
    • Wu, Y.1


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