串行与多进程应用的系统发育追踪算法分析
Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
AI总结:
本文针对数字进化模拟中的谱系追踪问题,分别提出串行场景下基于引用计数的灭绝谱系剪枝和分布式场景下基于 trie 的遗传地层学重建方法,以提升速度、准确性与内存效率。
摘要:
自现代生物信息学问世以来,从生物序列重建系统发育历史这一具有挑战性且多面性的问题,持续催生了统计学和算法方面的创新。对数字化、基于智能体的进化模型进行系统发育动力学研究,引出了一个特殊的逆向问题:如何最佳地设计追踪机制,以实现快速、准确且内存高效的谱系重建?在此,我们形式化描述了串行和分布式计算场景下的系统发育分析流程。对于前者,我们展示了基于引用计数的灭绝谱系剪枝方法。对于后者,我们提出了一种基于 trie 的系统发育重建方法,用于“遗传地层学”基因组注释。该过程通过比较基因组之间的相似性来推断其系统发育关系,类似于从生物 DNA 序列重建自然历史。系统发育分析能力显著提升了基于智能体的分布式模拟作为进化研究工具的价值,也使面向应用的进化计算受益。此类追踪还可扩展到其他通过复制增殖的数字产物,例如数字媒体和计算机病毒。
英文摘要:
Since the advent of modern bioinformatics, the challenging, multifaceted problem of reconstructing phylogenetic history from biological sequences has hatched perennial statistical and algorithmic innovation. Studies of the phylogenetic dynamics of digital, agent-based evolutionary models motivate a peculiar converse question: how to best engineer tracking to facilitate fast, accurate, and memory-efficient lineage reconstructions? Here, we formally describe procedures for phylogenetic analysis in both serial and distributed computing scenarios. With respect to the former, we demonstrate reference-counting-based pruning of extinct lineages. For the latter, we introduce a trie-based phylogenetic reconstruction approach for "hereditary stratigraphy" genome annotations. This process allows phylogenetic relationships between genomes to be inferred by comparing their similarities, akin to reconstruction of natural history from biological DNA sequences. Phylogenetic analysis capabilities significantly advance distributed agent-based simulations as a tool for evolutionary research, and also benefit application-oriented evolutionary computing. Such tracing could extend also to other digital artifacts that proliferate through replication, like digital media and computer viruses.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。