Next generation read mapping on GPUs Cole Trapnell.

Slides:



Advertisements
Similar presentations
Speed, Accurate and Efficient way to identify the DNA.
Advertisements

Murach, Chapter 6. Murach’s Visual Basic 2008, C6© 2008, Mike Murach & Associates, Inc. Slide 2.
Fa07CSE 182 CSE182-L4: Database filtering. Fa07CSE 182 Summary (through lecture 3) A2 is online We considered the basics of sequence alignment –Opt score.
Celera Assembler Arthur L. Delcher Senior Research Scientist CBCB University of Maryland.
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
GPGPU Introduction Alan Gray EPCC The University of Edinburgh.
SeqMap: mapping massive amount of oligonucleotides to the genome Hui Jiang et al. Bioinformatics (2008) 24: The GNUMAP algorithm: unbiased probabilistic.
High-throughput sequence alignment using Graphics Processing Units Michael C Schatz, Cole Trapnell, Arthur L Delcher, Amitabh Varshney UMD Presented by.
Size Matters : Space/Time Tradeoffs to Improve GPGPU Application Performance Abdullah Gharaibeh Matei Ripeanu NetSysLab The University of British Columbia.
High Throughput Sequencing Xiaole Shirley Liu STAT115, STAT215, BIO298, BIST520.
Next Generation Sequencing, Assembly, and Alignment Methods
Acceleration of the Smith– Waterman algorithm using single and multiple graphics processors Author : Ali Khajeh-Saeed, Stephen Poole, J. Blair Perot. Publisher:
GPU Computing with CUDA as a focus Christie Donovan.
2009/04/07 Yun-Yang Ma.  Overview  What is CUDA ◦ Architecture ◦ Programming Model ◦ Memory Model  H.264 Motion Estimation on CUDA ◦ Method ◦ Experimental.
SST:an algorithm for finding near- exact sequence matches in time proportional to the logarithm of the database size Eldar Giladi Eldar Giladi Michael.
NVIDIA’s Experience with Open64 Mike Murphy NVIDIA.
Jared Law CUDA: Super-Computing Made Easy. Jared Law NVidia CUDA: Why CUDA? What is CUDA? Where/how is CUDA being used? What does CUDA mean to programmers?
Sequence Alignment vs. Database Task: Given a query sequence and millions of database records, find the optimal alignment between the query and a record.
Novel multi-platform next generation assembly methods for mammalian genomes The Baylor College of Medicine, Australian Government and University of Connecticut.
Evolution of the Programmable Graphics Pipeline Patrick Cozzi University of Pennsylvania CIS Spring 2011.
GPGPU overview. Graphics Processing Unit (GPU) GPU is the chip in computer video cards, PS3, Xbox, etc – Designed to realize the 3D graphics pipeline.
To GPU Synchronize or Not GPU Synchronize? Wu-chun Feng and Shucai Xiao Department of Computer Science, Department of Electrical and Computer Engineering,
Genomics Method Seminar - BWA
A massively parallel solution to a massively parallel problem HPC4NGS Workshop, May 21-22, 2012 Principe Felipe Research Center, Valencia Brian Lam, PhD.
BY: ALI AJORIAN ISFAHAN UNIVERSITY OF TECHNOLOGY 2012 GPU Architecture 1.
Tim Madden ODG/XSD.  Graphics Processing Unit  Graphics card on your PC.  “Hardware accelerated graphics”  Video game industry is main driver.  More.
GPU Acceleration of Pyrosequencing Noise Removal Dept. of Computer Science and Engineering University of South Carolina Yang Gao, Jason D. Bakos Heterogeneous.
MES Genome Informatics I - Lecture V. Short Read Alignment
CS6963 L15: Design Review and CUBLAS Paper Discussion.
Massively Parallel Mapping of Next Generation Sequence Reads Using GPUs Azita Nouri, Reha Oğuz Selvitopi, Özcan Öztürk, Onur Mutlu, Can Alkan Bilkent University,
Chun-Yuan Lin Assistant Professor Department of Computer Science and Information Engineering Chang Gung University Experiences for computational biology.
Adrian Caciula Department of Computer Science Georgia State University Joint work with Serghei Mangul (UCLA) Ion Mandoiu (UCONN) Alex Zelikovsky (GSU)
An Empirical Study of Choosing Efficient Discriminative Seeds for Oligonucleotide Design Won-Hyong Chung and Seong-Bae Park Dept. of Computer Engineering.
Advances in DTM Creation and Processing Methods in PHOTOMOD 5 Alexey Elizarov Deputy Head of Software Development Department September 2010, Gaeta, Italy.
Cuda application-Case study 2015/10/24 1. Introduction (1) 2015/10/24 GPU Workshop 2 The fast increasing power of the GPU (Graphics Processing Unit) and.
1 LSM2241 AY0910 Semester 2 MiniProject Briefing Round 5.
1 NETTAB 2012 FILTERING WITH ALIGNMENT FREE DISTANCES FOR HIGH THROUGHPUT DNA READS ASSEMBLY Maria de Cola, Giovanni Felici, Daniele Santoni, Emanuel Weitschek.
COMPUTER BASICS HOW TO BUILD YOUR OWN PC. CHOOSING PARTS Motherboard Processor Memory (RAM) Disk drive Graphics card Power supply Case Blu-ray/DVD drive.
Chun-Yuan Lin Assistant Professor Department of Computer Science and Information Engineering Chang Gung University Experiences for computational biology.
CDVS on mobile GPUs MPEG 112 Warsaw, July Our Challenge CDVS on mobile GPUs  Compute CDVS descriptor from a stream video continuously  Make.
Scientific Computing on Graphics Hardware Robert Strzodka, Dominik G ö ddeke Reading, UK, May
SHRiMP: The SHort Read Mapping Package Michael Brudno Department of Computer Science University of Toronto 11/09/08.
GPUs – Graphics Processing Units Applications in Graphics Processing and Beyond COSC 3P93 – Parallel ComputingMatt Peskett.
Programming with CUDA WS 08/09 Lecture 1 Tue, 21 Oct, 2008.
Grade Standards, Supporting Skills, and Examples THIRD GRADE ALGEBRA Chaz Foss.
Fateme Hajikarami Spring  What is GPGPU ? ◦ General-Purpose computing on a Graphics Processing Unit ◦ Using graphic hardware for non-graphic computations.
Biosequence Similarity Search on the Mercury System Praveen Krishnamurthy, Jeremy Buhler, Roger Chamberlain, Mark Franklin, Kwame Gyang, and Joseph Lancaster.
1 MAVID: Constrained Ancestral Alignment of Multiple Sequence Author: Nicholas Bray and Lior Pachter.
Computer Architecture Lecture 24 Parallel Processing Ralph Grishman November 2015 NYU.
GPGPU introduction. Why is GPU in the picture Seeking exa-scale computing platform Minimize power per operation. – Power is directly correlated to the.
Scientific Computing Goals Past progress Future. Goals Numerical algorithms & computational strategies Solve specific set of problems associated with.
Parallelization of mrFAST on GPGPU Hongyi Xin, Donghyuk Lee Milestone II.
Scoring Sequence Alignments Calculating E
continued on next slide
(B.P :51) ( B:P52 ).
The short-read alignment in distributed memory environment
Hire Toyota Innova in Delhi for Outstation Tour
                                                                                                                                                                                                                                                
continued on next slide
continued on next slide
CSC2431 February 3rd 2010 Alecia Fowler
Ашық сабақ 7 сынып Файлдар мен қапшықтар Сабақтың тақырыбы:
Windows басқару элементтері
Қош келдіңіздер!.
Информатика пән мұғалімі : Аитова Карима.
continued on next slide
I have… I have… Who has 3:40? Who has 12:20? I have… I have…
continued on next slide
Presentation transcript:

Next generation read mapping on GPUs Cole Trapnell

Next gen sequencing Solexa/Illumina, AB SOLiD, etc produce many short (25-50bp) sequencing reads. Need to map these back to a reference genome

GPGPU Programming Previously wrote MUMmerGPU with Mike Schatz Finds exact substring matches between reads and a reference using the graphics card Reads mapped in parallel with CUDA

Landau-Vishkin aaattcct-ttagacccattttagcccttca ||||X||| |||||||||||||||||||||| aaattcctcttagacccattttagcccttca

Streaming reads and reference All Reads For each read: 1.Find all exact substring matches ≥ l on the GPU 2.Filter matches to discard redundant ones 3.Extend exact matches left and right to obtain inexact alignments 4.Report end to end inexact alignments Align all reads to a sliding window of the reference