Genalign -一个用于对齐压缩DNA序列的高性能实现

D. Satyanvesh, Kaliuday Balleda, P. K. Baruah, S. Sai
{"title":"Genalign -一个用于对齐压缩DNA序列的高性能实现","authors":"D. Satyanvesh, Kaliuday Balleda, P. K. Baruah, S. Sai","doi":"10.1109/ICACT.2013.6710490","DOIUrl":null,"url":null,"abstract":"In molecular biology, sequence alignment is a way of arranging DNA, RNA or protein sequences to identify regions of similarity between the sequences. However, this is a challenging problem since the DNA sequences are huge in size and the databases are growing at an exponential rate. It requires tremendous amount of memory and large computational power. For example, the human genome in raw format ranges from 2 to 30 Tera-bytes. The inherent property of DNA is that it contains many repeats which makes it highly compressible. This paper presents a new approach of aligning the sequences after compressing them. The alignment consists of both ungapped and gapped alignment. Multi-cores and GPUs can be used to align these huge sequences quickly on the compressed sequences. The focus mainly is on aligning the huge sequences accurately. The ungapped alignment achieves a speedup of upto 56 on K20 Kepler GPUs and the gapped alignment achieves a speedup of upto 15 on multi-cores.","PeriodicalId":302640,"journal":{"name":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Genalign — A high performance implementation for aligning the compressed DNA sequences\",\"authors\":\"D. Satyanvesh, Kaliuday Balleda, P. K. Baruah, S. Sai\",\"doi\":\"10.1109/ICACT.2013.6710490\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In molecular biology, sequence alignment is a way of arranging DNA, RNA or protein sequences to identify regions of similarity between the sequences. However, this is a challenging problem since the DNA sequences are huge in size and the databases are growing at an exponential rate. It requires tremendous amount of memory and large computational power. For example, the human genome in raw format ranges from 2 to 30 Tera-bytes. The inherent property of DNA is that it contains many repeats which makes it highly compressible. This paper presents a new approach of aligning the sequences after compressing them. The alignment consists of both ungapped and gapped alignment. Multi-cores and GPUs can be used to align these huge sequences quickly on the compressed sequences. The focus mainly is on aligning the huge sequences accurately. The ungapped alignment achieves a speedup of upto 56 on K20 Kepler GPUs and the gapped alignment achieves a speedup of upto 15 on multi-cores.\",\"PeriodicalId\":302640,\"journal\":{\"name\":\"2013 15th International Conference on Advanced Computing Technologies (ICACT)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 15th International Conference on Advanced Computing Technologies (ICACT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACT.2013.6710490\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 15th International Conference on Advanced Computing Technologies (ICACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACT.2013.6710490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在分子生物学中,序列比对是一种排列DNA、RNA或蛋白质序列以确定序列之间相似区域的方法。然而,这是一个具有挑战性的问题,因为DNA序列规模巨大,数据库正以指数速度增长。它需要大量的内存和强大的计算能力。例如,原始格式的人类基因组在2到30万亿字节之间。DNA的固有特性是它含有许多重复序列,这使它具有高度可压缩性。本文提出了一种压缩序列后对齐的新方法。对准包括未间隙对准和间隙对准。多核和gpu可以在压缩序列上快速对齐这些巨大的序列。重点主要是精确地对齐巨大的序列。未间隙对齐在K20 Kepler gpu上实现了高达56的加速,而间隙对齐在多核上实现了高达15的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Genalign — A high performance implementation for aligning the compressed DNA sequences
In molecular biology, sequence alignment is a way of arranging DNA, RNA or protein sequences to identify regions of similarity between the sequences. However, this is a challenging problem since the DNA sequences are huge in size and the databases are growing at an exponential rate. It requires tremendous amount of memory and large computational power. For example, the human genome in raw format ranges from 2 to 30 Tera-bytes. The inherent property of DNA is that it contains many repeats which makes it highly compressible. This paper presents a new approach of aligning the sequences after compressing them. The alignment consists of both ungapped and gapped alignment. Multi-cores and GPUs can be used to align these huge sequences quickly on the compressed sequences. The focus mainly is on aligning the huge sequences accurately. The ungapped alignment achieves a speedup of upto 56 on K20 Kepler GPUs and the gapped alignment achieves a speedup of upto 15 on multi-cores.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信