Cicherski Adam, Lisiecka Anna, Dojer Norbert
Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland.
Algorithms Mol Biol. 2025 May 15;20(1):7. doi: 10.1186/s13015-025-00277-7.
The success of pangenome-based approaches to genomics analysis depends largely on the existence of efficient methods for constructing pangenome graphs that are applicable to large genome collections. In the current paper we present AlfaPang, a new pangenome graph building algorithm. AlfaPang is based on a novel alignment-free approach that allows to construct pangenome graphs using significantly less computational resources than state-of-the-art tools. The code of AlfaPang is freely available at https://github.com/AdamCicherski/AlfaPang .
基于泛基因组的基因组学分析方法的成功在很大程度上取决于是否存在适用于大型基因组集合的高效构建泛基因组图谱的方法。在本文中，我们展示了AlfaPang，一种新的泛基因组图谱构建算法。AlfaPang基于一种新颖的无比对方法，该方法允许使用比现有工具少得多的计算资源来构建泛基因组图谱。AlfaPang的代码可在https://github.com/AdamCicherski/AlfaPang上免费获取。
