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

通过学习型索引实现动态 De Bruijn 图

Implementation Of Dynamic De Bruijn Graphs Via Learned Index

Riccardo Nigrelli

AI总结:

本文利用学习型索引设计动态 De Bruijn 图,以支持节点和边的增删;相比 DynamicBOSS 与 dynamicDBG,其在大规模 k-mer 数据上的插入时间和内存效率更优。

摘要:

De Bruijn 图对测序数据分析至关重要,在大规模人群研究中必须被高效构建和存储。它们还需要具备动态性,以支持添加或删除边和节点等更新。现有的动态实现包括 DynamicBOSS 和 dynamicDBG。2018 年,Tim Kraska 和 Alex Beutel 提出了一类称为学习型索引的新数据结构;Paolo Ferragina 和 Giorgio Vinciguerra 于 2020 年提出了一种尤其高效的实现。本文提出了一种使用学习型索引实现 De Bruijn 图的新方法,并将其性能与当前实现进行比较。新方法在边和节点插入方面表现出更高的时间和内存效率,尤其是在大型数据集(超过 1.1 亿个 k-mers)上。

英文摘要:

De Bruijn graphs are essential for sequencing data analysis and must be efficiently constructed and stored for large-scale population studies. They also need to be dynamic to allow updates such as adding or removing edges and nodes. Existing dynamic implementations include DynamicBOSS and dynamicDBG. In 2018, a new family of data structures called learned indexes was introduced by Tim Kraska and Alex Beutel, with a particularly efficient implementation proposed by Paolo Ferragina and Giorgio Vinciguerra in 2020. This paper presents a new method for implementing De Bruijn graphs using learned indexes and compares its performance with current implementations. The new method shows improved time and memory efficiency for edge and node insertions, particularly with large datasets (over 110 million k-mers).

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

↑