Efficient algorithms for inferring evolutionary trees
作者:
Dan Gusfield,
期刊:
Networks
(WILEY Available online 1991)
卷期:
Volume 21,
issue 1
页码: 19-28
ISSN:0028-3045
年代: 1991
DOI:10.1002/net.3230210104
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractIn this paper, we examine two related problems of inferring the evolutionary history ofnobjects, either from present characters of the objects or from several partial estimates of their evolutionary history. The first problem is called thePhylogenyproblem, and second is theTree Compatibilityproblem. Both of these problems are central in algorithmic approaches to the study of evolution and in other problems of historical reconstruction. In this paper, we show that both of these problems can be solved by graph theoretic methods in linear time, which is time optimal, and which is a significant improvement over existing methods.
点击下载:
PDF
(546KB)
返 回