Applying SIMD Approach to Whole Genome Comparison on Commodity Hardware

1. Hughey, R.: Parallel hardware for sequence comparison and alignment. Computer Applications in the Biosciences 12(6), 473–479 (1996)

   Google Scholar 

2. Yamaguchi, Y., Maruyama, T., Konagaya, A.: High Speed Homology Search with FPGAs. In: Pacific Symposium on Biocomputing, pp. 271–282 (2002)

   Google Scholar 

3. http://www.timelogic.com

4. Brutlag, D.L., Dautricourt, J.P., Diaz, R., Fier, J., Moxon, B., Stamm, R.: BLAZE: An implementation of the Smith-Waterman Comparison Algorithm on a Massively Parallel Computer. Computers and Chemistry 17, 203–207 (1993)

   Article  MATH  Google Scholar 

5. Wozniak, A.: Using video-oriented instructions to speed up sequence comparison. Computer Applications in the Biosciences 13(2), 145–150 (1997)

   Google Scholar 

6. Rognes, T., Seeberg, E.: Six-fold speed-up of Smith Waterman sequence database searches using parallel processing on common microprocessors. Bioinformatics 16(8), 669–706

   Google Scholar 

7. Strumpen, V.: Parallel molecular sequence analysis on workstations in the Internet. Technical report, Department of Computer Science, University of Zurich (1993)

   Google Scholar 

8. Martins, W.S., del Cuvillo, J.B., Useche, F.J., Theobald, K.B., Gao, G.R.: A multithreaded parallel implementation of a dynamic programming algorithm for sequence comparison. In: Proceedings of the Pacific Symposium on Biocomputing, pp. 311–322 (2001)

   Google Scholar 

9. Needleman, S.B., Wunsch, C.D.: 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)

   Article  Google Scholar 

10. Sellers, P.H.: On the theory and computation of evolutionary distances. SIAM J. of Applied Mathematics 26, 787–793 (1974)

    Article  MathSciNet  Google Scholar 

11. Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. of Molecular Biology 147(1), 195–197 (1981)

    Article  Google Scholar 

12. Gotoh, O.: An improved algorithm for matching biological sequences. Journal of Molecular Biology 162(3), 705–708 (1982)

    Article  Google Scholar 

13. Myers, E.W., Miller, W.: Optimal alignments in linear space. Computer Applications in the Biosciences 4(1), 11–17 (1988)

    Google Scholar 

14. Aho, A.V., Hirschberg, D.S., Ullman, J.D.: Bounds on the complexity of the longest common subsequence problem. J. of the ACM 23(1), 1–12 (1976)

    Article  MATH  MathSciNet  Google Scholar 

15. Lee, R.B.: Multimedia extensions for general-purpose processors. In: Proceedings IEEE Workshop on Signal Processing Systems, pp. 9–23 (1997)

    Google Scholar 

16. Peleg, A., Wilkie, S., Weiser, U.: Intel MMX for multimedia PCs. Communications of the ACM 40(1), 25–38 (1997)

    Article  Google Scholar 

17. Berkeley Drosophila Genome Project (2003), http://www.fruitfly.org/sequence/sequence_db/na_wholegenome_CDS_dmel_RELEASE3.FASTA.gz

18. http://www.phrap.org/phredphrap/swat.html

19. Di Blas, A., Dahle, D.M., Diekhans, M., Grate, L., Hirschberg, J.D., Karplus, K., Keller, H., Kendrick, M., Mesa-Martinez, F.J., Pease, D., Rice, E., Schultz, A., Speck, D., Hughey, R.: The UCSC Kestrel Parallel Processor. IEEE Transactions on Parallel and Distributed Systems 16(1), 80–92 (2005)

    Article  Google Scholar 

Download references