This work implements a dynamic programming algorithm for performing local sequence alignment. Through parallelism, it can run 136X times faster than a software running the same algorithm.
-
Updated
Jul 4, 2019 - Verilog
This work implements a dynamic programming algorithm for performing local sequence alignment. Through parallelism, it can run 136X times faster than a software running the same algorithm.
Add a description, image, and links to the short-read topic page so that developers can more easily learn about it.
To associate your repository with the short-read topic, visit your repo's landing page and select "manage topics."