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

HTML  XML Download Download as PDF (Size: 425KB)  PP. 47-51  
DOI: 10.4236/jbpc.2013.42006    4,634 Downloads   6,748 Views  Citations

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.

Share and Cite:

Zafalon, G. , Marucci, E. , Momente, J. , Amazonas, J. , Sato, L. and Machado, J. (2013) Improvements in the score matrix calculation method using parallel score estimating algorithm. Journal of Biophysical Chemistry, 4, 47-51. doi: 10.4236/jbpc.2013.42006.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.