当前BLAST软件在核苷酸序列上的比较。

I Elizabeth Cha, Eric C Rouchka
{"title":"当前BLAST软件在核苷酸序列上的比较。","authors":"I Elizabeth Cha, Eric C Rouchka","doi":"10.1109/IPDPS.2005.145","DOIUrl":null,"url":null,"abstract":"<p><p>The computational power needed for searching exponentially growing databases, such as GenBank, has increased dramatically. Three different implementations of the most widely used sequence alignment tool, known as BLAST (Basic Local Alignment Search Tool), are studied for their efficiency on nucleotide-nucleotide comparisons. The performance of these implementations are evaluated using target databases and query sequences of varying lengths and number of entries constructed from human genomic and EST sequences. In general, WU BLAST was found to be most efficient when the database and query composition are unknown. NCBI BLAST appears to work best when the database contains a small number of sequences, while mpiBLAST shows the power of database distribution when the number of bases per target database is large. The optimal number of compute nodes in mpiBLAST varies depending upon the database, yet in the cases studied, remains surprisingly low.</p>","PeriodicalId":89233,"journal":{"name":"Proceedings. IPDPS (Conference)","volume":"19 ","pages":"8"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3021256/pdf/nihms137493.pdf","citationCount":"0","resultStr":"{\"title\":\"Comparison of Current BLAST Software on Nucleotide Sequences.\",\"authors\":\"I Elizabeth Cha, Eric C Rouchka\",\"doi\":\"10.1109/IPDPS.2005.145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>The computational power needed for searching exponentially growing databases, such as GenBank, has increased dramatically. Three different implementations of the most widely used sequence alignment tool, known as BLAST (Basic Local Alignment Search Tool), are studied for their efficiency on nucleotide-nucleotide comparisons. The performance of these implementations are evaluated using target databases and query sequences of varying lengths and number of entries constructed from human genomic and EST sequences. In general, WU BLAST was found to be most efficient when the database and query composition are unknown. NCBI BLAST appears to work best when the database contains a small number of sequences, while mpiBLAST shows the power of database distribution when the number of bases per target database is large. The optimal number of compute nodes in mpiBLAST varies depending upon the database, yet in the cases studied, remains surprisingly low.</p>\",\"PeriodicalId\":89233,\"journal\":{\"name\":\"Proceedings. IPDPS (Conference)\",\"volume\":\"19 \",\"pages\":\"8\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3021256/pdf/nihms137493.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IPDPS (Conference)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPDPS.2005.145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IPDPS (Conference)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPS.2005.145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

搜索指数增长的数据库(如GenBank)所需的计算能力已经急剧增加。三种不同的实现最广泛使用的序列比对工具,称为BLAST(基本局部比对搜索工具),研究其效率的核苷酸-核苷酸比较。使用目标数据库和查询序列来评估这些实现的性能,这些查询序列由人类基因组和EST序列构建,具有不同的长度和条目数量。一般来说,当数据库和查询组成未知时,WU BLAST是最有效的。当数据库包含少量序列时,NCBI BLAST表现出最好的效果,而当每个目标数据库包含大量碱基时,mpiBLAST显示出数据库分布的能力。mpiBLAST中计算节点的最佳数量因数据库而异,但在所研究的案例中,其数量仍然低得惊人。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparison of Current BLAST Software on Nucleotide Sequences.

The computational power needed for searching exponentially growing databases, such as GenBank, has increased dramatically. Three different implementations of the most widely used sequence alignment tool, known as BLAST (Basic Local Alignment Search Tool), are studied for their efficiency on nucleotide-nucleotide comparisons. The performance of these implementations are evaluated using target databases and query sequences of varying lengths and number of entries constructed from human genomic and EST sequences. In general, WU BLAST was found to be most efficient when the database and query composition are unknown. NCBI BLAST appears to work best when the database contains a small number of sequences, while mpiBLAST shows the power of database distribution when the number of bases per target database is large. The optimal number of compute nodes in mpiBLAST varies depending upon the database, yet in the cases studied, remains surprisingly low.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信