Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 294))

  • 1126 Accesses

Abstract

Multiple sequence alignment (MSA), used in biocomputing to study similarities between different genomic sequences, is known to require important memory and computation resources. Determining the efficient amount of resources to allocate is important to avoid waste of them, thus reducing the economical costs required in running for example a specific cloud instance. The pairwise alignment is the initial key step of the MSA problem, which will compute all pair alignments needed. We present a method to determine the optimal amount of memory and computation resources to allocate by the pairwise alignment, and we will validate it through a set of experimental results for different possible inputs. These allow us to determine the best parameters to configure the applications in order to use effectively the available resources of a given system.

This work was supported by the MEyC-Spain under contract TIN 2011-28689-C02-02 and Consolider CSD2007-0050. The CUR of DIUE of GENCAT and the European Social Fund.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Montañola, A., Roig, C., Hernández, P.: Pairwise Sequence Alignment Method for Distributed Shared Memory Systems. In: 21st Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP), pp. 432–436 (2013)

    Google Scholar 

  2. Edgar, R.C., Batzoglou, S.: Multiple sequence alignment. Current Opinion in Structural Biology 16(3), 368–373 (2006), http://dx.doi.org/10.1016/j.sbi.2006.04.004 ISSN 0959-440X

  3. Daugelaite, J., O’ Driscoll, A., Sleator, R.D.: An Overview of Multiple Sequence Alignments and Cloud Computing in Bioinformatics. ISRN Biomathematics 2013, Article ID 615630, 14 pages (2013)

    Google Scholar 

  4. Notredame, C., Higgins, D.G., Heringa, J.: T-Coffee: A novel method for fast and accurate multiple sequence alignment. J. Mol. Biol. 302(1), 205–217 (2000), PMID: 10964570 (PubMed - indexed for MEDLINE)

    Google Scholar 

  5. Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. Journal of Molecular Biology 147, 195–197 (1981), doi:10.1016/0022-2836(81)90087-5

    Article  Google Scholar 

  6. Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48(3), 443–453 (1970), doi:10.1016/0022-2836(70)90057-4; PMID 5420325

    Google Scholar 

  7. Larkin, M.A., Blackshields, G., Brown, N.P., Chenna, R., McGettigan, P.A., McWillian, H., Valentin, F., Wallace, I.M., Wilm, A., Lopez, R., Thompson, J.D., Gibson, T.J., Higgins, D.G.: ClustalW and ClustalX version 2. Bioinformatics 23(21), 2947–2948 (2007)

    Article  Google Scholar 

  8. Edgar, R.C.: MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research 32(5), 1792–1797 (2004)

    Article  Google Scholar 

  9. Zola, J., Yang, X., Rospondek, S., Aluru, S.: Parallel T-Coffee: A Parallel Multiple Sequence Aligner. In: Proc. of ISCA PDCS-2007, pp. 248–253 (2007)

    Google Scholar 

  10. Li, K.B.: ClustalW-MPI: ClustalW analysis using distributed and parallel computing. Bioinformatics 19, 1585–1586 (2003)

    Article  Google Scholar 

  11. Farrar, M.: Striped Smith-Waterman speeds database searches six times over other SIMD implementations. Bioinformatics 23(2), 156–161 (2007), doi:10.1093/bioinformatics; first published online (November 16, 2006)

    Google Scholar 

  12. Liu, Y., Maskell, D.L., Schmidt, B.: CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units. BMC Research Notes 2, 73 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alberto Montañola .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Montañola, A., Roig, C., Hernández, P. (2014). Optimizing Multiple Pairwise Alignment of Genomic Sequences in Multicore Clusters. In: Saez-Rodriguez, J., Rocha, M., Fdez-Riverola, F., De Paz Santana, J. (eds) 8th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2014). Advances in Intelligent Systems and Computing, vol 294. Springer, Cham. https://doi.org/10.1007/978-3-319-07581-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07581-5_15

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07580-8

  • Online ISBN: 978-3-319-07581-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics