Browsing by Subject "High throughput sequencing"

Now showing 1 - 6 of 6

Open Access
Fast and accurate mapping of complete genomics reads
(Academic Press, 2015) Lee, D.; Hormozdiari, F.; Xin, H.; Hach, F.; Mutlu, O.; Alkan C.
Many recent advances in genomics and the expectations of personalized medicine are made possible thanks to power of high throughput sequencing (HTS) in sequencing large collections of human genomes. There are tens of different sequencing technologies currently available, and each HTS platform have different strengths and biases. This diversity both makes it possible to use different technologies to correct for shortcomings; but also requires to develop different algorithms for each platform due to the differences in data types and error models. The first problem to tackle in analyzing HTS data for resequencing applications is the read mapping stage, where many tools have been developed for the most popular HTS methods, but publicly available and open source aligners are still lacking for the Complete Genomics (CG) platform. Unfortunately, Burrows-Wheeler based methods are not practical for CG data due to the gapped nature of the reads generated by this method. Here we provide a sensitive read mapper (sirFAST) for the CG technology based on the seed-and-extend paradigm that can quickly map CG reads to a reference genome. We evaluate the performance and accuracy of sirFAST using both simulated and publicly available real data sets, showing high precision and recall rates.
Open Access
A global reference for human genetic variation
(Nature Publishing Group, 2015) Auton, A.; Abecasis, G. R.; Altshuler, D. M.; Durbin, R. M.; Bentley, D. R.; Chakravarti, A.; Clark, A. G.; Donnelly, P.; Eichler, E. E.; Flicek, P.; Gabriel, S. B.; Gibbs, R. A.; Green, E. D.; Hurles, M. E.; Knoppers, B. M.; Korbel, J. O.; Lander, E. S.; Lee, C.; Lehrach, H.; Mardis, E. R.; Marth, G. T.; McVean, G. A.; Nickerson, D. A.; Schmidt, J. P.; Sherry, S. T.; Wang, J.; Wilson, R. K.; Boerwinkle, E.; Doddapaneni, H.; Han, Y.; Korchina, V.; Kovar, C.; Lee, S.; Muzny, D.; Reid, J. G.; Zhu, Y.; Chang, Y.; Feng, Q.; Fang, X.; Guo, X.; Jian, M.; Jiang, H.; Jin, X.; Lan, T.; Li, G.; Li, J.; Li, Y.; Liu, S.; Liu, X.; Lu, Y.; Ma, X.; Tang, M.; Wang, B.; Wang, G.; Wu, H.; Wu, R.; Xu, X.; Yin, Y.; Zhang, D.; Zhang, W.; Zhao, J.; Zhao, M.; Zheng, X.; Gupta, N.; Gharani, N.; Toji, L. H.; Gerry, N. P.; Resch, A. M.; Barker, J.; Clarke, L.; Gil, L.; Hunt, S. E.; Kelman, G.; Kulesha, E.; Leinonen, R.; McLaren, W. M.; Radhakrishnan, R.; Roa, A.; Smirnov, D.; Smith, R. E.; Streeter, I.; Thormann, A.; Toneva, I.; Vaughan, B.; Zheng-Bradley, X.; Grocock, R.; Humphray, S.; James, T.; Kingsbury, Z.; Sudbrak, R.; Albrecht, M. W.; Amstislavskiy, V. S.; Borodina, T. A.; Lienhard, M.; Mertes, F.; Sultan, M.; Timmermann, B.; Yaspo, Marie-Laure; Fulton, L.; Ananiev, V.; Belaia, Z.; Beloslyudtsev, D.; Bouk, N.; Chen, C.; Church, D.; Cohen, R.; Cook, C.; Garner, J.; Hefferon, T.; Kimelman, M.; Liu, C.; Lopez, J.; Meric, P.; O'Sullivan, C.; Ostapchuk, Y.; Phan, L.; Ponomarov, S.; Schneider, V.; Shekhtman, E.; Sirotkin, K.; Slotta, D.; Zhang, H.; Balasubramaniam, S.; Burton, J.; Danecek, P.; Keane, T. M.; Kolb-Kokocinski, A.; McCarthy, S.; Stalker, J.; Quail, M.; Davies, C. J.; Gollub, J.; Webster, T.; Wong, B.; Zhan, Y.; Campbell, C. L.; Kong, Y.; Marcketta, A.; Yu, F.; Antunes, L.; Bainbridge, M.; Sabo, A.; Huang, Z.; Coin, L. J. M.; Fang, L.; Li, Q.; Li, Z.; Lin, H.; Liu, B.; Luo, R.; Shao, H.; Xie, Y.; Ye, C.; Yu, C.; Zhang, F.; Zheng, H.; Zhu, H.; Alkan, C.; Dal, E.; Kahveci, F.; Garrison, E. P.; Kural, D.; Lee, W. P.; Leong, W. F.; Stromberg, M.; Ward, A. N.; Wu, J.; Zhang, M.; Daly, M. J.; DePristo, M. A.; Handsaker, R. E.; Banks, E.; Bhatia, G.; Del Angel, G.; Genovese, G.; Li, H.; Kashin, S.; McCarroll, S. A.; Nemesh, J. C.; Poplin, R. E.; Yoon, S. C.; Lihm, J.; Makarov, V.; Gottipati, S.; Keinan, A.; Rodriguez-Flores, J. L.; Rausch, T.; Fritz, M. H.; Stütz, A. M.; Beal, K.; Datta, A.; Herrero, J.; Ritchie, G. R. S.; Zerbino, D.; Sabeti, P. C.; Shlyakhter, I.; Schaffner, S. F.; Vitti, J.; Cooper, D. N.; Ball, E. V.; Stenson, P. D.; Barnes, B.; Bauer, M.; Cheetham, R. K.; Cox, A.; Eberle, M.; Kahn, S.; Murray, L.; Peden, J.; Shaw, R.; Kenny, E. E.; Batzer, M. A.; Konkel, M. K.; Walker, J. A.; MacArthur, D. G.; Lek, M.; Herwig, R.; Ding, L.; Koboldt, D. C.; Larson, D.; Ye, K.; Gravel, S.; Swaroop, A.; Chew, E.; Lappalainen, T.; Erlich, Y.; Gymrek, M.; Willems, T. F.; Simpson, J. T.; Shriver, M. D.; Rosenfeld, J. A.; Bustamante, C. D.; Montgomery, S. B.; De La Vega, F. M.; Byrnes, J. K.; Carroll, A. W.; DeGorter, M. K.; Lacroute, P.; Maples, B. K.; Martin, A. R.; Moreno-Estrada, A.; Shringarpure, S. S.; Zakharia, F.; Halperin, E.; Baran, Y.; Cerveira, E.; Hwang, J.; Malhotra, A.; Plewczynski, D.; Radew, K.; Romanovitch, M.; Zhang, C.; Hyland, F. C. L.; Craig, D. W.; Christoforides, A.; Homer, N.; Izatt, T.; Kurdoglu, A. A.; Sinari, S. A.; Squire, K.; Xiao, C.; Sebat, J.; Antaki, D.; Gujral, M.; Noor, A.; Ye, K.; Burchard, E. G.; Hernandez, R. D.; Gignoux, C. R.; Haussler, D.; Katzman, S. J.; Kent, W. J.; Howie, B.; Ruiz-Linares, A.; Dermitzakis, E. T.; Devine, S. E.; Kang, H. M.; Kidd, J. M.; Blackwell, T.; Caron, S.; Chen, W.; Emery, S.; Fritsche, L.; Fuchsberger, C.; Jun, G.; Li, B.; Lyons, R.; Scheller, C.; Sidore, C.; Song, S.; Sliwerska, E.; Taliun, D.; Tan, A.; Welch, R.; Wing, M. K.; Zhan, X.; Awadalla, P.; Hodgkinson, A.; Li, Y.; Shi, X.; Quitadamo, A.; Lunter, G.; Marchini, J. L.; Myers, S.; Churchhouse, C.; Delaneau, O.; Gupta-Hinch, A.; Kretzschmar, W.; Iqbal, Z.; Mathieson, I.; Menelaou, A.; Rimmer, A.; Xifara, D. K.; Oleksyk, T. K.; Fu, Y.; Liu, X.; Xiong, M.; Jorde, L.; Witherspoon, D.; Xing, J.; Browning, B. L.; Browning, S. R.; Hormozdiari, F.; Sudmant, P. H.; Khurana, E.; Tyler-Smith, C.; Albers, C. A.; Ayub, Q.; Chen, Y.; Colonna, V.; Jostins, L.; Walter, K.; Xue, Y.; Gerstein, M. B.; Abyzov, A.; Balasubramanian, S.; Chen, J.; Clarke, D.; Fu, Y.; Harmanci, A. O.; Jin, M.; Lee, D.; Liu, J.; Mu, X. J.; Zhang, J.; Zhang, Y.; Hartl, C.; Shakir, K.; Degenhardt, J.; Meiers, S.; Raeder, B.; Casale, F. P.; Stegle, O.; Lameijer, E. W.; Hall, I.; Bafna, V.; Michaelson, J.; Gardner, E. J.; Mills, R. E.; Dayama, G.; Chen, K.; Fan, X.; Chong, Z.; Chen, T.; Chaisson, M. J.; Huddleston, J.; Malig, M.; Nelson, B. J.; Parrish, N. F.; Blackburne, B.; Lindsay, S. J.; Ning, Z.; Zhang, Y.; Lam, H.; Sisu, C.; Challis, D.; Evani, U. S.; Lu, J.; Nagaswamy, U.; Yu, J.; Li, W.; Habegger, L.; Yu, H.; Cunningham, F.; Dunham, I.; Lage, K.; Jespersen, J. B.; Horn, H.; Kim, D.; Desalle, R.; Narechania, A.; Sayres, M. A. W.; Mendez, F. L.; Poznik, G. D.; Underhill, P. A.; Mittelman, D.; Banerjee, R.; Cerezo, M.; Fitzgerald, T. W.; Louzada, S.; Massaia, A.; Yang, F.; Kalra, D.; Hale, W.; Dan, X.; Barnes, K. C.; Beiswanger, C.; Cai, H.; Cao, H.; Henn, B.; Jones, D.; Kaye, J. S.; Kent, A.; Kerasidou, A.; Mathias, R.; Ossorio, P. N.; Parker, M.; Rotimi, C. N.; Royal, C. D.; Sandoval, K.; Su, Y.; Tian, Z.; Tishkoff, S.; Via, M.; Wang, Y.; Yang, H.; Yang, L.; Zhu, J.; Bodmer, W.; Bedoya, G.; Cai, Z.; Gao, Y.; Chu, J.; Peltonen, L.; Garcia-Montero, A.; Orfao, A.; Dutil, J.; Martinez-Cruzado, J. C.; Mathias, R. A.; Hennis, A.; Watson, H.; McKenzie, C.; Qadri, F.; LaRocque, R.; Deng, X.; Asogun, D.; Folarin, O.; Happi, C.; Omoniwa, O.; Stremlau, M.; Tariyal, R.; Jallow, M.; Joof, F. S.; Corrah, T.; Rockett, K.; Kwiatkowski, D.; Kooner, J.; Hien, T. T.; Dunstan, S. J.; ThuyHang, N.; Fonnie, R.; Garry, R.; Kanneh, L.; Moses, L.; Schieffelin, J.; Grant, D. S.; Gallo, C.; Poletti, G.; Saleheen, D.; Rasheed, A.; Brooks, L. D.; Felsenfeld, A. L.; McEwen, J. E.; Vaydylevich, Y.; Duncanson, A.; Dunn, M.; Schloss, J. A.
The 1000 Genomes Project set out to provide a comprehensive description of common human genetic variation by applying whole-genome sequencing to a diverse set of individuals from multiple populations. Here we report completion of the project, having reconstructed the genomes of 2,504 individuals from 26 populations using a combination of low-coverage whole-genome sequencing, deep exome sequencing, and dense microarray genotyping. We characterized a broad spectrum of genetic variation, in total over 88 million variants (84.7 million single nucleotide polymorphisms (SNPs), 3.6 million short insertions/deletions (indels), and 60,000 structural variants), all phased onto high-quality haplotypes. This resource includes >99% of SNP variants with a frequency of >1% for a variety of ancestries. We describe the distribution of genetic variation across the global sample, and discuss the implications for common disease studies. © 2015 Macmillan Publishers Limited. All rights reserved.
Open Access
GRIM-Filter: fast seed location filtering in DNA read mapping using processing-in-memory technologies
(BioMed Central, 2018) Kim, J. S.; Cali, D. S.; Xin, H.; Lee, D.; Ghose, S.; Alser, M.; Hassan, H.; Ergin, O.; Alkan C.; Mutlu, O.
Background: Seed location filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. State-of-the-art read mappers 1) quickly generate possible mapping locations for seeds (i.e., smaller segments) within each read, 2) extract reference sequences at each of the mapping locations, and 3) check similarity between each read and its associated reference sequences with a computationally-expensive algorithm (i.e., sequence alignment) to determine the origin of the read. A seed location filter comes into play before alignment, discarding seed locations that alignment would deem a poor match. The ideal seed location filter would discard all poor match locations prior to alignment such that there is no wasted computation on unnecessary alignments. Results: We propose a novel seed location filtering algorithm, GRIM-Filter, optimized to exploit 3D-stacked memory systems that integrate computation within a logic layer stacked under memory layers, to perform processing-in-memory (PIM). GRIM-Filter quickly filters seed locations by 1) introducing a new representation of coarse-grained segments of the reference genome, and 2) using massively-parallel in-memory operations to identify read presence within each coarse-grained segment. Our evaluations show that for a sequence alignment error tolerance of 0.05, GRIM-Filter 1) reduces the false negative rate of filtering by 5.59x-6.41x, and 2) provides an end-to-end read mapper speedup of 1.81x-3.65x, compared to a state-of-the-art read mapper employing the best previous seed location filtering algorithm. Conclusion: GRIM-Filter exploits 3D-stacked memory, which enables the efficient use of processing-in-memory, to overcome the memory bandwidth bottleneck in seed location filtering. We show that GRIM-Filter significantly improves the performance of a state-of-the-art read mapper. GRIM-Filter is a universal seed location filter that can be applied to any read mapper. We hope that our results provide inspiration for new works to design other bioinformatics algorithms that take advantage of emerging technologies and new processing paradigms, such as processing-in-memory using 3D-stacked memory devices.
Open Access
mrsFAST-Ultra: a compact, SNP-aware mapper for high performance sequencing applications
(Oxford University Press, 2014) Hach, F.; Sarrafi, I.; Hormozdiari, F.; Alkan C.; Eichler, E. E.; Sahinalp, S. C.
High throughput sequencing (HTS) platforms generate unprecedented amounts of data that introduce challenges for processing and downstream analysis. While tools that report the 'best' mapping location of each read provide a fast way to process HTS data, they are not suitable for many types of downstream analysis such as structural variation detection, where it is important to report multiple mapping loci for each read. For this purpose we introduce mrsFAST-Ultra, a fast, cache oblivious, SNP-aware aligner that can handle the multi-mapping of HTS reads very efficiently. mrsFAST-Ultra improves mrsFAST, our first cache oblivious read aligner capable of handling multi-mapping reads, through new and compact index structures that reduce not only the overall memory usage but also the number of CPU operations per alignment. In fact the size of the index generated by mrsFAST-Ultra is 10 times smaller than that of mrsFAST. As importantly, mrsFAST-Ultra introduces new features such as being able to (i) obtain the best mapping loci for each read, and (ii) return all reads that have at most n mapping loci (within an error threshold), together with these loci, for any user specified n. Furthermore, mrsFAST-Ultra is SNP-aware, i.e. it can map reads to reference genome while discounting the mismatches that occur at common SNP locations provided by db-SNP; this significantly increases the number of reads that can be mapped to the reference genome. Notice that all of the above features are implemented within the index structure and are not simple post-processing steps and thus are performed highly efficiently. Finally, mrsFAST-Ultra utilizes multiple available cores and processors and can be tuned for various memory settings. Our results show that mrsFAST-Ultra is roughly five times faster than its predecessor mrsFAST. In comparison to newly enhanced popular tools such as Bowtie2, it is more sensitive (it can report 10 times or more mappings per read) and much faster (six times or more) in the multi-mapping mode. Furthermore, mrsFAST-Ultra has an index size of 2GB for the entire human reference genome, which is roughly half of that of Bowtie2. mrsFAST-Ultra is open source and it can be accessed at http://mrsfast.sourceforge.net. © 2014 The Author(s).
Open Access
On genomic repeats and reproducibility
(Oxford University Press, 2016) Firtina, C.; Alkan C.
Results: Here, we present a comprehensive analysis on the reproducibility of computational characterization of genomic variants using high throughput sequencing data. We reanalyzed the same datasets twice, using the same tools with the same parameters, where we only altered the order of reads in the input (i.e. FASTQ file). Reshuffling caused the reads from repetitive regions being mapped to different locations in the second alignment, and we observed similar results when we only applied a scatter/gather approach for read mapping - without prior shuffling. Our results show that, some of the most common variation discovery algorithms do not handle the ambiguous read mappings accurately when random locations are selected. In addition, we also observed that even when the exact same alignment is used, the GATK HaplotypeCaller generates slightly different call sets, which we pinpoint to the variant filtration step. We conclude that, algorithms at each step of genomic variation discovery and characterization need to treat ambiguous mappings in a deterministic fashion to ensure full replication of results. Availability and Implementation: Code, scripts and the generated VCF files are available at DOI:10.5281/zenodo.32611.
Open Access
Toolkit for automated and rapid discovery of structural variants
(Academic Press, 2017) Soylev, A.; Kockan, C.; Hormozdiari, F.; Alkan C.
Structural variations (SV) are broadly defined as genomic alterations that affect >50 bp of DNA, which are shown to have significant effect on evolution and disease. The advent of high throughput sequencing (HTS) technologies and the ability to perform whole genome sequencing (WGS), makes it feasible to study these variants in depth. However, discovery of all forms of SV using WGS has proven to be challenging as the short reads produced by the predominant HTS platforms (<200 bp for current technologies) and the fact that most genomes include large amounts of repeats make it very difficult to unambiguously map and accurately characterize such variants. Furthermore, existing tools for SV discovery are primarily developed for only a few of the SV types, which may have conflicting sequence signatures (i.e. read pairs, read depth, split reads) with other, untargeted SV classes. Here we are introduce a new framework, TARDIS, which combines multiple read signatures into a single package to characterize most SV types simultaneously, while preventing such conflicts. TARDIS also has a modular structure that makes it easy to extend for the discovery of additional forms of SV. © 2017 Elsevier Inc.