首页> 外文期刊>IEEE/ACM transactions on computational biology and bioinformatics >Asymptotic Properties of the Number of Matching Coalescent Histories for Caterpillar-Like Families of Species Trees
【24h】

Asymptotic Properties of the Number of Matching Coalescent Histories for Caterpillar-Like Families of Species Trees

机译:类树毛虫家族的结合历史记录数的渐近性质

获取原文
获取原文并翻译 | 示例
           

摘要

Coalescent histories provide lists of species tree branches on which gene tree coalescences can take place, and their enumerative properties assist in understanding the computational complexity of calculations central in the study of gene trees and species trees. Here, we solve an enumerative problem left open by Rosenberg (IEEE/ACM Transactions on Computational Biology and Bioinformatics 10: 1253-1262, 2013) concerning the number of coalescent histories for gene trees and species trees with a matching labeled topology that belongs to a generic caterpillar-like family. By bringing a generating function approach to the study of coalescent histories, we prove that for any caterpillar-like family with seed tree t , the sequence (hn)n≥0 describing the number of matching coalescent histories of the n th tree of the family grows asymptotically as a constant multiple of the Catalan numbers. Thus, hn∼βtcn , where the asymptotic constant βt>0 depends on the shape of the seed tree t . The result extends a claim demonstrated only for seed trees with at most eight taxa to arbitrary seed trees, expanding the set of cases for which detailed enumerative properties of coalescent histories can be determined. We introduce a procedure that computes from t the constant βt as well as the algebraic expression for the generating function of the sequence (hn)n≥0 .
机译:合并历史记录提供了可以在其上进行基因树合并的物种树分支的列表,它们的枚举属性有助于理解对基因树和物种树进行研究的核心计算方法。在这里,我们解决了Rosenberg(IEEE / ACM Transactions on Computational Biology and Bioinformatics 10:1253-1262,2013)遗留下来的枚举问题,该问题涉及具有匹配标记拓扑的基因树和物种树的合并历史数量。毛毛虫般的家族。通过将生成函数方法用于合并历史的研究,我们证明了对于任何具有种子树t的毛虫状家庭,序列(hn)n≥0描述了该家庭的第n棵树的匹配合并历史数作为加泰罗尼亚数字的恒定倍数渐近地增长。因此,hn〜βtcn,其中渐近常数βt> 0取决于种子树t的形状。结果将仅针对最多具有八个分类单元的种子树证明的主张扩展到任意种子树,从而扩大了可以确定合并历史的详细枚举特性的案例集。我们介绍了一个从t计算常数βt以及序列(hn)n≥0的生成函数的代数表达式的过程。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号