메뉴 건너뛰기
Systematic Biology
Volumn 42, Issue 2, 1993, Pages 200-210
On islands of trees and the efficacy of different methods of branch swapping in finding most-parsimonious trees
Author keywords

[No Author keywords available]
Indexed keywords

EID: 12044255161     PISSN: 10635157     EISSN: 1076836X     Source Type: Journal    
DOI: 10.1093/sysbio/42.2.200     Document Type: Article
Times cited : (28)
References (17)
  • 1
    • 0002875467 scopus 로고
    • A computationally efficient approximation to the nearest neighbor interchange metric
    • BROWN, E. K., W. H. E. DAY, 1984. A computationally efficient approximation to the nearest neighbor interchange metric. J. Classif. 1:93-124.
    • (1984) J. Classif , vol.1 , pp. 93-124
    • Brown, E.K.1    Day, W.H.2
  • 2
    • 0000910750 scopus 로고
    • Properties of the nearest neighbor interchange metric for trees of small size
    • DAY, W. H. E. 1983. Properties of the nearest neighbor interchange metric for trees of small size. J. Theor. Biol. 101:275-288.
    • (1983) J. Theor. Biol , vol.101 , pp. 275-288
    • Day, W.1
  • 3
    • 0000122573 scopus 로고
    • PHYLIP Phylogeny inference package (Version 3.2)
    • FELSENSTEIN, J. 1989. PHYLIP Phylogeny inference package (version 3.2). Cladistics 5:164-166.
    • (1989) Cladistics , vol.5 , pp. 164-166
    • Felsenstein, J.1
  • 4
    • 0025342577 scopus 로고
    • Unified approach to alignment and phylogenies
    • HEIN, J. 1990. Unified approach to alignment and phylogenies. Methods Enzymol. 183:626-645.
    • (1990) Methods Enzymol , vol.183 , pp. 626-645
    • Hein, J.1
  • 5
    • 0000011391 scopus 로고
    • Comments on computing the similarity of binary trees
    • JARVIS, J. P., J. K. LUEDEMAN, D. R. SHIER, 1983. Comments on computing the similarity of binary trees. J. Theor. Biol. 100:427-433.
    • (1983) J. Theor. Biol , vol.100 , pp. 427-433
    • Jarvis, J.P.1    Luedeman, J.K.2    Shier, D.R.3
  • 6
    • 0002757548 scopus 로고
    • Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
    • KRIVANEK, M. 1986. Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete. J. Classif. 3:55-60.
    • (1986) J. Classif , vol.3 , pp. 55-60
    • Krivanek, M.1
  • 7
    • 0009581798 scopus 로고
    • An empirical comparison of numerical Wagner computer programs
    • LUCKOW, M., R. A. PIMENTEL, 1985. An empirical comparison of numerical Wagner computer programs. Cladistics 1:47-66.
    • (1985) Cladistics , vol.1 , pp. 47-66
    • Luckow, M.1    Pimentel, R.A.2
  • 8
    • 84960569058 scopus 로고
    • The discovery and importance of multiple islands of most-parsimonious trees
    • MADDISON, D. R. 1991. The discovery and importance of multiple islands of most-parsimonious trees. Syst. Zool. 40:315-328.
    • (1991) Syst. Zool , vol.40 , pp. 315-328
    • Maddison, D.R.1
  • 9
    • 0002154268 scopus 로고
    • The skeletal morphology of the Cretaceous cryptodiran turtle, Adocus, and the relationships of the Trionychoidea
    • MEYLAN, P. A., E. S. GAFFNEY, 1989. The skeletal morphology of the Cretaceous cryptodiran turtle, Adocus, and the relationships of the Trionychoidea. Am. Mus. Novit. 2941:1-60.
    • (1989) Am. Mus. Novit , pp. 1-60
    • Meylan, P.A.1    Gaffney, E.S.2
  • 10
    • 0015594566 scopus 로고
    • An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets
    • MOORE, G. W., M. GOODMAN, J. BARNABAS, 1973. An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets. J. Theor. Biol. 38:423457.
    • (1973) J. Theor. Biol , pp. 38
    • Moore, G.W.1    Goodman, M.2    Barnabas, J.3
  • 12
    • 0002393841 scopus 로고
    • The use of tree comparison metrics
    • PENNY, D., M. D. HENDY, 1985. The use of tree comparison metrics. Syst. Zool. 34:75-82.
    • (1985) Syst. Zool , vol.34 , pp. 75-82
    • Penny, D.1    Hendy, M.D.2
  • 13
    • 84989431567 scopus 로고
    • An empirical comparison of microcomputer parsimony programs
    • PLATNICK, N. I. 1987. An empirical comparison of microcomputer parsimony programs. Cladistics 3:121-144.
    • (1987) Cladistics , vol.3 , pp. 121-144
    • Platnick, N.I.1
  • 14
    • 84989405800 scopus 로고
    • An empirical comparison of microcomputer parsimony programs, II
    • PLATNICK, N. I. 1989. An empirical comparison of microcomputer parsimony programs, II. Cladistics 5:145-161.
    • (1989) Cladistics , vol.5 , pp. 145-161
    • Platnick, N.I.1
  • 15
    • 0003080472 scopus 로고
    • Comparison of labeled trees with valency three
    • ROBINSON, D. F. 1971. Comparison of labeled trees with valency three. J. Comb. Theor. 11:105-119.
    • (1971) J. Comb. Theor , vol.11 , pp. 105-119
    • Robinson, D.F.1
  • 16
    • 0026660413 scopus 로고
    • A simple method for estimating and testing minimum-evolution trees
    • RZHETSKY, A., M. NEI, 1992. A simple method for estimating and testing minimum-evolution trees. Mol. Biol. Evol. 9:945-967.
    • (1992) Mol. Biol. Evol , vol.9 , pp. 945-967
    • Rzhetsky, A.1    Nei, M.2
  • 17
    • 0023375195 scopus 로고
    • The neighbor-joining method: A new method for reconstructing phylogenetic trees
    • SAITOU, N., M. NEI, 1987. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4:406-425.
    • (1987) Mol. Biol. Evol , vol.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2

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