메뉴 건너뛰기




Volumn 49, Issue 4, 1987, Pages 461-467

Computational complexity of inferring phylogenies from dissimilarity matrices

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; BIOLOGICAL MODEL; BIOMETRY; EVOLUTION; PHYLOGENY;

EID: 0023079987     PISSN: 00928240     EISSN: 15229602     Source Type: Journal    
DOI: 10.1007/BF02458863     Document Type: Article
Times cited : (142)

References (24)
  • 5
    • 0000029611 scopus 로고
    • Computationally Difficult Parsimony Problems in Phylogenetic Systematics
    • (1983) J. theor. Biol. , vol.103 , pp. 429-438
    • Day, W.H.E.1
  • 15
    • 0020308198 scopus 로고
    • Unlikelihood that Minimal Phylogenies for a Realistic Biological Study can be Constructed in Reasonable Computational Time
    • (1982) Math. Biosci. , vol.60 , pp. 133-142
    • Graham, R.L.1    Foulds, L.R.2
  • 19
    • 84936597378 scopus 로고    scopus 로고
    • Jardine, N. and R. Sibson. Mathematical Taxonomy. London: John Wiley.


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