Parallel performance evaluation of multithreaded local sequence alignment

Bioniformatics is area, demanding knowledge and skills for acquisition, storing, management, analysis, interpretation and dissemination of biological information. This scientific area requires powerful computing resources for exploring large sets of biological data. Biological sequence processing is a key for molecular biology. Smith-Waterman algorithm, based on dynamic programming has become the most fundamental in bioinformatics. The goal of this paper is to investigate the efficiency of parallel multithreaded implementation based on Smith-Waterman algorithm. Performance parameters have been estimated by the experiments using various data sets on two parallel computer platforms.

[1]  Christus,et al.  A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 2022 .

[2]  Azzedine Boukerche,et al.  Parallel Strategies for Local Biological Sequence Alignment in a Cluster of Workstations , 2005, IPDPS.

[3]  Albert Y. Zomaya.  Parallel Computing for Bioinformatics and Computational Biology , 2005 .

[4]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[5]  Azzedine Boukerche,et al.  An exact parallel algorithm to compare very long biological sequences in clusters of workstations , 2007, Cluster Computing.

[6]  Enrique Alba,et al.  Parallel evolutionary algorithms can achieve super-linear performance , 2002, Inf. Process. Lett..

[7]  Michael Farrar,et al.  Sequence analysis Striped Smith – Waterman speeds database searches six times over other SIMD implementations , 2007 .

[8]  Azzedine Boukerche,et al.  Parallel strategies for local biological sequence alignment in a cluster of workstations , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[9]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[10]  Fa Zhang,et al.  A parallel Smith-Waterman algorithm based on divide and conquer , 2002, Fifth International Conference on Algorithms and Architectures for Parallel Processing, 2002. Proceedings..

[11]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.