Parallel Sequence Alignment: A Lookahead Approach

  • Prasanta K. Jana
  • Nikesh Kumar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3776)

Abstract

In this paper we present a parallel algorithm for local alignment of two biological sequences. Given two sequences of size m and n, our algorithm uses a novel technique namely, carry lookahead and requires O(m / 4 + n / 2) time on a maximum of O(m) processors.

Keywords

Parallel Algorithm Local Alignment Biological Sequence Global Alignment Alignment Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Huang, X.: A space efficient parallel sequence comparison algorithm for mes-sage-passing multiprocessors. International J. of Parallel Programming. 18, 223–239 (1989)CrossRefGoogle Scholar
  2. 2.
    Lander, E., Mesirov, J., Taylor, W.: Protein sequence comparison on a data parallel com-puter. In: Proceedings of the 1988 International Conference on Parallel Processing, pp. 257–263 (1988)Google Scholar
  3. 3.
    Aluru, S., Futamura, N., Mehrotra, K.: Parallel biological sequence comparison using pre-fix computations. J. of Parallel and Distributed Computing 63, 264–272 (2003)MATHCrossRefGoogle Scholar
  4. 4.
    Edmiston, E., Core, N., Saltz, J., Smith, R.: Parallel processing of biological sequence comparison algorithms. International J. of Parallel Programming 17, 259–275 (1988)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. of Molecular Biology 147, 195–197 (1981)CrossRefGoogle Scholar
  6. 6.
    Gusfield, D.: Algorithms on Strings Trees and Sequences. Cambridge University Press, Cambridge (1997)MATHCrossRefGoogle Scholar
  7. 7.
    Bokhari, S.H., Saurer, J.R.: Sequence alignment on the Cray MTA-2. In: Proceedings of Second IEEE International Workshop on High Performance Computational Biology, Nice, France, April 22 (2003)Google Scholar
  8. 8.
    Schmidt, B., Schroder, H., Schimmler, M.: Massively Parallel Solutions for Molecular Se-quence Analysis. In: Proceedings of 1st International workshop on High Performance Computational Biology (2002)Google Scholar
  9. 9.
    Martins, W.S., del Cuvillo, J., Cui, W., Gao, G.: Whole genome alignment using a multi-threaded parallel implementation. In: Proceedings of Symposium on Computer Architecture and High Performance Computing, Pirenopolis, Brazil, pp. 1–8 (2001)Google Scholar
  10. 10.
    Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM 24, 664–675 (1977)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Prasanta K. Jana
    • 1
  • Nikesh Kumar
    • 1
  1. 1.Department of Computer Science and EngineeringIndian School of MinesDhanbadIndia

Personalised recommendations