Abstract
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.
This work was partially supported by NSERC, Canada Foundation for Innovation and Canada Research Chair Programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Setubal, J.C., Meidanis, J.: Introduction to Computational Molecular Biology. Brooks/Cole Publishing Company (1997)
Smith, T.F., Waterman, M.S.: Identification of common molecular sub-sequences. Journal of Molecular Biology, 195–197 (1981)
Altschul, S.F., et al.: Gapped blast and psi-blast: a new generation of protein database search programs. Nucleic Acids Research 25, 3389–3402 (1997)
Pearson, W.R., Lipman, D.L.: Improved tools for biological sequence comparison. In: Proc. National Academy Of Science, pp. 2444–2448. NAS (1988)
Martins, W.S., Del Cuvillo, J.B., Useche, F.J., Theobald, K.B., Gao, G.R.: A multithread parallel implementation of a dynamic programming algorithm for sequence comparison. In: Symp. on Computer Architecture and HPC (SBAC-PAD), pp. 1–8 (2001)
group, D.: Smith waterman homology search (2003)
Co., D.: Decypher smith waterman solution (2003)
Boukerche, A., Melo, A.C.M.A., Walter, M.E.M.T., Melo, R.C.F., Santana, M.N.P., Batista, R.B.: Performance evaluation of a local dna sequence alignment algorithm on a cluster of workstations. In: Proc. of the Int. Parallel and Distributed Processing Symposium (IPDPS 2004). IEEE Society, Los Alamitos (2004)
Batista, R.B., Silva, D.N., Melo, A.C.M.A., Weigang, L.: Using a dsm application to locally align dna sequences. In: Proc. of the IEEE/ACM Int. Symp. on Cluster Computing and the Grid. IEEE Computer Society Press, Los Alamitos (2004)
Pfister, G.: Search of Clusters - The Coming Battle for Lowly Parallel Computing. Prentice-Hall, Englewood Cliffs (1995)
Melo, R., Walter, M.E.T., Melo, A.C.M.A., Batista, R.B.: Comparing two long dna sequences using a dsm system. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 517–524. Springer, Heidelberg (2003)
Mosberger, D.: Memory consistency models. Operating Systems Review, 18–26 (1993)
Hu, S., Shi, W., Tang, Z.: Jiajia: An svm system based on a new cache coherence protocol. In: High Performance Computing and Networking (HPCN), pp. 463–472. Springer, Heidelberg (1999)
Hirschberg, D.S.: Alagorithms for the longest common sequence problem. Journal of the ACM 24, 664–675 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boukerche, A., de Melo, A.C.M.A., Ayala-Rincon, M., Santana, T.M. (2005). Parallel Smith-Waterman Algorithm for Local DNA Comparison in a Cluster of Workstations. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_40
Download citation
DOI: https://doi.org/10.1007/11427186_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)