1. Parallel Implementation of BWT Under the Guidance of : Prof. Kolin Paul Presented By: Lalchand Gaurav Jain

2. Application Domain & objective Use of Bwt in Sequence assembly Bwt Implementation on GPU Bwt Implementation for larger Genome Comparative study Agenda

3. Application Domain & objective Use of Bwt in Sequence assembly Bwt Implementation on GPU Bwt Implementation for larger Genome Comparative study Agenda

4. Application Domain & objective Use of Bwt in Sequence assembly Bwt Implementation on GPU Bwt Implementation for larger Genome Comparative study Agenda

5. Application Domain & objective Use of Bwt in Sequence assembly Bwt Implementation on GPU Bwt Implementation for larger Genome Comparative study Agenda

6. Application Domain & objective Use of Bwt in Sequence assembly Bwt Implementation on GPU Bwt Implementation for larger Genome Comparative study Agenda

7. Application Domain & Objective To present an efficient implementation of BWT for larger Genome. Analyzing Gene expression Mapping variations between individuals Mapping homologous Proteins Assembling Genome of Organism

8. Indexing Contigs Use of Bwt in Sequence assembly SGA Intermediate size :10^18 Genome e

9. 9 Burrows-Wheeler Transform 5$ACGTA 4A$ACGT 3TA$ACG 2GTA$AC 1CGTA$A 0ACGTA$ Input: A C G T A $ Output: A T $ A C G indices: 0 1 2 3 4 5 5$ACGTA 4A$ACGT 0ACGTA$ 1CGTA$A 2GTA$AC 3TA$ACG indices: 5 4 0 1 2 3 Bwt[i] = ref [ SA[i] -1] {Bwt[i] = $ when S(i)= 0}

10.  Implemented Bwt on GPU  Bitonic sort  Implemented Bwt for larger genome  In mutipass (GPU and CPU) Work Done

11. Why Bitonic ??... Concatenations of two sub-sequences sorted in opposite directions A cyclic shift of elements Implemented by comparator networks Work in place No Communication Naturally suitable for SIMD architectures Each thread executing same code but different data O(log 2 n) time and O(nlog 2 n) work

12. Bwt Procedure For larger Genome Genome Read & store (CPU) Bitonic_sort_step Calcualte Gap array Merge Suffix array (CPU) Calcualte Gt array Suffix - > BWT Suffix array (CPU) 2*CHUNK

13. Comparison between Parallel BWT(GPU) and serial BWT (CPU) Serial Bwt : Does not work for large files

14. Comparison between Parallel BWT (GPU) and Parallel BWT (CPU)

15. Evaluation for larger Genome

16. References : Lightweight Data Indexing and Compression in External Memor Paolo Ferragina 1, Travis Gagie2, and Giovanni Manzini Fast in-place sorting with CUDA based on bitonic sort :Hagen Peters Rapid Parallel Genome Indexing with MapReduce :Rohith K. Menon M. Burrows and D. Wheeler. A Block-Sorting Lossless Data Compression Algorithm. Technical report Lightweight Data Indexing and Compression in External Memory :Paolo Ferragina Parallel Lossless Data Compression on the GPU : Yao Zhang

17. Thanks