Skip to main content

A Fast Genome Sequence Aligner Based on Minimal Perfect Hash Algorithm Realized with FPGA Based Heterogeneous Computing Platform

  • Conference paper
  • First Online:
  • 1327 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 10847))

Abstract

A fast genome sequence aligner is proposed in this paper. The alignment algorithm is based on minimal perfect hash, reducing the memory occupation and improving memory access efficiency. Several strategies and techniques are adopted to improve the speed and accuracy of the aligner. Realized with a field programmable gate array (FPGA) based heterogeneous computing platform, the aligner achieves similar accuracy compared with BWA-MEM while the speed is around 10 times faster than BWA-MEM.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

References

  1. https://emea.illumina.com/content/dam/illumine-marketing/documents/products/datasheets/novaseq-6000-system-specification-sheet-770-2016-025.pdf

  2. Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25, 1754–1760 (2009)

    Article  Google Scholar 

  3. Nelson, C., Townsend, K., Rao, B.S., Jones, P., Zambreno, J.: Shepard: a fast exact match short read aligner. In: Tenth ACM/IEEE International Conference on Formal Methods and Models for Codesign, pp. 91–94 (2012)

    Google Scholar 

  4. Miller, N.A., Farrow, E.G., Gibson, M., Willig, L.K., Twist, G., Yoo, B., Marrs, T., Corder, S., Krivohlavek, L., Walter, A., Petrikin, J.E., Saunders, C.J., Thiffault, I., Soden, S.E., Smith, L.D., Dinwiddie, D.L., Herd, S., Cakici, J.A., Catreux, S., Ruehle, M., Kingsmore, S.F.: A 26-hour system of highly sensitive whole genome sequencing for emergency management of genetic diseases. Genome Med. 7, 100 (2015)

    Article  Google Scholar 

  5. Belazzougui, D., Botelho, F.C., Dietzfelbinger, M.: Hash, displace, and compress. In: Proceedings of the European Symposium on Algorithms, pp. 682–693 (2009)

    Google Scholar 

  6. Hanov, S.: Throw away the keys: easy, minimal perfect hashing (2011). http://stevehanov.ca/blog/index.php?id=119

  7. Jenkins, B.: Spookyhash: a 128-bit noncryptographic hash (2012). http://burtleburtle.net/bob/hash/spooky.html

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian Huang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, K. et al. (2018). A Fast Genome Sequence Aligner Based on Minimal Perfect Hash Algorithm Realized with FPGA Based Heterogeneous Computing Platform. In: Zhang, F., Cai, Z., Skums, P., Zhang, S. (eds) Bioinformatics Research and Applications. ISBRA 2018. Lecture Notes in Computer Science(), vol 10847. Springer, Cham. https://doi.org/10.1007/978-3-319-94968-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94968-0_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94967-3

  • Online ISBN: 978-3-319-94968-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics