0028-825X933103-0239 $2.500 The Royal Society of New Zealand 1993 Constructing phylogeneti.pdf

下载文档

3
0
约3.93万字
约 9页
2017-04-13 发布于江苏
举报
版权申诉
保障服务

0028-825X933103-0239 $2.500 The Royal Society of New Zealand 1993 Constructing phylogeneti.pdf

1、本文档共9页，可阅读全部内容。
2、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

0028-825X933103-0239 $2.500 The Royal Society of New Zealand 1993 Constructing phylogeneti

New Zealand Journal of Botany, 1993, Vol. 31: 239-248 0028-825X/93/3103-0239 $2.50/0 ? The Royal Society of New Zealand 1993 239 Constructing phylogenetic trees efficiently using compatibility criteria TANDY J. WARNOW Sandia National Laboratories P.O. Box 5800 Albuquerque, NM 87185, U.S.A.* ?Present address: Department of Computer and Information Sciences, University of Pennsylvania, 200 S 33rd Street, Moore 276, Philadelphia, PA 19104, U.S.A. Abstract The Character Compatibility Problem is a classical problem in computational biology concerned with constructing phylogenetic trees of minimum possible evolution from qualitative character sets. This problem arose in the 1970s, and until recently the only cases for which efficient algorithms were found were for binary (i.e. two- state) characters and for two characters at a time, while the complexity of the general problem remained open. In this paper we will discuss the remarkable progress on this problem since 1990. Keywords evolution; algorithms; phylogenetic tree; INTRODUCTION The Character Compatibility Problem is a classical problem in computational biology, which seeks to construct a phylogenetic tree of minimum possible evolution for an input species set, described by qualitative characters. Such a phylogeny is said to be perfect, and thus the problem of whether such a phylogeny exists is called both the Perfect Phylogeny Problem and the Character Compatibility Problem. We begin with the section Basic concepts from computer science. In this section we will define what we mean by the complexity of an algorithm or B93007 Received 19 January 1993; accepted 8 June 1993 problem, so that the meaning of efficient is clear, and the consequences of saying that a problem is NP-hard is also understood. We continue by defining the Character Compatibilty Problem in the section The Character Compatibility Problem, and describe the history of the problem in the section History of the Character Compatibility Problem. We discus