COMPUTATIONAL-COMPLEXITY OF INFERRING PHYLOGENIES FROM CHROMOSOME INVERSION DATA

被引：11

作者：

DAY, WHE ^{[1
]}

SANKOFF, D ^{[1
]}

机构：

[1] UNIV MONTREAL,CTR RECH MATH,MONTREAL H3C 3J7,QUEBEC,CANADA

来源：

JOURNAL OF THEORETICAL BIOLOGY | 1987年 / 124卷 / 02期

关键词：

D O I：

10.1016/S0022-5193(87)80263-1

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：213 / 218

页数：6

共 10 条

[1] COMPUTATIONALLY DIFFICULT PARSIMONY PROBLEMS IN PHYLOGENETIC SYSTEMATICS [J].

DAY, WHE .

JOURNAL OF THEORETICAL BIOLOGY, 1983, 103 (03) :429-438

[2] THE COMPUTATIONAL-COMPLEXITY OF INFERRING ROOTED PHYLOGENIES BY PARSIMONY [J].

DAY, WHE ;

JOHNSON, DS ;

SANKOFF, D .

MATHEMATICAL BIOSCIENCES, 1986, 81 (01) :33-42

[3] WHEN ARE 2 QUALITATIVE TAXONOMIC CHARACTERS COMPATIBLE [J].

ESTABROOK, GF ;

MCMORRIS, FR .

JOURNAL OF MATHEMATICAL BIOLOGY, 1977, 4 (02) :195-200

[4] WHEN IS ONE ESTIMATE OF EVOLUTIONARY RELATIONSHIPS A REFINEMENT OF ANOTHER [J].

ESTABROOK, GF ;

MCMORRIS, FR .

JOURNAL OF MATHEMATICAL BIOLOGY, 1980, 10 (04) :367-373

[5] INFERRING PHYLOGENETIC TREES FROM CHROMOSOME INVERSION DATA [J].

FARRIS, JS .

SYSTEMATIC ZOOLOGY, 1978, 27 (03) :275-284

[6] ALTERNATIVE METHODS OF PHYLOGENETIC INFERENCE AND THEIR INTERRELATIONSHIP [J].

FELSENSTEIN, J .

SYSTEMATIC ZOOLOGY, 1979, 28 (01) :49-62

[7]

FOULDS LR, 1982, ADV APPL MATH, V3, P43, DOI DOI 10.1016/S0196-8858(82)80004-3

[8]

Garey MR., 1979, COMPUTERS INTRACTABI

[9] UNLIKELIHOOD THAT MINIMAL PHYLOGENIES FOR A REALISTIC BIOLOGICAL STUDY CAN BE CONSTRUCTED IN REASONABLE COMPUTATIONAL TIME [J].

GRAHAM, RL ;

FOULDS, LR .

MATHEMATICAL BIOSCIENCES, 1982, 60 (02) :133-142

[10]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.1201/9780429493768

← 1 →