使用级联Bloom过滤器提高de Brujin图的内存使用率
Using cascading Bloom filters to improve the memory usage for de Brujin graphs
摘要:
De Brujin图广泛用于生物信息学中处理下一代测序数据。由于NGS数据集的规模非常大,因此有必要表示de Bruijn图,最近已经提出了几种解决这个问题的方法。在这项工作中,我们展示了如何减少[3]中使用Bloom过滤器表示de Brujin图的算法所需的内存。与[3]的方法相比,我们的方法需要的内存减少了30%到40%,对构建时间的影响微不足道。与此同时,我们的实验显示了比[3]更好的查询时间。据我们所知,这是de Bruijn图的最佳实用表示。
英文摘要:
De Brujin graphs are widely used in bioinformatics for processing next-generation sequencing data. Due to a very large size of NGS datasets, it is essential to represent de Bruijn graphs compactly, and several approaches to this problem have been proposed recently. In this work, we show how to reduce the memory required by the algorithm of [3] that represents de Brujin graphs using Bloom filters. Our method requires 30% to 40% less memory with respect to the method of [3], with insignificant impact to construction time. At the same time, our experiments showed a better query time compared to [3]. This is, to our knowledge, the best practical representation for de Bruijn graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。