用简约法定义二元系统发育树

Pub Date : 2022-12-17 DOI:10.1007/s00026-022-00627-x
Mareike Fischer
{"title":"用简约法定义二元系统发育树","authors":"Mareike Fischer","doi":"10.1007/s00026-022-00627-x","DOIUrl":null,"url":null,"abstract":"<div><p>Phylogenetic (i.e., leaf-labeled) trees play a fundamental role in evolutionary research. A typical problem is to reconstruct such trees from data like DNA alignments (whose columns are often referred to as characters), and a simple optimization criterion for such reconstructions is maximum parsimony. It is generally assumed that this criterion works well for data in which state changes are rare. In the present manuscript, we prove that each binary phylogenetic tree <i>T</i> with <span>\\(n\\ge 20 k\\)</span> leaves is uniquely defined by the set <span>\\(A_k(T)\\)</span>, which consists of all characters with parsimony score <i>k</i> on <i>T</i>. This can be considered as a promising first step toward showing that maximum parsimony as a tree reconstruction criterion is justified when the number of changes in the data is relatively small.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-022-00627-x.pdf","citationCount":"1","resultStr":"{\"title\":\"Defining Binary Phylogenetic Trees Using Parsimony\",\"authors\":\"Mareike Fischer\",\"doi\":\"10.1007/s00026-022-00627-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Phylogenetic (i.e., leaf-labeled) trees play a fundamental role in evolutionary research. A typical problem is to reconstruct such trees from data like DNA alignments (whose columns are often referred to as characters), and a simple optimization criterion for such reconstructions is maximum parsimony. It is generally assumed that this criterion works well for data in which state changes are rare. In the present manuscript, we prove that each binary phylogenetic tree <i>T</i> with <span>\\\\(n\\\\ge 20 k\\\\)</span> leaves is uniquely defined by the set <span>\\\\(A_k(T)\\\\)</span>, which consists of all characters with parsimony score <i>k</i> on <i>T</i>. This can be considered as a promising first step toward showing that maximum parsimony as a tree reconstruction criterion is justified when the number of changes in the data is relatively small.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2022-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00026-022-00627-x.pdf\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-022-00627-x\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-022-00627-x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

系统发育(即叶标)树在进化研究中发挥着重要作用。一个典型的问题是从DNA比对(其列通常被称为特征)等数据重建这样的树,而这种重建的一个简单优化标准是最大简约性。通常认为,该标准适用于状态变化很少的数据。在本文中,我们证明了每一个叶数为20的二元系统发育树T都是由集(A_k(T))唯一定义的,该集由T上简约分数为k的所有特征组成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Defining Binary Phylogenetic Trees Using Parsimony

分享
查看原文
Defining Binary Phylogenetic Trees Using Parsimony

Phylogenetic (i.e., leaf-labeled) trees play a fundamental role in evolutionary research. A typical problem is to reconstruct such trees from data like DNA alignments (whose columns are often referred to as characters), and a simple optimization criterion for such reconstructions is maximum parsimony. It is generally assumed that this criterion works well for data in which state changes are rare. In the present manuscript, we prove that each binary phylogenetic tree T with \(n\ge 20 k\) leaves is uniquely defined by the set \(A_k(T)\), which consists of all characters with parsimony score k on T. This can be considered as a promising first step toward showing that maximum parsimony as a tree reconstruction criterion is justified when the number of changes in the data is relatively small.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信