메뉴 건너뛰기




Volumn 22, Issue 9, 2009, Pages 1320-1324

An algebraic metric for phylogenetic trees

Author keywords

Distance; Linear time algorithms; Metric; Permutations; Phylogenetic trees

Indexed keywords

DISTANCE; LINEAR TIME ALGORITHMS; METRIC; PERMUTATIONS; PHYLOGENETIC TREES;

EID: 67349247483     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2009.03.003     Document Type: Article
Times cited : (20)

References (8)
  • 1
    • 33646724493 scopus 로고    scopus 로고
    • A fast algorithmic technique for comparing large phylogenetic trees
    • Proc. 12th Int. Symp. String Processing and Information Retrieval, Springer, Berlin
    • Valiente G. A fast algorithmic technique for comparing large phylogenetic trees. Proc. 12th Int. Symp. String Processing and Information Retrieval. Lecture Notes in Computer Science vol. 3772 (2005), Springer, Berlin 370-375
    • (2005) Lecture Notes in Computer Science , vol.3772 , pp. 370-375
    • Valiente, G.1
  • 3
    • 0003040028 scopus 로고    scopus 로고
    • Bio-molecular shapes and algebraic structures
    • Reidys C., and Stadler P.F. Bio-molecular shapes and algebraic structures. Computers & Chemistry 20 1 (1996) 85-94
    • (1996) Computers & Chemistry , vol.20 , Issue.1 , pp. 85-94
    • Reidys, C.1    Stadler, P.F.2
  • 5
    • 0003002776 scopus 로고
    • Optimal algorithms for comparing trees with labeled leaves
    • Day W. Optimal algorithms for comparing trees with labeled leaves. Journal of Classification 2 1 (1985) 7-28
    • (1985) Journal of Classification , vol.2 , Issue.1 , pp. 7-28
    • Day, W.1
  • 6
    • 67349158801 scopus 로고    scopus 로고
    • G. Cardona, M. Llabrés, F. Rosselló, G. Valiente, Nodal metrics for rooted phylogenetic trees, (2008) (submitted for publication). Available on line at: arXiv:0806.2035v1 [q-bio.PE]
    • G. Cardona, M. Llabrés, F. Rosselló, G. Valiente, Nodal metrics for rooted phylogenetic trees, (2008) (submitted for publication). Available on line at: arXiv:0806.2035v1 [q-bio.PE]
  • 7
    • 0021153697 scopus 로고
    • An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes
    • Oden N.L., and Shao K. An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes. Bulletin of Mathematical Biology 46 3 (1984) 379-387
    • (1984) Bulletin of Mathematical Biology , vol.46 , Issue.3 , pp. 379-387
    • Oden, N.L.1    Shao, K.2


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