Rxivist logo

LEAP: A Generalization Of The Landau-Vishkin Algorithm With Custom Gap Penalties

By Hongyi Xin, Jeremie Kim, Sunny Nahar, Can Alkan, Onur Mutlu

Posted 02 May 2017
bioRxiv DOI: 10.1101/133157

Motivation: Approximate String Matching is a pivotal problem in the field of computer science. It serves as an integral component for many string algorithms, most notably, DNA read mapping and alignment. The improved LV algorithm proposes an improved dynamic-programming strategy over the banded Smith-Waterman algorithm but suffers from support of a limited selection of scoring schemes. In this paper, we propose the Leaping Toad problem, a generalization of the approximate string matching problem, as well as LEAP, a generalization of the Landau-Vishkin's algorithm that solves the Leaping Toad problem under a broader selection of scoring schemes. Results: We benchmarked LEAP against 3 state-of-the-art approximate string matching implementations. We show that when using a bit-vectorized De Bruijn sequence based optimization, LEAP is up to 7.4x faster than the state-of-the-art bit-vector Levenshtein distance implementation and up to 32x faster than the state-of-the-art affine-gap-penalty parallel Needleman-Wunsch Implementation.

Download data

  • Downloaded 1,084 times
  • Download rankings, all-time:
    • Site-wide: 12,152 out of 103,705
    • In bioinformatics: 1,912 out of 9,474
  • Year to date:
    • Site-wide: 35,594 out of 103,705
  • Since beginning of last month:
    • Site-wide: 16,619 out of 103,705

Altmetric data

Downloads over time

Distribution of downloads per paper, site-wide


Sign up for the Rxivist weekly newsletter! (Click here for more details.)