UdeAlignC: Fast Alignment for the Compression of DNA Reads

Jaime Lotero, Andrés Benavides, Aníbal Guerra, S. Isaza
{"title":"UdeAlignC: Fast Alignment for the Compression of DNA Reads","authors":"Jaime Lotero, Andrés Benavides, Aníbal Guerra, S. Isaza","doi":"10.1109/COLCOMCON.2018.8466336","DOIUrl":null,"url":null,"abstract":"Referential compression algorithms are one of the main strategies to cope with the exponential growth of DNA data available to scientists. One of the techniques used to build a referential compression is sequence alignment, which in turn requires a lot of computing. In this article we present UdeAlignC, a fast alignment algorithm for the compression of DNA reads. We demonstrate that our algorithm is 2× faster than prominent state of the art tools while optimality is only reduced by 5.6%. We also implement a GPU-accelerated version and show local speedups of up to 12×. Source code available at https://bitbucket.org/BioMRcomp/udealignc","PeriodicalId":151973,"journal":{"name":"2018 IEEE Colombian Conference on Communications and Computing (COLCOM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Colombian Conference on Communications and Computing (COLCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COLCOMCON.2018.8466336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Referential compression algorithms are one of the main strategies to cope with the exponential growth of DNA data available to scientists. One of the techniques used to build a referential compression is sequence alignment, which in turn requires a lot of computing. In this article we present UdeAlignC, a fast alignment algorithm for the compression of DNA reads. We demonstrate that our algorithm is 2× faster than prominent state of the art tools while optimality is only reduced by 5.6%. We also implement a GPU-accelerated version and show local speedups of up to 12×. Source code available at https://bitbucket.org/BioMRcomp/udealignc
UdeAlignC: DNA读取压缩的快速比对
参考压缩算法是应对DNA数据呈指数增长的主要策略之一。用于构建引用压缩的技术之一是序列对齐,这反过来又需要大量的计算。在本文中,我们介绍了UdeAlignC,一种用于压缩DNA读取的快速对齐算法。我们证明,我们的算法比最先进的工具快2倍,而最优性仅降低了5.6%。我们还实现了gpu加速版本,并显示了高达12倍的本地速度。源代码可从https://bitbucket.org/BioMRcomp/udealignc获得
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信