Sequencing projects are using paired-end reads to compensate for the relatively short length of the reads obtained by some sequencing technologies such as Illumina. To take advantage of the resulting paired-end reads, we need software that can handle paired-end reads by merging their overlapping parts. There is an ever-growing plethora of these software tools, all trying to be a little better in their respective fields to improve the result. However, none of these tools employ parallelisation on Graphical Processing Units(GPUs) to speed up the merging of the paired-end reads. What we aim to achieve in this project is a respectable speedup compared to existing solutions when it comes to merging of paired-end reads. The speedup might also giv...
The idea of using a graphics processing unit (GPU) for more than simply graphic output purposes has ...
Third generation sequencing machines produce reads with tens of thousands of base pairs.To perform d...
Abstract—Pairwise sequence alignment is the method to find the best matching piece for two sequences...
The rate of scientific discovery depends on the speed at which accurate results and analysis can be...
With the rise of Next-Generation Sequencing (NGS), clinical sequencing services have become more acc...
We propose a family of algorithms for efficiently merging on contemporary GPUs, so that each algorit...
Paired-end sequencing is a next generation sequencing technique that consists of sequencing both str...
This thesis proposes a novel GPU implementation for merging two sorted arrays. We consider the pr...
BACKGROUND: In Overlap-Layout-Consensus (OLC) based de novo assembly, all reads must be compared wit...
In large DNA sequence repositories, archival data storage is often coupled with computers that provi...
In order to handle the massive raw data generated by next generation sequencing (NGS) platforms, GPU...
We describe the design of high-performance parallel radix sort and merge sort routines for manycore ...
With processor clock speeds having stagnated, parallel computing architectures have achieved a break...
Millions of short sequences are produced because of the introduction of next-generation sequencing t...
BACKGROUND: With the maturation of next-generation DNA sequencing (NGS) technologies, the throughput...
The idea of using a graphics processing unit (GPU) for more than simply graphic output purposes has ...
Third generation sequencing machines produce reads with tens of thousands of base pairs.To perform d...
Abstract—Pairwise sequence alignment is the method to find the best matching piece for two sequences...
The rate of scientific discovery depends on the speed at which accurate results and analysis can be...
With the rise of Next-Generation Sequencing (NGS), clinical sequencing services have become more acc...
We propose a family of algorithms for efficiently merging on contemporary GPUs, so that each algorit...
Paired-end sequencing is a next generation sequencing technique that consists of sequencing both str...
This thesis proposes a novel GPU implementation for merging two sorted arrays. We consider the pr...
BACKGROUND: In Overlap-Layout-Consensus (OLC) based de novo assembly, all reads must be compared wit...
In large DNA sequence repositories, archival data storage is often coupled with computers that provi...
In order to handle the massive raw data generated by next generation sequencing (NGS) platforms, GPU...
We describe the design of high-performance parallel radix sort and merge sort routines for manycore ...
With processor clock speeds having stagnated, parallel computing architectures have achieved a break...
Millions of short sequences are produced because of the introduction of next-generation sequencing t...
BACKGROUND: With the maturation of next-generation DNA sequencing (NGS) technologies, the throughput...
The idea of using a graphics processing unit (GPU) for more than simply graphic output purposes has ...
Third generation sequencing machines produce reads with tens of thousands of base pairs.To perform d...
Abstract—Pairwise sequence alignment is the method to find the best matching piece for two sequences...