Next-generation sequencing: big data meets high performance computing

Drug Discovery Today

Volumn 22, Issue 4, 2017, Pages 712-717

  Schmidt, Bertil ^a   Hildebrandt, Andreas ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CANCER THERAPY; GENOME; HUMAN; NEXT GENERATION SEQUENCING; PERSONALIZED MEDICINE; ALGORITHM; COMPUTER ANALYSIS; DNA SEQUENCE; ECONOMICS; GENETIC DATABASE; GENETICS; GENOMICS; HIGH THROUGHPUT SEQUENCING; PROCEDURES;

ALGORITHMS; COMPUTING METHODOLOGIES; DATABASES, GENETIC; GENOME; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; SEQUENCE ANALYSIS, DNA;

EID: 85012267076     PISSN: 13596446     EISSN: 18785832     Source Type: Journal    
DOI: 10.1016/j.drudis.2017.01.014     Document Type: Review

References (80)

1. 1 Gudbjartsson, D.F., et al. Large-scale whole-genome sequencing of the Icelandic population. Nat. Genet. 47 (2015), 435–444.
2. 2 Korpela, K., et al. Intestinal microbiome is related to lifetime antibiotic use in Finnish pre-school children. Nat. Commun. 7 (2016), 1–8.
3. 3 Stephens, Z.D., et al. Big data: astronomical or genomical?. PLoS Biol., 13, 2015, e1002195.
4. 4 McDermott, U., Next-generation sequencing and empowering personalized cancer medicine. Drug Discov. Today 20 (2015), 1470–1475.
5. 5 Harper, A.R., Topol, E.J., Pharmacogenomics in clinical practice and drug development. Nat. Biotechnol. 30 (2012), 1117–1124.
6. 6 Mavrou, A., et al. Serine arginine protein kinase 1 (SRPK1) inhibition as a potential novel targeted therapeutic strategy in prostate cancer. Oncogene 34 (2015), 4311–4319.
7. 7 Gammons, M.V., Topical antiangiogenic SRPK1 inhibitors reduce choroidal neovascularization in rodent models of exudative AMD. Invest. Opthalmol. Vis. Sci., 54, 2013, 6052.
8. 8 Li, Z., Rana, T.M., Therapeutic targeting of microRNAs: current status and future challenges. Nat. Rev. Drug Discov. 13 (2014), 622–638.
9. 9 Heerboth, S., et al. Use of epigenetic drugs in disease: an overview. Genet. Epigenet. 6 (2014), 9–19.
10. 10 Leskovec, J., (eds.) Mining of Massive Datasets, 2014, Cambridge University Press.
11. 11 Schatz, M.C., Biological data sciences in genome research. Genome Res. 25 (2015), 1417–1422.
12. 12 Owens, J.D., et al. GPU computing. Proc. IEEE 96 (2008), 879–899.
13. 13 Compton, K., Hauck, S., Reconfigurable computing: a survey of systems and software. ACM Computing Surveys 34 (2002), 171–210.
14. 14 Simpson, J.T., Durbin, R., Efficient de novo assembly of large genomes using compressed data structures. Genome Res. 22 (2012), 549–556.
15. 15 Liu, Y., Musket: a multistage k-mer spectrum-based error corrector for illumina sequence data. Bioinformatics 29 (2013), 308–315.
16. 16 Langmead, B., Salzberg, S.L., Fast gapped-read alignment with Bowtie2. Nat. Methods 9 (2012), 357–359.
17. 17 Wood, D.E., Salzberg, S.L., Kraken: ultrafast metagenomics sequence classification using exact alignments. Genome Biol., 15, 2014, R46.
18. 18 Altschul, S.F., et al. Basic local alignment search tool. J. Mol. Biol. 215 (1990), 403–410.
19. 19 Abouelhoda, M.I., et al. Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2 (2004), 53–86.
20. 20 Ferragina, P., Manzini, G., Indexing compressed text. J. ACM 52 (2005), 552–581.
21. 21 Lee, W.P., et al. Mosaik: a hash-based algorithm for accurate next generation sequencing short-read mapping. PLoS One, 9, 2014, e90581.
22. 22 Vyverman, M., et al. A long fragment aligner called ALFALFA. BMC Bioinformatics, 16, 2015, 159.
23. 23 Kim, D., et al. HISAT: a fast spliced aligner with low memory requirements. Nat. Methods 12 (2015), 357–360.
24. 24 Dobin, A., et al. STAR: ultrafast universal RNA-seq aligner. Bioinformatics 29 (2013), 15–21.
25. 25 Broder, A.Z., Identifying and filtering near-duplicate documents. 11th Annual Symposium on Combinatorial Pattern Matching 1847, 2000, 1–10.
26. 26 Roberts, M., et al. Reducing storage requirements for biological sequence comparison. Bioinformatics 20 (2004), 3363–3369.
27. 27 Ondov, B.D., et al. Mash: fast genome and metagenome distance estimation using minhash. Genome Biol., 17, 2016, 132.
28. 28 Berlin, K., et al. Assembling large genomes with single-molecule sequencing and locality-sensitive hashing. Nat. Biotechnol. 33 (2015), 623–630.
29. 29 Popic, V., Batzoglou, S., Privacy-preserving read mapping using locality sensitive hashing and secure kmer voting. bioRxiv, 2016, 10.1101/046920doi.
30. 30 Deorowicz, S., et al. KMC 2: Fast and resource-frugal k-mer counting. Bioinformatics 31 (2015), 1569–1576.
31. 31 Bloom, B.H., Space/time trade-offs in hash coding with allowable errors. Comm. ACM 13 (1970), 422–426.
32. 32 Melsted, P., Halldorsson, B.V., KmerStream: streaming algorithms for k-mer abundance estimation. Bioinformatics 30 (2014), 3541–3547.
33. 33 Chikhi, R., Rizk, G., Space-efficient and exact de Bruijn graph representation based on a Bloom filter. Algorithms Mol. Biol, 8, 2013, 22.
34. 34 Zhang, Z., Wang, W., RNA-skim: a rapid method for RNA-seq quantification at transcript level. Bioinformatics 30 (2014), i283–292.
35. 35 Melsted, P., Pritchard, J.K., Efficient counting of k-mers in DNA sequences using a Bloom filter. BMC Bioinformatics, 12, 2011, 333.
36. 36 Chu, J., et al. BioBloom tools: fast, accurate and memory-efficient host species sequence screening using Bloom filters. Bioinformatics 30 (2014), 3402–3404.
37. 37 Solomon, B., Kingsford, C., Fast search of thousands of short read sequencing experiments. Nat. Biotechnol. 34 (2016), 300–302.
38. 38 Smith, T.F., Waterman, M.S., Identification of common molecular subsequences. J. Mol. Biol. 147 (1981), 195–197.
39. 39 Myers, G., A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM 46 (1999), 395–415.
40. 40 Cheng, H., et al. BitMapper: an efficient all-mapper based on bit-vector computing. BMC Bioinformatics, 16, 2015, 192.
41. 41 Xin, H., et al. Shifted hamming distance: a fast and accurate SIMD-friendly filter to accelerate alignment verification in read mapping. Bioinformatics 31 (2015), 1553–1560.
42. 42 Marcais, G., Kingsford, C., A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 27 (2011), 764–770.
43. 43 Dean, J., Ghemawat, S., MapReduce: simplified data processing on large clusters. Comm. ACM 51 (2008), 107–113.
44. 44 Shvachko, K., et al. The Hadoop distributed file system. IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), 2010, 1–10.
45. 45 Luo, J., Big data application in biomedical research and health care: a literature review. Biomed. Inform. Insights 8 (2016), 1–10.
46. 46 Abuin, J.M., et al. BigBWA: approaching the Burrows–Wheeler aligner to big data technologies. Bioinformatics 31 (2015), 4003–4005.
47. 47 Abuin, J.M., et al. SparkBWA: speeding up the alignment of high-throughput DNA sequencing data. PLoS One, 11, 2016, e0155461.
48. 48 Langmead, B., et al. Cloud-scale RNA sequencing differential expression analysis with Myrna. Genome Biol., 11, 2010, R83.
49. 49 Chang, Y.J., et al. A de-novo next generation genomic sequence assembler based on string graph and MapReduce Cloud computing framework. BMC Genomics, 13, 2012, S28.
50. 50 Chien, C.C., et al. CloudRS: an error correction algorithm of high-throughput sequencing data based on scalable framework. Proc. IEEE Int. Conference Big Data 2013 (2013), 717–722.
51. 51 Rabenseifner, R., Hybrid MPI/OpenMP parallel programming on clusters of multi-core SMP nodes. 17th Euromicro Int. Conf. on Parallel, Distributed and Network-based Proc. 2009 (2009), 427–436.
52. 52 Georganas, E., et al. HipMer: an extreme-scale de novo genome assembler. Proc. Int. Conference for High Performance Computing, Networking. Proc. Int. Conference for High Performance Computing, Networking, Storage and Analysis, 2015, 2015, 14.
53. 53 Gonzalez-Dominguez, J., et al. Parallel and scalable short-read alignment on multi-core clusters using UPC++. PLoS One, 11, 2016, e0145490.
54. 54 Zaharia, M., et al. Spark: cluster computing with working sets. HotCloud, 2010, 2010, 10.
55. 55 Reyes-Ortiz, J.L., et al. Big data analytics in the Cloud: Spark on Hadoop vs MPI/OpenMP on Beowulf. INNS Conference on Big Data 2015, 2015, 121–130.
56. 56 Li, P., et al. Heterospark: a heterogeneous CPU/GPU spark platform for machine learning algorithms. 10th IEEE Int. Conf. on Networking, Architecture and Storage NAS 2015, 2015, 347–348.
57. 57 Nickolls, J., et al. Scalable parallel programming with CUDA. Queue 6 (2008), 40–53.
58. 58 Wilton, R., et al. Arioc: high-throughput read alignment with GPU-accelerated exploration of the seed-and-extend search space. Peer J., 3, 2015, e808.
59. 59 Medina, I., et al. Highly sensitive and ultrafast read mapping for RNA-seq analysis. DNA Res. 23 (2016), 93–100.
60. 60 Liu, Y., et al. DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI. BMC Bioinformatics, 12, 2011, 85.
61. 61 Erbert, M., et al. Gerbil: a fast and memory-efficient k-mer counter with GPU-support. Frith, M., (eds.) Algorithms in Bioinformatics, 9838, 2016, Springer, 150–161.
62. 62 Li, D., et al. Megahit: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph. Bioinformatics 31 (2015), 1674–1676.
63. 63 Miller, N.A., et al. A 26-hour system of highly sensitive whole genome sequencing for emergency management of genetic diseases. Genome Med., 7, 2015, 100.
64. 64 Fernandez, E.B., et al. FHAST: FPGA-based acceleration of Bowtie in hardware: IEEE/ACM Trans. Computational Biology Bioinformatics 12 (2015), 973–981.
65. 65 Ramachandran, A., et al. FPGA-accelerated DNA error correction. Proc. 2015 Design, Automation & Test in Europe 2015 (2015), 1371–1376.
66. 66 Varma, B.S.C., et al. Fassem: FPGA-based acceleration of de novo genome assembly. IEEE Symp. on Field-Programmable Custom Computing Machines (FCCM) 2013, 2013, 173–176.
67. 67 TimeLogic, Accelerated BLAST performance with Tera-BLAST: a comparison of FPGA versus GPU and CPU BLAST implementations. 2013.
68. 68 Czajkowski, T.S., et al. From OpenCL to high-performance hardware on FPGAs. 22nd International Conference on Field Programmable Logic and Applications (FPL 2012, 2012, 531–534.
69. 69 Rhoads, A., Au, K.F., PacBIO sequencing and its applications. Genomics Proteomics Bioinformatics 13 (2015), 278–289.
70. 70 El-Metwally, S., et al. Lightassembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads. Bioinformatics 32 (2016), 3215–3223.
71. 71 Schulz, M.H., et al. Fiona: a parallel and automatic strategy for read error correction. Bioinformatics 30 (2014), i356–363.
72. 72 Bray, N.L., et al. Near-optimal probabilistic RNA-seq quantification. Nat. Biotechnol. 34 (2016), 525–527.
73. 73 Allam, A., et al. Karect: accurate correction of substitution, insertion and deletion errors for next-generation sequencing data. Bioinformatics 31 (2015), 3421–3428.
74. 74 Maillet, N., et al. Compareads: comparing huge metagenomic experiments. BMC Bioinformatics, 13, 2012, S10.
75. 75 Nordberg, H., et al. BioPig: a Hadoop-based analytic toolkit for large-scale sequence data. Bioinformatics 29 (2013), 3014–3019.
76. 76 Yang, X., et al. Large-scale metagenomic sequence clustering on Map-Reduce clusters. J. Bioinform. Comput. Biol., 11, 2013, 1340001.
77. 77 Martinez, H., et al. Scalable Rna Sequencing on Clusters of Multicore Processors. IEEE Trustcom/BigDataSE/ISPA 2015190195.
78. 78 Heo, Y., et al. BLESS 2: accurate, memory-efficient and fast error correction method. Bioinformatics 32 (2016), 2369–2371.
79. 79 Ahn, T.H., et al. Sigma: Strain-level inference of genomes from metagenomic analysis for Biosurveillance. Bioinformatics 31 (2015), 170–177.
80. 80 Jain, A., et al. GAGM: genome assembly on GPU using mate pairs. 20th Annual International Conference on High Performance Computing 2013, 2013, 176–185.