Improvements in the score matrix calculation method using parallel score estimating algorithm

G. F. D. Zafalon, E. A. Marucci, J. C. Momente, J. Amazonas, L. Sato, J. M. Machado
{"title":"Improvements in the score matrix calculation method using parallel score estimating algorithm","authors":"G. F. D. Zafalon, E. A. Marucci, J. C. Momente, J. Amazonas, L. Sato, J. M. Machado","doi":"10.4236/JBPC.2013.42006","DOIUrl":null,"url":null,"abstract":"The \nincreasing amount of sequences stored in genomic databases has become unfeasible \nto the sequential analysis. Then, the parallel computing brought its power to \nthe Bioinformatics through parallel algorithms to align and analyze the \nsequences, providing improvements mainly in the running time of these \nalgorithms. In many situations, the parallel strategy contributes to reducing \nthe computational complexity of the big problems. This work shows some results \nobtained by an implementation of a parallel score estimating technique for \nthe score matrix calculation stage, which is the first stage of a progressive \nmultiple sequence alignment. The performance and quality of the parallel \nscore estimating are compared with the results of a dynamic programming \napproach also implemented in parallel. This comparison shows a significant reduction \nof running time. Moreover, the quality of the \nfinal alignment, using the new strategy, is analyzed and compared with \nthe quality of the approach with dynamic programming.","PeriodicalId":62927,"journal":{"name":"生物物理化学(英文)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"生物物理化学(英文)","FirstCategoryId":"1089","ListUrlMain":"https://doi.org/10.4236/JBPC.2013.42006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The increasing amount of sequences stored in genomic databases has become unfeasible to the sequential analysis. Then, the parallel computing brought its power to the Bioinformatics through parallel algorithms to align and analyze the sequences, providing improvements mainly in the running time of these algorithms. In many situations, the parallel strategy contributes to reducing the computational complexity of the big problems. This work shows some results obtained by an implementation of a parallel score estimating technique for the score matrix calculation stage, which is the first stage of a progressive multiple sequence alignment. The performance and quality of the parallel score estimating are compared with the results of a dynamic programming approach also implemented in parallel. This comparison shows a significant reduction of running time. Moreover, the quality of the final alignment, using the new strategy, is analyzed and compared with the quality of the approach with dynamic programming.
改进了基于并行分数估计算法的分数矩阵计算方法
基因组数据库中存储的序列数量不断增加,使序列分析变得不可行。然后,并行计算通过并行算法将其能力引入生物信息学,对序列进行对齐和分析,主要在这些算法的运行时间上提供改进。在许多情况下,并行策略有助于降低大问题的计算复杂度。这项工作展示了通过在分数矩阵计算阶段实现并行分数估计技术获得的一些结果,这是渐进多序列比对的第一阶段。将该方法的性能和质量与同样并行实现的动态规划方法的结果进行了比较。这个比较显示了运行时间的显著减少。此外,还对采用新策略的最终对齐质量进行了分析,并与采用动态规划方法的对齐质量进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
144
×
引用
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学术官方微信