加速对准短读允许插入间隙在多核集群

Yongjie Yang, Cheng Zhong, Danyang Chen
{"title":"加速对准短读允许插入间隙在多核集群","authors":"Yongjie Yang, Cheng Zhong, Danyang Chen","doi":"10.1109/PDCAT46702.2019.00019","DOIUrl":null,"url":null,"abstract":"The sequence alignment is an important basic work in analyzing large biological data. For the massive short reads alignment problem, based on the dynamic programming approach, divide and conquer principle, and FUSE kernel module, a parallel short-read alignment method allowing the optimal number of inserting gaps depending on species and sequence length is developed on multi-core cluster. The experimental results on real and synthetic data show that the proposed parallel alignment method can achieve good speedup with the same alignment accuracy as the sequential alignment method. Compared with the existing parallel alignment method, the proposed method can remarkably reduce the time of partitioning reference genome and reads files and accelerate the large-scale short-read alignment.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"1 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Accelerating Alignment for Short Reads Allowing Insertion of Gaps on Multi-Core Cluster\",\"authors\":\"Yongjie Yang, Cheng Zhong, Danyang Chen\",\"doi\":\"10.1109/PDCAT46702.2019.00019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The sequence alignment is an important basic work in analyzing large biological data. For the massive short reads alignment problem, based on the dynamic programming approach, divide and conquer principle, and FUSE kernel module, a parallel short-read alignment method allowing the optimal number of inserting gaps depending on species and sequence length is developed on multi-core cluster. The experimental results on real and synthetic data show that the proposed parallel alignment method can achieve good speedup with the same alignment accuracy as the sequential alignment method. Compared with the existing parallel alignment method, the proposed method can remarkably reduce the time of partitioning reference genome and reads files and accelerate the large-scale short-read alignment.\",\"PeriodicalId\":166126,\"journal\":{\"name\":\"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)\",\"volume\":\"1 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT46702.2019.00019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT46702.2019.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

序列比对是分析大型生物数据的重要基础工作。针对大量短读比对问题,基于动态规划方法、分而治之原则和FUSE内核模块,在多核集群上提出了一种基于物种和序列长度的最优插入间隙并行短读比对方法。在真实数据和合成数据上的实验结果表明,所提出的平行对准方法可以在与顺序对准方法相同的对准精度下获得良好的加速效果。与现有的平行比对方法相比,该方法显著减少了参考基因组的划分时间和读取文件的时间,加快了大规模短读比对的速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Accelerating Alignment for Short Reads Allowing Insertion of Gaps on Multi-Core Cluster
The sequence alignment is an important basic work in analyzing large biological data. For the massive short reads alignment problem, based on the dynamic programming approach, divide and conquer principle, and FUSE kernel module, a parallel short-read alignment method allowing the optimal number of inserting gaps depending on species and sequence length is developed on multi-core cluster. The experimental results on real and synthetic data show that the proposed parallel alignment method can achieve good speedup with the same alignment accuracy as the sequential alignment method. Compared with the existing parallel alignment method, the proposed method can remarkably reduce the time of partitioning reference genome and reads files and accelerate the large-scale short-read alignment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信