Whole genome comparison on a network of workstations

Sixth International Symposium on Parallel and Distributed Computing, ISPDC 2007

Volumn , Issue , 2007, Pages

  Jacob, Arpith ^a   Sanyal, Sugata ^b   Paprzycki, Marcin ^c   Arora, Rajan ^d   Ganzha, Maria ^e  

^a VIT UNIVERSITY   (India)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^c SWPS UNIVERSITY OF SOCIAL SCIENCES AND HUMANITIES   (Poland)

^d INDIAN INSTITUTE OF INFORMATION TECHNOLOGY   (India)

^e Elblag University of Humanities and Economy   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; PROGRAM PROCESSORS;

GENOME COMPARING; INTEL PROCESSORS; SMITH-WATERMAN ALGORITHM;

GENES;

EID: 35348872556     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2007.58     Document Type: Conference Paper

References (17)

1. A. Jacob, M. Paprzycki, S. Sanyal, Whole Genome Comparison using Commodity Hardware, Technical Report, http://www.tifr.res.in/~sanyal/papers/ techreport_2007_l.pdf, submitted
2. R. Hughey, "Parallel hardware for sequence comparison and alignment," Computer Applications in the Biosciences, 12(6): 473-479, 1996
3. V. Strumpen, "Parallel molecular sequence analysis on workstations in the Internet," Technical report, Department of computer science, University of Zurich, 1993
4. W. S. Martins, J. B. del Cuvillo, F. J. Useche, K. B. Theobald, G. R. Gao, "A multithreaded parallel implementation of a dynamic programming algorithm for sequence comparison," In Proc. of the Pacific Symposium on Biocomputing, 311-322, 2001
5. S. B. Needleman, C. D. Wunsch, "A general method applicable to the search for similarities in the amino acid sequence of two sequences," J. of Molecular Biology, 48(3): 443-453, 1970
6. P. H. Sellers, "On the theory and computation of evolutionary distances," SIAM J. of Applied Mathematics, 26: 787-793, 1974
7. T. F. Smith, M. S. Waterman, "Identification of common molecular subsequences," J. of Molecular Biology, 147(1): 195-197, 1981
8. O. Gotoh, "An improved algorithm for matching biological sequences," J. of Molecular Biology, 162(3): 705-708, 1982
9. E. W. Myers, W. Miller, "Optimal alignments in linear space," Comp. App. in the Biosciences, 4(1): 11-17, 1988
10. A. V. Aho, D.S. Hirschberg, J. D. Ullman, "Bounds on the complexity of the longest common subsequence problem," J. of the ACM, 23(1): 1-12, 1976
11. R. B. Lee, "Multimedia extensions for general-purpose processors," Proc. IEEE Workshop on Signal Processing Systems, 9-23, 1997
12. A. Peleg, S. Wilkie, U. Weiser, "Intel MMX for multimedia PCs," CACM, 40(1):25-38, 1997
13. Berkeley Drosophila Genome Project, 2003. Available: http://www.fruitfly. org/
14. T. K. Yap, O. Frieder, R. L. Martino, "Parallel computation in biological sequence analysis," IEEE Trans. on Para, and Dist. Syst., 9(3):283-293, 1998
15. Mithral cssdk, 2003. Available: http://www.mithral.com/projects/cosm/
16. Libcurl, 2003. Available:http://curl.sf.net/
17. A. Di Blas, D. M. Dahle, M. Diekhans, L. Grate, J. D. Hirschberg, K. Karplus, H. Keller, M. Kendrick, F. J. Mesa-Martinez, D. Pease, E. Rice, A. Schultz, D. Speck, R. Hughey, "The UCSC Kestrel Parallel Processor," IEEE Trans. on Para, and Dist. Syst., 16(1): 80-92, 2005