DeepAI AI Chat
Log In Sign Up

De(con)struction of the lazy-F loop: improving performance of Smith Waterman alignment

09/03/2019
by   Roman Snytsar, et al.
0

Striped variation of the Smith-Waterman algorithm is known as extremely efficient and easily adaptable for the SIMD architectures. However, the potential for improvement has not been exhausted yet. The popular Lazy-F loop heuristic requires additional memory access operations, and the worst-case performance of the loop could be as bad as the nonvectorized version. We demonstrate the progression of the lazy-F loop transformations that improve the loop performance, and ultimately eliminate the loop completely. Our algorithm achieves the best asymptotic performance of all scan-based SW algorithms O(n/p+log(p)), and is very efficient in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/27/2013

Approximation Algorithms for the Loop Cutset Problem

We show how to find a small loop curser in a Bayesian network. Finding s...
05/09/2018

A Proposal for Loop-Transformation Pragmas

Pragmas for loop transformations, such as unrolling, are implemented in ...
08/07/2014

Random Algorithms for the Loop Cutset Problem

We show how to find a minimum loop cutset in a Bayesian network with hig...
06/01/2011

Randomized Algorithms for the Loop Cutset Problem

We show how to find a minimum weight loop cutset in a Bayesian network w...
03/27/2013

On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks

We introduce a new heuristic algorithm for the problem of finding minimu...
05/16/2019

Loop Summarization with Rational Vector Addition Systems (extended version)

This paper presents a technique for computing numerical loop summaries. ...
04/11/2020

Optimizing Cursor Loops in Relational Databases

Loops that iterate over SQL query results are quite common, both in appl...