arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.12697cs.DS
收藏

用于系统发育分析的高效算法库

Library of efficient algorithms for phylogenetic analysis

Luana Silva

摘要:

物种之间的进化关系通常通过系统发育分析来推断,系统发育分析提供了通过对序列的特定区域进行测序并将其抽象为分类索引而建立的等位基因谱计算的系统发育树。随着人员和商品交流的增加,流行病变得越来越重要,结合特定国家数据集的信息现在可以揭示未知的传播模式。系统发育分析流程主要由距离计算、距离修正、推理算法和局部优化四个连续步骤组成。有许多系统发育工具,但是大多数只实现其中的一些步骤,并且只服务于一个单一的目的,例如一种类型的算法。另一个问题是它们通常很难使用和集成,因为它们都有自己的API。该项目产生了一个实现工作流四个步骤的库,具有高性能、可扩展、可重用和可移植性,同时提供了通用API和文档。它与其他工具的不同之处还在于,它能够在用户需要时停止和恢复工作流,并且它被构建为不断扩展,而不仅仅是服务于单一目的。在该库上进行的时间基准测试表明,其算法的实现符合其理论时间复杂度。同时,内存基准测试表明,NJ算法的实现遵循线性内存复杂度,而MST和GCP算法的实现遵循二次内存复杂度。

英文摘要:

Evolutionary relationships between species are usually inferred through phylogenetic analysis, which provides phylogenetic trees computed from allelic profiles built by sequencing specific regions of the sequences and abstracting them to categorical indexes. With growing exchanges of people and merchandise, epidemics have become increasingly important, and combining information of country-specific datasets can now reveal unknown spreading patterns. The phylogenetic analysis workflow is mainly composed of four consecutive steps, the distance calculation, distance correction, inference algorithm, and local optimization steps. There are many phylogenetic tools out there, however most implement only some of these steps and serve only one single purpose, such as one type of algorithm. Another problem with these is that they are often hard to use and integrate, since each of them has its own API. This project resulted a library that implements the four steps of the workflow, and is highly performant, extensible, reusable, and portable, while providing common APIs and documentation. It also differs from other tools in the sense that, it is able to stop and resume the workflow whenever the user desires, and it was built to be continuously extended and not just serve a single purpose. The time benchmarks conducted on this library show that its implementations of the algorithms conform to their theoretical time complexity. Meanwhile, the memory benchmarks showcase that the implementations of the NJ algorithms follow a linear memory complexity, while the implementations of the MST and GCP algorithms follow a quadratic memory complexity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑