PROVING PHYLOGENETIC TREES MINIMAL WITH L-CLUSTERING AND SET PARTITIONING

被引：14

作者：

HENDY, MD

FOULDS, LR

PENNY, D

机构：

[1] UNIV CANTERBURY,CHRISTCHURCH,NEW ZEALAND

[2] MASSEY UNIV,DEPT BOT & ZOOL,PALMERSTON NORTH,NEW ZEALAND

来源：

MATHEMATICAL BIOSCIENCES | 1980年 / 51卷 / 1-2期

关键词：

D O I：

10.1016/0025-5564(80)90091-7

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：71 / 88

页数：18

共 11 条

[1]

CHRISTOFIDES N, 1975, GRAPH THEORY ALGORIT, P144

[2]

Dreyfus SE, 1971, NETWORKS, V1, P195

[3] PROBLEM OF DISCOVERING MOST PARSIMONIOUS TREE [J].

FITCH, WM .

AMERICAN NATURALIST, 1977, 111 (978) :223-257

[4] GENERAL-APPROACH TO PROVING THE MINIMALITY OF PHYLOGENETIC TREES ILLUSTRATED BY AN EXAMPLE WITH A SET OF 23 VERTEBRATES [J].

FOULDS, LR ;

PENNY, D ;

HENDY, MD .

JOURNAL OF MOLECULAR EVOLUTION, 1979, 13 (02) :151-166

[5] GRAPH THEORETIC APPROACH TO THE DEVELOPMENT OF MINIMAL PHYLOGENETIC TREES [J].

FOULDS, LR ;

HENDY, MD ;

PENNY, D .

JOURNAL OF MOLECULAR EVOLUTION, 1979, 13 (02) :127-149

[6]

FOULDS LR, 1978, 14TH P ANN C OP RES, P61

[7]

Hakimi S. L., 1971, Networks, V1, P113, DOI 10.1002/net.3230010203

[8]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[9] IDENTIFICATION OF PHYLOGENETIC TREES OF MINIMAL LENGTH [J].

HENDY, MD ;

PENNY, D ;

FOULDS, LR .

JOURNAL OF THEORETICAL BIOLOGY, 1978, 71 (03) :441-452

[10]

Kruskal J.B., 1956, P AM MATH SOC, V7, P3, DOI [10.2307/2033241, DOI 10.1090/S0002-9939-1956-0078686-7, 10.1090/S0002-9939-1956-0078686-7]

← 1 2 →