Performance extraction and suitability analysis of multi- and many-core architectures for next generation sequencing secondary analysis

D. R. Bentley, S. Balasubramanian, H. P. Swerdlow, G. P. Smith, J. Milton, C. G. Brown, K. P. Hall, D. J. Evers, C. L. Barnes, H. R. Bignell, J. M. Boutell, J. Bryant, R. J. Carter, R. K. Cheetham, A. J. Cox, D. J. Ellis, M. R. Flatbush, N. A. Gormley, S. J. Humphray, L. J. Irving, M. S. Karbelashvili, S. M. Kirk, H. Li, X. Liu, K. S. Maisinger, L. J. Murray, B. Obradovic, T. Ost, M. L. Parkinson, M. R. Pratt, I. M. Rasolonjatovo, M. T. Reed, R. Rigatti, C. Rodighiero, M. T. Ross, A. Sabot, S. V. Sankar, A. Scally, G. P. Schroth, M. E. Smith, V. P. Smith, A. Spiridou, P. E. Torrance, S. S. Tzonev, E. H. Vermaas, K. Walter, X. Wu, L. Zhang, M. D. Alam, C. Anastasi, I. C. Aniebo, D. M. Bailey, I. R. Bancarz, S. Banerjee, S. G. Barbour, P. A. Baybayan, V. A. Benoit, K. F. Benson, C. Bevis, P. J. Black, A. Boodhun, J. S. Brennan, J. A. Bridgham, R. C. Brown, A. A. Brown, D. H. Buermann, A. A. Bundu, J. C. Burrows, N. P. Carter, N. Castillo, M. C. E. Catenazzi, S. Chang, R. N. Cooley, N. R. Crake, O. O. Dada, K. D. Diakoumakos, B. Dominguez-Fernandez, D. J. Earnshaw, U. C. Egbujor, D. W. Elmore, S. S. Etchin, M. R. Ewan, M. Fedurco, L. J. Fraser, K. V. F. Fajardo, W. S. Furey, D. George, K. J. Gietzen, C. P. Goddard, G. S. Golda, P. A. Granieri, D. E. Green, D. L. Gustafson, N. F. Hansen, K. Harnish, C. D. Haudenschild, N. I. Heyer, M. M. Hims, J. T. Ho, A. M. Horgan, K. Hoschler, S. Hurwitz, D. V. Ivanov, M. Q. Johnson, T. James, T. A. H. Jones, G. D. Kang, T. H. Kerelska, A. D. Kersey, I. Khrebtukova, A. P. Kindwall, Z. Kingsbury, P. I. Kokko-Gonzales, A. Kumar, M. A. Laurent, C. T. Lawley, S. E. Lee, X. Lee, A. K. Liao, J. A. Loch, M. Lok, S. Luo, R. M. Mammen, J. W. Martin, P. G. McCauley, P. McNitt, P. Mehta, K. W. Moon, J. W. Mullens, T. Newington, Z. Ning, B. L. Ng, S. M. Novo, M. J. O'Neill, M. A. Osborne, A. Osnowski, O. Ostadan, L. L. Paraschos, L. Pickering, A. C. Pike, A. C. Pike, D. C. Pinkard, D. P. Pliskin, J. Podhasky, V. J. Quijano, C. Raczy, V. H. Rae, S. R. Rawlings, A. C. Rodriguez, P. M. Roe, J. Rogers, M. C. R. Bacigalupo, N. Romanov, A. Romieu, R. K. Roth, N. J. Rourke, S. T. Ruediger, E. Rusman, R. M. Sanches-Kuiper, M. R. Schenker, J. M. Seoane, R. J. Shaw, M. K. Shiver, S. W. Short, N. L. Sizto, J. P. Sluis, M. A. Smith, J. E. S. Sohna, E. J. Spence, K. Stevens, N. Sutton, L. Szajkowski, C. L. Tregidgo, G. Turcatti, S. Vandevondele, Y. Verhovsky, S. M. Virk, S. Wakelin, G. C. Walcott, J. Wang, G. J. Worsley, J. Yan, L. Yau, M. Zuerlein, J. Rogers, J. C. Mullikin, M. E. Hurles, N. J. McCooke, J. S. West, F. L. Oaks, P. L. Lundberg, D. Klenerman, R. Durbin, and A. J. Smith. Accurate whole human genome sequencing using reversible terminator chemistry. nature, 456(7218): 53--59, 2008.

Illumina. HiSeqX™ Series of Sequencing Systems. URL https://www.illumina.com/documents/products/datasheets/datasheet-hiseq-x-ten.pdf.

Zachary D Stephens, Skylar Y Lee, Faraz Faghri, Roy H Campbell, Chengxiang Zhai, Miles J Efron, Ravishankar Iyer, Michael C Schatz, Saurabh Sinha, and Gene E Robinson. Big data: astronomical or genomical? PLoS Biol, 13(7):e1002195, 2015.

Md Vasimuddin, Sanchit Misra, and Srinivas Aluru. Identification of significant computational building blocks through comprehensive investigation of NGS secondary analysis methods. {Preprint} bioRXiv, April 2018.

T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195--197, 1981.

R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, 1998.

Paolo Ferragina and Giovanni Manzini. Opportunistic data structures with applications. In Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on, pages 390--398. IEEE, 2000.

Guillaume Marçais and Carl Kingsford. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics, 27(6):764--770, 2011.

Heng Li, Jue Ruan, and Richard Durbin. Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome research, 18(11): 1851--1858, 2008.

Ruiqiang Li, Yingrui Li, Karsten Kristiansen, and Jun Wang. SOAP: short oligonucleotide alignment program. Bioinformatics, 24(5):713--714, 2008.

Ruiqiang Li, Chang Yu, Yingrui Li, Tak-Wah Lam, Siu-Ming Yiu, Karsten Kristiansen, and Jun Wang. SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, 25(15):1966--1967, 2009.

Ben Langmead, Cole Trapnell, Mihai Pop, and Steven L Salzberg. Ultrafast and memory-efficient alignment of short dna sequences to the human genome. Genome biology, 10(3):1, 2009.

Ben Langmead and Steven L Salzberg. Fast gapped-read alignment with Bowtie 2. Nature methods, 9(4):357--359, 2012.

Heng Li and Richard Durbin. Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25(14):1754--1760, 2009.

Heng Li. Aligning sequence reads, clone sequences and assembly contigs with bwa-mem. arXiv:1303.3997v1 {q-bio.GN}, 2009.

M. A. DePristo, E. Banks, R. E. Poplin, K. V. Garimella, J. R. Maguire, C. Hartl, A. A. Philippakis, G. del Angel, M. A. Rivas, M. Hanna, A. McKenna, T. J. Fennell, A. M. Kernytsky, A. Y. Sivachenko, K. Cibulskis, S. B. Gabriel, D. Altshuler, and M. J. Daly. A framework for variation discovery and genotyping using next-generation DNA sequencing data. Nat Genet, 43(5):491--498, 2011.

Broad Institute: GATK best practices. URL https://software.broadinstitute.org/gatk/best-practices.

A. Wozniak. Using video-oriented instructions to speed up sequence comparison. Bioinformatics, 13(2):145--150, 1997.

Torbjørn Rognes and Erling Seeberg. Six-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors. Bioinformatics, 16:699--706, 09 2000.

Michael Farrar. Striped Smith-Waterman speeds database searches six times over other simd implementations. Bioinformatics, 23(2):156--161, 2007. URL +http://dx.doi.org/10.1093/bioinformatics/btl582.

Isaac TS Li, Warren Shum, and Kevin Truong. 160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (fpga). BMC Bioinformatics, 8(1):185, Jun 2007. ISSN 1471-2105. URL

Adam Szalkowski, Christian Ledergerber, Philipp Krähenbühl, and Christophe Dessimoz. SWPS3 - fast multi-threaded vectorized Smith-Waterman for ibm cell/b.e. and x86/sse2. BMC Research Notes, 1(1):107, Oct 2008. ISSN 1756-0500. URL

Witold R Rudnicki, Aleksander Jankowski, Aleksander Modzelewski, Aleksander Piotrowski, and Adam Zadrożny. The new simd implementation of the Smith-Waterman algorithm on cell microprocessor. Fundamenta Informaticae, 96(1--2): 181--194, 2009.

Yongchao Liu, Douglas L. Maskell, and Bertil Schmidt. CUDASW++: optimizing smith-waterman sequence database searches for CUDA-enabled graphics processing units. BMC Research Notes, 2(1):73, May 2009. ISSN 1756-0500. URL

Łukasz Ligowski and Witold Rudnicki. An efficient implementation of smith waterman algorithm on GPU using CUDA, for massively parallel scanning of sequence databases. In Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on, pages 1--8. IEEE, 2009.

Yongchao Liu, Bertil Schmidt, and Douglas L. Maskell. CUDASW++2.0: enhanced Smith-Waterman protein database search on CUDA-enabled GPUs based on SIMT and virtualized SIMD abstractions. BMC Research Notes, 3(1):93, Apr 2010. ISSN 1756-0500. URL

Łukasz Ligowski, Witold R. Rudnicki, Yongchao Liu, and Bertil Schmidt. Chapter 11 - accurate scanning of sequence databases with the Smith-Waterman algorithm. In Wen-mei W. Hwu, editor, {GPU} Computing Gems Emerald Edition, Applications of GPU Computing Series, pages 155 -- 171. Morgan Kaufmann, Boston, 2011. ISBN 978-0-12-384988-5. URL https://www.sciencedirect.com/science/article/pii/B9780123849885000115.

Torbjørn Rognes. Faster Smith-Waterman database searches with inter-sequence simd parallelisation. BMC Bioinformatics, 12(1):221, 2011.

Yongchao Liu, Adrianto Wirawan, and Bertil Schmidt. CUDASW++ 3.0: accelerating Smith-Waterman protein database search by coupling CPU and GPU SIMD instructions. BMC Bioinformatics, 14(1):117, Apr 2013. ISSN 1471-2105. URL

Yongchao Liu and Bertil Schmidt. SWAPHI: Smith-Waterman protein database search on xeon phi coprocessors. pages 25th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP 2014), 04 2014.

Haidong Lan, W. Liu, B. Schmidt, and B. Wang. Accelerating large-scale biological database search on xeon phi-based neo-heterogeneous architectures. In 2015 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pages 503--510, Nov 2015.

Jeff Daily. Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments. BMC Bioinformatics, 17(1):81, Feb 2016. ISSN 1471-2105. URL

Enzo Rucci, Carlos Garcia, Guillermo Botella, Armando De Giusti, Marcelo Naiouf, and Manuel Prieto-Matias. First experiences optimizing Smith-Waterman on intel's knights landing processor. arXiv:1702.07195 {cs.DC}, 2016.

Kristian Cibulskis, Michael S Lawrence, Scott L Carter, Andrey Sivachenko, David Jaffe, Carrie Sougnez, Stacey Gabriel, Matthew Meyerson, Eric S Lander, and Gad Getz. Sensitive detection of somatic point mutations in impure and heterogeneous cancer samples. Nature biotechnology, 31(3):213--219, 2013.

Mauricio Carneiro, Tadeusz Jordan, P C Pratts, and George Vacek. Optimization of a haplotype PairHMM class for GPU processing. URL https://github.com/MauricioCarneiro/PairHMM.

Chris Rauer, George S. Powley, Mir Ahsan, and Jr. Nicholas Finamore. White paper: Accelerating genomics research with opencl and fpgas. Technical report, Intel Corporation, March 2016. URL https://www.altera.com/content/dam/altera-www/global/en_US/pdfs/literature/wp/wp-accelerating-genomics-opencl-fpgas.pdf.

Genomics kernel library (GKL), 2016. URL https://github.com/Intel-HLS/GKL.

Shanshan Ren, Koen Bertel, and Zaid Al-Ars. Exploration of alternative gpu implementations of the pair-hmms forward algorithm. 2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 00:902--909, 2016.

Jie Wang, Xinfeng Xie, and Jason Cong. Communication optimization on gpu: A case study of sequence alignment algorithms. 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2017.

M. Ito and M. Ohara. A power-efficient fpga accelerator: Systolic array with cache-coherent interface for pair-hmm algorithm. In 2016 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XIX), pages 1--3, April 2016.

Sitao Huang, Gowthami Jayashri Manikandan, Anand Ramachandran, Kyle Rupnow, Wen-mei W Hwu, and Deming Chen. Hardware acceleration of the Pair-HMM algorithm for DNA variant calling. In Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pages 275--284. ACM, 2017.

Paolo Ferragina and Giovanni Manzini. An experimental study of an opportunistic index. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 269--278. Society for Industrial and Applied Mathematics, 2001.

E. Fernandez, W. Najjar, and S. Lonardi. String matching in hardware using the fm-index. In 2011 IEEE 19th Annual International Symposium on Field-Programmable Custom Computing Machines, pages 218--225, May 2011.

Jing Zhang, Heshan Lin, Pavan Balaji, and Wu-chun Feng. Optimizing burrows-wheeler transform-based sequence alignment on multicore architectures. In Cluster, Cloud and Grid Computing (CCGrid), 2013 13th IEEE/ACM International Symposium on, pages 377--384. IEEE, 2013.

Alejandro Chacón, Juan Carlos Moure, Antonio Espinosa, and Porfidio Hernández. n-step fm-index for faster pattern matching. Procedia Computer Science, 18: 70 -- 79, 2013. ISSN 1877-0509. URL http://www.sciencedirect.com/science/article/pii/S187705091300313X. 2013 International Conference on Computational Science.

Alejandro Chacón, Santiago Marco-Sola, Antonio Espinosa, Paolo Ribeca, and Juan Carlos Moure. Boosting the FM-Index on the GPU: Effective techniques to mitigate random memory access. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 12(5):1048--1059, September 2015. ISSN 1545-5963. URL

J. Pantaleoni and N. Subtil. NVBIO: A library of reusable components designed by NVIDIA corporation to accelerate bioinformatics applications using CUDA. URL http://nvlabs.github.io/nvbio/.

Szymon Grabowski, Marcin Raniszewski, and Sebastian Deorowicz. Fm-index for dummies. In Stanisław Kozielski, Dariusz Mrozek, Paweł Kasprowski, Bożena Małysiak-Mrozek, and Daniel Kostrzewa, editors, Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation, pages 189--201, Cham, 2017. Springer International Publishing. ISBN 978-3-319-58274-0.

David R Kelley, Michael C Schatz, and Steven L Salzberg. Quake: quality-aware detection and correction of sequencing errors. Genome Biology, 11(11):1, 2010.

Xiao Yang, Karin S Dorman, and Srinivas Aluru. Reptile: representative tiling for short read error correction. Bioinformatics, 26(20):2526--2533, 2010.

Yongchao Liu, Jan Schröder, and Bertil Schmidt. Musket: a multistage k-mer spectrum-based error corrector for illumina sequence data. Bioinformatics, 29(3): 308--315, 2013.

Serafim Batzoglou, David B Jaffe, Ken Stanley, Jonathan Butler, Sante Gnerre, Evan Mauceli, Bonnie Berger, Jill P Mesirov, and Eric S Lander. ARACHNE: a whole-genome shotgun assembler. Genome Research, 12(1):177--189, 2002.

Daniel R Zerbino and Ewan Birney. Velvet: algorithms for de novo short read assembly using de bruijn graphs. Genome Research, 18(5):821--829, 2008.

Jared T Simpson, Kim Wong, Shaun D Jackman, Jacqueline E Schein, Steven JM Jones, and Inanç Birol. ABySS: a parallel assembler for short read sequence data. Genome Research, 19(6):1117--1123, 2009.

Evangelos Georganas, Aydın Buluç, Jarrod Chapman, Steven Hofmeyr, Chaitanya Aluru, Rob Egan, Leonid Oliker, Daniel Rokhsar, and Katherine Yelick. HipMer: an extreme-scale de novo genome assembler. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, page 14. ACM, 2015.

Stefan Kurtz, Apurva Narechania, Joshua C Stein, and Doreen Ware. A new method to compute k-mer frequencies and its application to annotate large repetitive plant genomes. BMC Genomics, 9(1):517, 2008.

Rachid Ounit, Steve Wanamaker, Timothy J. Close, and Stefano Lonardi. CLARK: fast and accurate classification of metagenomic and genomic sequences using discriminative k-mers. BMC Genomics, 16:236, 2015.

Guillaume Rizk, Dominique Lavenier, and Rayan Chikhi. DSK: k-mer counting with very low memory usage. Bioinformatics, 29(5):652--653, 2013.

Sebastian Deorowicz, Marek Kokot, Szymon Grabowski, and Agnieszka Debudaj-Grabysz. KMC 2: Fast and resource-frugal k-mer counting. Bioinformatics, 31 (10):1569--1576, 2015.

Pall Melsted and Jonathan K Pritchard. Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinformatics, 12(1):1, 2011.

Rajat Shuvro Roy, Debashish Bhattacharya, and Alexander Schliep. Turtle: Identifying frequent k-mers with cache-efficient algorithms. Bioinformatics, 30(14): 1950--1957, 2014.

Qingpeng Zhang, Jason Pell, Rosangela Canino-Koning, Adina Chuang Howe, and C Titus Brown. These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure. PloS ONE, 9(7):e101271, 2014.

Marek Kokot, Maciej Długosz, and Sebastian Deorowicz. KMC 3: counting and manipulating k -mer statistics. Bioinformatics, 2017.

Marius Erbert, Steffen Rechner, and Matthias MÃijller-Hannemann. Gerbil: a fast and memory-efficientk-mer counter with GPU-support. Algorithms for molecular biology: AMB, 12:9, 2017.

T. Pan, P. Flick, C. Jain, Y. Liu, and S. Aluru. Kmerind: A Flexible Parallel Library for K-mer Indexing of Biological Sequences on Distributed Memory Systems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, PP(99):1--1, 2017. ISSN 1545-5963. 00003.

Burton H Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422--426, 1970.

Graham Cormode and S Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 55(1):58--75, 2005.

Intel corporation: Intel^® 64 and ia-32 architectures optimization reference manual. URL https://www.intel.com/content/dam/www/public/us/en/documents/manuals/64-ia-32-architectures-optimization-manual.pdf.

Avinash Sodani, Roger Gramunt, Jesus Corbal, Ho-Seop Kim, Krishna Vinod, Sundaram Chinthamani, Steven Hutsell, Rajat Agarwal, and Yen-Chen Liu. Knights landing: Second-generation intel xeon phi product. IEEE Micro, 36(2):34--46, 2016. ISSN 0272-1732.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009. ISBN 0262033844, 9780262033848.

Pedro Celis. Robin Hood Hashing. PhD thesis, Waterloo, ON, Canada, 1986.

Ecoli reads datasets. URL http://spades.bioinf.spbau.ru/spades_test_datasets/ecoli_mc/.

Anton Bankevich, Sergey Nurk, Dmitry Antipov, Alexey A. Gurevich, Mikhail Dvorkin, Alexander S. Kulikov, Valery M. Lesin, Sergey I. Nikolenko, Son Pham, Andrey D. Prjibelski, Alexey V. Pyshkin, Alexander V. Sirotkin, Nikolay Vyahhi, Glenn Tesler, Max A. Alekseyev, and Pavel A. Pevzner. SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing. Journal of Computational Biology, 19, 2012.

Genome assembly gold standard evaluations. URL http://gage.cbcb.umd.edu/data/index.html.