CONSENSUS SUPERTREES - THE SYNTHESIS OF ROOTED TREES CONTAINING OVERLAPPING SETS OF LABELED LEAVES

被引：97

作者：

GORDON, AD

机构：

来源：

关键词：

D O I：

10.1007/BF01894195

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：335 / 348

页数：14

共 15 条

[1] CONSENSUS TECHNIQUES AND COMPARISON OF TAXONOMIC TREES [J].

ADAMS, EN .

SYSTEMATIC ZOOLOGY, 1972, 21 (04) :390-397

[2] OPTIMAL-ALGORITHMS FOR COMPARING TREES WITH LABELED LEAVES [J].

DAY, WHE .

[3] OBTAINING COMMON PRUNED TREES [J].

FINDEN, CR ;

GORDON, AD .

[4]

Gordon A. D., 1980, ANAL DONNEES INFORMA, P149

[5]

Harding EF, 1971, ADV APPL PROBAB, V3, P44, DOI DOI 10.2307/1426329

[6] COMPLEXITY OF SOME PROBLEMS ON SUBSEQUENCES AND SUPERSEQUENCES [J].

MAIER, D .

[7] CONSENSUS N-TREES [J].

MARGUSH, T ;

MCMORRIS, FR .

[8]

MCMORRIS FR, 1983, NUMERICAL TAXONOMY, P122

[9] COUNTING DENDROGRAMS - A SURVEY [J].

MURTAGH, F .

[10] FAITHFUL CONSENSUS METHODS FOR N-TREES [J].

NEUMANN, DA .