GPU Acceleration of DNA Alignment Algorithms of Long Reads for DNA Assembly

Third generation sequencing machines produce reads with tens of thousands of base pairs.<br/>To perform de novo assembly, all reads must be compared with every other read to find overlaps.<br/>Finding overlaps with the optimal Smith-Waterman is not feasible, since the complexity of Smith-Waterman is quadratic with the length of the reads.<br/...