Parallezation Protein Sequence Similarity Algorithms using Remote Method Interface

Authors: Mubarak Saif Mohsen, Zurinahni Zainol, Rosalina Abdul Salam, Wahidah Husain

Abstract:

One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computationally intensive task. Sequence comparison is the basic step for all algorithms in protein sequences similarity. Parallel computing is an attractive solution to provide the computational power needed to speedup the lengthy process of the sequence comparison. Our main research is to enhance the protein sequence algorithm using dynamic programming method. In our approach, we parallelize the dynamic programming algorithm using multithreaded program to perform the sequence comparison and also developed a distributed protein database among many PCs using Remote Method Interface (RMI). As a result, we showed how different sizes of protein sequences data and computation of scoring matrix of these protein sequence on different number of processors affected the processing time and speed, as oppose to sequential processing.

Keywords: Protein sequence algorithm, dynamic programming algorithm, multithread

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1329703

References:

[1] T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. J. Mol. Biol., 147:195-197, 1981.
[2] S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol., 48:444-453, 1970.
[3] Pearson, W.R., Wood, T., Zhang, Z. and Miller, W. Comparison of DNA sequences with protein sequences. Genomics, 1997
[4] William R. Pearson, Protein sequence comparison and protein evolution, University of Virginia, Charlotesville, VA 22908, USA, 2000
[5] Pearson, W. R. & Lipman, D. J. Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA. 1988.
[6] Hobohm, U. and Sander, C. A sequence property approach to searching protein databases. 1995.
[7] Gibbs, A.J. and McIntyre, G.A. The diagram, a method for comparing sequences. Its use with amino acid and nucleotide sequences. Eur. J. Biochem, 16, 1-11.1970.
[8] Pearson, W.R. Rapid and sensitive sequence comparison with FASTP and FASTA. Methods Enzymol, 183:63-98, 63-98.1990.
[9] Sellers P.H. On the theory and computation of evolutionary distances. SIAM J.Appl. Math, 26, 787-793. 1974.
[10] Goad, W.B. and Kanehisa, M.I. Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetries. Nucleic Acids. Res., 10, 247-263.1982.Waterman, M.S., Smith, T.F. and Beyer, W.A. Some biological sequence metrics. Adv. Appl. Math, 20, 367-387. 1976.
[11] Waterman, M.S., Smith, T.F. and Beyer, W.A. Some biological sequence metrics. Adv. Appl. Math, 20, 367-387. 1976.
[12] Gotoh, O. An improved algorithm for matching biological sequences. J. Mol. Biol., 162, 705-708. 1982.
[13] http://www.sbc.su.se/~per/molbioinfo2001/dynprog/dynamic.html.