[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Exploiting Multi-grain Parallelism for Efficient Selective Sweep Detection

  • Conference paper
Algorithms and Architectures for Parallel Processing (ICA3PP 2012)

Abstract

Selective sweep detection localizes targets of recent and strong positive selection by analyzing single nucleotide polymorphisms (SNPs) in intra-species multiple sequence alignments. Substantial advances in wet-lab sequencing technologies currently allow for generating unprecedented amounts of molecular data. The increasing number of sequences and number of SNPs in such large multiple sequence alignments cause prohibiting long execution times for population genetics data analyses that rely on selective sweep theory. To alleviate this problem, we have recently implemented fine- and coarse-grain parallel versions of our open-source tool OmegaPlus for selective sweep detection that is based on the ω statistic. A performance issue with the coarse-grain parallelization is that individual coarse-grain tasks exhibit significant run-time differences, and hence cause load imbalance. Here, we introduce a significantly improved multi-grain parallelization scheme which outperforms both the fine-grain as well as the coarse-grain versions of OmegaPlus with respect to parallel efficiency. The multi-grain approach exploits both coarse-grain and fine-grain operations by using available threads/cores that have completed their coarse-grain tasks to accelerate the slowest task by means of fine-grain parallelism. A performance assessment on real-world and simulated datasets showed that the multi-grain version is up to 39% and 64.4% faster than the coarse-grain and the fine-grain versions, respectively, when the same number of threads is used.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. Maynard Smith, J., Haigh, J.: The hitch-hiking effect of a favourable gene. Genet. Res. 23(1), 23–35 (1974)

    Article  Google Scholar 

  2. Kim, Y., Nielsen, R.: Linkage disequilibrium as a signature of selective sweeps. Genetics 167(3), 1513–1524 (2004)

    Article  Google Scholar 

  3. Jensen, J.D., Thornton, K.R., Bustamante, C.D., Aquadro, C.F.: On the utility of linkage disequilibrium as a statistic for identifying targets of positive selection in nonequilibrium populations. Genetics 176(4), 2371–2379 (2007)

    Article  Google Scholar 

  4. Pavlidis, P., Jensen, J.D., Stephan, W.: Searching for footprints of positive selection in whole-genome snp data from nonequilibrium populations. Genetics 185(3), 907–922 (2010)

    Article  Google Scholar 

  5. Berger, S.A., Stamatakis, A.: Assessment of barrier implementations for fine-grain parallel regions on current multi-core architectures. In: Proc. IEEE Int Cluster Computing Workshops and Posters (CLUSTER WORKSHOPS) Conf., pp. 1–8 (2010)

    Google Scholar 

  6. Stamatakis, A., Komornik, Z., Berger, S.A.: Evolutionary placement of short sequence reads on multi-core architectures. In: Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 2010), pp. 1–8. IEEE Computer Society Press, Washington (2010)

    Chapter  Google Scholar 

  7. Blagojevic, F., Nikolopoulos, D.S., Stamatakis, A., Antonopoulos, C.D.: Dynamic multigrain parallelization on the cell broadband engine. In: Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP 2007, pp. 90–100. ACM, New York (2007)

    Chapter  Google Scholar 

  8. Kimura, M.: The number of heterozygous nucleotide sites maintained in a nite population due to steady ux of mutations. Genetics 61(4), 893–903 (1969)

    Google Scholar 

  9. Hudson, R.R.: Generating samples under a wright-fisher neutral model of genetic variation. Bioinformatics 18(2), 337–338 (2002)

    Article  Google Scholar 

  10. Gillespie, J.H.: Population genetics: a concise guide. Johns Hopkins Univ. Pr. (2004)

    Google Scholar 

  11. Haddrill, P.R., Thornton, K.R., Charlesworth, B., Andolfatto, P.: Multilocus patterns of nucleotide variability and the demographic and selection history of drosophila melanogaster populations. Genome Res. 15(6), 790–799 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alachiotis, N., Pavlidis, P., Stamatakis, A. (2012). Exploiting Multi-grain Parallelism for Efficient Selective Sweep Detection. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2012. Lecture Notes in Computer Science, vol 7439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33078-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33078-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33077-3

  • Online ISBN: 978-3-642-33078-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics