Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
复制标题
DOI：
10.1093/sysbio/20.4.406
复制
发表时间：
1971-12
影响因子：
6.5
通讯作者：
W. Fitch
中科院分区：
文献类型：
--
作者：
W. Fitch
惠誉，W。M.（部门）生理化学，威斯康星州大学，麦迪逊，威斯康星州，53706），1971。朝向定义进化的过程：特定树形拓扑的最小变化。Zool系统，20：406-416.-提出了一种方法，该方法被断言为提供所有假设的祖先特征状态，这些状态与使用所表示的分类群之间的预定系统发育关系在最小数量的状态变化中描述当今特征状态的下降相一致。作为例子使用的特征状态是编码蛋白质氨基酸序列的四个信使RNA核苷酸，但该方法是通用的。【进化;吝啬的树木。】试图从生物学特征的信息中推断系统发育关系的人的目标是找到祖先关系，从而允许人们以需要最少数量的进化步骤或变化的方式来解释这些特征的起源。这一结果可以被称为最简约的进化树，并可能与真正的进化树高度一致（Camin和索卡尔，1965年）。它的理由在于最有效地利用现有的信息，并不预先假定进化遵循最吝啬的过程。除了检查几乎所有可能的树的强力方法之外，还没有已知的算法可以找到最简约的树。“这对于涉及十几个或更多分类单位的树木来说是不切实际的。大多数数值分类程序（索卡尔和Synthia，1963; Farris，1969，1970; Fitch和Margoliash，1967）提供的树状图属于较为简约的解决方案;人们不能确定不存在更为简约的树结构。Farris（1969）最近发表了一个关于这个问题的一个优雅的开始，他开发了一种方法，估计各种字符的可靠性，然后根据这种可靠性对字符进行加权。他的方法与本方法一样，其根源在于瓦格纳树（瓦格纳，
Fitch, W. M. (Dept. of Physiological Chemistry, Univ. of Wisconsin, Madison, Wisconsin, 53706), 1971. Toward defining the course of evolution: minimum change for a specific tree topology. Syst. Zool., 20:406-416.-A method is presented that is asserted to provide all hypothetical ancestral character states that are consistent with describing the descent of the present-day character states in a minimum number of changes of state using a predetermined phylogenetic relationship among the taxa represented. The character states used as examples are the four messenger RNA nucleotides encoding the amino acid sequences of proteins, but the method is general. [Evolution; parsimonious trees.] It has been a goal of those attempting to deduce phylogenetic relationships from information on biological characteristics to find the ancestral relationship(s) that would permit one to account for the descent of those characteristics in a manner requiring a minimum number of evolutionary steps or changes. The result could be called the most parsimonious evolutionary tree and might be expected to have a high degree of correspondence to the true phylogeny (Camin and Sokal, 1965). It's justification lies in the most efficient use of the information available and does not presuppose that evolution follows a most parsimonious course. There are no known algorithms for finding the most parsimonious tree(s) apart from the brute force method of examining nearly every possible tree.' This is impractical for trees involving a dozen or more taxonomic units. Most numerical taxonomic procedures (Sokal and Sneath, 1963; Farris, 1969, 1970; Fitch and Margoliash, 1967) provide dendrograms that would be among the more parsimonious solutions; one just cannot be sure that a more parsimonious tree structure does not exist. Farris (1970) has explicitly considered the parsimony principle as a part of 'An elegant beginning to an attack on the problem has recently been published by Farris (1969) who developed a method which estimates the reliability of various characters and then weights the characters on the basis of that reliability. his method which, like the present method, has its roots in the Wagner tree (Wagner,