Biological sequence comparison is one of the most important and basic problems in computational biology. Due to its high demands for computational power and memory, it is a very challenging task. Most of sequence comparison methods used are based on heuristics, which are faster but there are no guarantees that the best alignments will be produced. On the other hand, the algorithm proposed by Smith-Waterman obtains the best local alignments at the expense of very high computing power and huge memory requirements. In this article, we present and evaluate our experiments with three parallel strategies to run the Smith-Waterman algorithm in a cluster of workstations using a Distributed Shared Memory System. Our results on an eight-machine cluster presented very good speedups and indicate that impressive improvements can be achieved, depending on the strategy used. Also, we present some theoretical remarks on how to reduce the amount of memory used. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Boukerche, A., Alves De Melo, A. C. M., Ayala-Rincon, M., & Santana, T. M. (2005). Parallel Smith-Waterman algorithm for local DNA comparison in a cluster of workstations. In Lecture Notes in Computer Science (Vol. 3503, pp. 464–475). Springer Verlag. https://doi.org/10.1007/11427186_40
Mendeley helps you to discover research relevant for your work.