林隙作为缺失数据处理时的扭曲树和树估计的不一致性--距离校正中模型错误设定的影响
Twisted trees and inconsistency of tree estimation when gaps are treated as missing data -- the impact of model mis-specification in distance corrections
摘要:
如果成对序列的差异可以转换为一组与真实进化距离成比例的距离,则系统发育树或基因树的统计学一致的估计是可能的。Susko et al.(2004)报道了一些关于树估计中不一致形式的惊人广泛结果,如果校正距离与真实距离不成比例,则可能出现这种不一致。他们表明,如果校正的距离是真实距离的凹函数,则会出现由于长分支吸引而导致的不一致。如果这些函数是凸的,那么两棵“长枝排斥”树将优先于真树--尽管这两棵不正确的树预计将被捆绑为优先的真树。在这里,我们扩展他们的结果,并证明存在一个树的形状(我们称之为一个“扭曲的Farris区”树),其中一个单一的不正确的树拓扑将保证是首选的,如果校正的距离函数是凸的。我们还报告说,标准的做法,治疗的差距序列比对缺失的数据是足够的,以产生非线性校正的距离函数,如果取代过程是不独立的插入/删除过程。两者合计,这些结果意味着不一致的树推理在温和的条件下。例如,如果序列中的一些位置被限制为没有取代和插入/缺失事件,而其余位点以独立的取代和插入/缺失事件进化,则通过将空位视为缺失数据而获得的距离可以支持不正确的树拓扑,即使给定无限量的数据。
英文摘要:
Statistically consistent estimation of phylogenetic trees or gene trees is possible if pairwise sequence dissimilarities can be converted to a set of distances that are proportional to the true evolutionary distances. Susko et al. (2004) reported some strikingly broad results about the forms of inconsistency in tree estimation that can arise if corrected distances are not proportional to the true distances. They showed that if the corrected distance is a concave function of the true distance, then inconsistency due to long branch attraction will occur. If these functions are convex, then two "long branch repulsion" trees will be preferred over the true tree -- though these two incorrect trees are expected to be tied as the preferred true. Here we extend their results, and demonstrate the existence of a tree shape (which we refer to as a "twisted Farris-zone" tree) for which a single incorrect tree topology will be guaranteed to be preferred if the corrected distance function is convex. We also report that the standard practice of treating gaps in sequence alignments as missing data is sufficient to produce non-linear corrected distance functions if the substitution process is not independent of the insertion/deletion process. Taken together, these results imply inconsistent tree inference under mild conditions. For example, if some positions in a sequence are constrained to be free of substitutions and insertion/deletion events while the remaining sites evolve with independent substitutions and insertion/deletion events, then the distances obtained by treating gaps as missing data can support an incorrect tree topology even given an unlimited amount of data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。