THE COMPUTATIONAL-COMPLEXITY OF INFERRING ROOTED PHYLOGENIES BY PARSIMONY

被引:95
作者
DAY, WHE
JOHNSON, DS
SANKOFF, D
机构
[1] UNIV MONTREAL,CTR RECH MATH,MONTREAL H3C 3J7,QUEBEC,CANADA
[2] AT&T BELL LABS,MURRAY HILL,NJ 07974
关键词
D O I
10.1016/0025-5564(86)90161-6
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
引用
收藏
页码:33 / 42
页数:10
相关论文
共 22 条
[1]   A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY [J].
CAMIN, JH ;
SOKAL, RR .
EVOLUTION, 1965, 19 (03) :311-326
[3]  
DAY WHE, 1986, UNPUB SYST ZOOL, V35
[4]  
DAY WHE, 1986, CRM1366 U MONTR CTR
[5]  
Farris J.S., 1983, Advances in Cladistics, V2, P7
[6]   PHYLOGENETIC ANALYSIS UNDER DOLLOS LAW [J].
FARRIS, JS .
SYSTEMATIC ZOOLOGY, 1977, 26 (01) :77-88
[7]   METHODS FOR COMPUTING WAGNER TREES [J].
FARRIS, JS .
SYSTEMATIC ZOOLOGY, 1970, 19 (01) :83-&
[8]   FURTHER COMMENTS ON LE QUESNES METHODS [J].
FARRIS, JS .
SYSTEMATIC ZOOLOGY, 1977, 26 (02) :220-223
[9]   INFERRING PHYLOGENETIC TREES FROM CHROMOSOME INVERSION DATA [J].
FARRIS, JS .
SYSTEMATIC ZOOLOGY, 1978, 27 (03) :275-284
[10]   PARSIMONY IN SYSTEMATICS - BIOLOGICAL AND STATISTICAL ISSUES [J].
FELSENSTEIN, J .
ANNUAL REVIEW OF ECOLOGY AND SYSTEMATICS, 1983, 14 :313-333