메뉴 건너뛰기




Volumn 1, Issue 1, 2006, Pages

Fast calculation of the quartet distance between trees of arbitrary degrees

Author keywords

[No Author keywords available]

Indexed keywords


EID: 34248351066     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-1-16     Document Type: Article
Times cited : (21)

References (15)
  • 4
    • 0347512294 scopus 로고    scopus 로고
    • Subtree transfer operations and their induced metrics on evolutionary trees
    • Allen BL Steel M Subtree transfer operations and their induced metrics on evolutionary trees Annals of Combinatorics 2001 5 1-13
    • (2001) Annals of Combinatorics , vol.5 , pp. 1-13
    • Allen, B.L.1    Steel, M.2
  • 6
    • 84959752542 scopus 로고
    • Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units
    • Estabrook G McMorris F Meacham C Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units Syst Zool 1985 34 193-200
    • (1985) Syst Zool , vol.34 , pp. 193-200
    • Estabrook, G.1    McMorris, F.2    Meacham, C.3
  • 7
    • 12044252586 scopus 로고
    • Distribution of tree comparison metrics-some new results
    • Steel M Penny D Distribution of tree comparison metrics-some new results Syst Biol 1993 42 2 126-141
    • (1993) Syst Biol , vol.42 , Issue.2 , pp. 126-141
    • Steel, M.1    Penny, D.2
  • 8
    • 34248333142 scopus 로고
    • An Efficient Algorithm to Compute Quartet Dissimilarity Measures
    • [Unpublished, Bachelor of Science (Honours) Dissertation. Memorial University of Newfoundland]
    • Doucette CR An Efficient Algorithm to Compute Quartet Dissimilarity Measures 1985 [Unpublished, Bachelor of Science (Honours) Dissertation. Memorial University of Newfoundland]
    • (1985)
    • Doucette, C.R.1
  • 10
    • 15244342170 scopus 로고    scopus 로고
    • Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n)
    • Brodal GS Fagerberg R Pedersen CNS Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n) Algorithmica 2003 38 377-395
    • (2003) Algorithmica , vol.38 , pp. 377-395
    • Brodal, G.S.1    Fagerberg, R.2    Pedersen, C.N.S.3
  • 12
    • 34248387016 scopus 로고    scopus 로고
    • r8s http://ginger.ucdavis.edu/r8s/
  • 13
    • 34248329287 scopus 로고    scopus 로고
    • Pfam http://www.sanger.ac.uk/Software/Pfam/
  • 15
    • 34248351662 scopus 로고    scopus 로고
    • QuartetDist http://www.daimi.au.dk/~chrisc/qdist/


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