메뉴 건너뛰기




Volumn 7, Issue 3, 2010, Pages 572-576

On the complexity of uSPR distance

Author keywords

analysis of algorithms; fixed parameter tractability; Phylogeny; phylogeny

Indexed keywords

ANALYSIS OF ALGORITHMS; FIXED PARAMETERS; FIXED-PARAMETER TRACTABILITY; LOWER BOUNDS; SUBTREES;

EID: 77955466285     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2008.132     Document Type: Article
Times cited : (15)

References (10)
  • 1
    • 0347512294 scopus 로고    scopus 로고
    • Subtree transfer operations and their induced metrics on evolutionary trees
    • B.L. Allen and M. Steel, "Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees," Annals of Combinatorics, vol.5, no.1, pp. 1-15, 2001.
    • (2001) Annals of Combinatorics , vol.5 , Issue.1 , pp. 1-15
    • Allen, B.L.1    Steel, M.2
  • 2
    • 34547963170 scopus 로고    scopus 로고
    • Approximating subtree distances between phylogenies
    • M.L. Bonet, K.St. John, R. Mahindru, and N. Amenta, "Approximating Subtree Distances between Phylogenies," J. Computational Biology, vol.13, no.8, pp. 1419-1434, 2006.
    • (2006) J. Computational Biology , vol.13 , Issue.8 , pp. 1419-1434
    • Bonet, M.L.1    John, K.St.2    Mahindru, R.3    Amenta, N.4
  • 3
    • 47549103966 scopus 로고    scopus 로고
    • A 3-Approximation algorithm for the subtree distance between phylogenies
    • M. Bordewich, C. McCartin, and C. Semple, "A 3-Approximation Algorithm for the Subtree Distance between Phylogenies," J. Discrete Algorithms, vol.6, no.3, pp. 458-471, 2008.
    • (2008) J. Discrete Algorithms , vol.6 , Issue.3 , pp. 458-471
    • Bordewich, M.1    McCartin, C.2    Semple, C.3
  • 4
    • 13844266486 scopus 로고    scopus 로고
    • On the computational complexity of the rooted subtree prune and regraft distance
    • M. Bordewich and C. Semple, "On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance," Annals of Combintorics, vol.8, pp. 409-423, 2004.
    • (2004) Annals of Combintorics , vol.8 , pp. 409-423
    • Bordewich, M.1    Semple, C.2
  • 5
    • 36849021471 scopus 로고    scopus 로고
    • A faster FPT algorithm for the maximum agreement forest problem
    • M. Hallett and C. McCartin, "A Faster FPT Algorithm for the Maximum Agreement Forest Problem," Theory of Computing Systems, vol.41, no.3, pp. 539-550, 2007.
    • (2007) Theory of Computing Systems , vol.41 , Issue.3 , pp. 539-550
    • Hallett, M.1    McCartin, C.2
  • 6
    • 0002291589 scopus 로고    scopus 로고
    • On the complexity of comparing evolutionary Trees
    • J. Hein, T. Jiang, L. Wang, and K. Zhang, "On the Complexity of Comparing Evolutionary Trees," Discrete Applied Math., vol.71, nos. 1-3, pp. 153-169, 1996.
    • (1996) Discrete Applied Math , vol.71 , Issue.1-3 , pp. 153-169
    • Hein, J.1    Jiang, T.2    Wang, L.3    Zhang, K.4
  • 9
    • 77955470343 scopus 로고    scopus 로고
    • M. Steel, "SPR Conjecture," www.math.canterbury.ac.nz/∼m. steel/ research/reward2.pdf, 2002.
    • (2002) SPR Conjecture
    • Steel, M.1


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