Memory Efficient Pair-Wise Genome Alignment Algorithm – A Small-Scale Application with Grid Potential

  • Nova Ahmed
  • Yi Pan
  • Art Vandenberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3251)

Abstract

Grid middleware infrastructure is a distributed environment suitable for many, typically large-scale, applications. An improved genome sequence alignment algorithm is presented that significantly reduces sequence matching computation time. Yet, very long sequences can still present computation challenges. A small-scale application is implemented on a shared memory system, on a cluster, and the grid-enabled cluster. Experimental results show comparable performance of the grid-enabled version, with scalability for large sequences. The grid offers application management, enables dynamic specification of parameters, and enables a choice of distributed computation nodes.

Keywords

Grid computing distributed computing computational biology biological sequence alignment 

References

  1. 1.
    Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the Grid: Enabling Scalable Virtual Organizations. International J. Supercomputer Applications 15(3) (2001)Google Scholar
  2. 2.
    Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure. Elsevier, Amsterdam (2004)Google Scholar
  3. 3.
    Foster, I., Kesselman, C., Nick, J.M., Tuecke, S.: The physiology of the grid – An Open Grid Services Architecture for Distributed Systems Integration, Open Grid Service Infrastructure WG, Global Grid Forum, June 22 (2002)Google Scholar
  4. 4.
    Martins, W.S., del Cuvillo, J., Cui, W., Gao, G.: “Whole Genome Alignment using a Multithreaded Parallel Implementation. In: Symposium on Computer Architecture and High Performance Computing, Pirenopolis, Brazil, September 10-12, pp. 1–8 (2001)Google Scholar
  5. 5.
    Martins, W.S., del Cuvillo, J., Useche, F.J., Theobald, K.B., Gao, G.R.: “A Multithreaded Parallel Implementation of a Dynamic Programming Algorithm for Sequence Comparison. In: Pacific Symposium on Biocomputing 2001, Big Island of Hawaii, January 3-7, pp. 311–322 (2001)Google Scholar
  6. 6.
    Ahmed, N., Pan, Y., Vandenberg, A.: Memory Efficient Pair-wise Genome Alignment Algorithm – A Small-Scale Application with Grid Potential. Technical Report, Georgia State University, Atlanta, GA (February 2004)Google Scholar
  7. 7.
    Taylor, W.T.: Multiple sequence alignment by a pair wise alignment. Comp. App. Bio. Sci. 3, 1858–1870 (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Nova Ahmed
    • 1
  • Yi Pan
    • 1
  • Art Vandenberg
    • 1
  1. 1.Georgia State UniversityAtlantaUSA

Personalised recommendations