Table of Contents Abstract 1Introduction1.1Contributions 1.2Previous work1.2.1Needleman-Wunsch 1.2.2Graph algorithms 1.2.3Computational volumes 1.2.4Parallelism 1.2.5Tools 2Preliminaries 3Methods3.1Band-doubling 3.2Blocks 3.3Memory 3.4SIMD 3.5SIMD-friendly sequence profile 3.6Traceback 3.7A*3.7.1Bulk-contours update 3.7.2Pre-pruning 3.8Determining the rows to compute3.8.1Sparse heuristic invocation 3.9Incremental doubling 4Results4.1Setup 4.2Comparison with other aligners 4.3Effects of method...
