Near-Linear Time Edit Distance for Indel Channels

07/06/2020
by   Arun Ganesh, et al.
0

We consider the following model for sampling pairs of strings: s_1 is a uniformly random bitstring of length n, and s_2 is the bitstring arrived at by applying substitutions, insertions, and deletions to each bit of s_1 with some probability. We show that the edit distance between s_1 and s_2 can be computed in O(n ln n) time with high probability, as long as each bit of s_1 has a mutation applied to it with probability at most a small constant. The algorithm is simple and only uses the textbook dynamic programming algorithm as a primitive, first computing an approximate alignment between the two strings, and then running the dynamic programming algorithm restricted to entries close to the approximate alignment. The analysis of our algorithm provides theoretical justification for alignment heuristics used in practice such as BLAST, FASTA, and MAFFT, which also start by computing approximate alignments quickly and then find the best alignment near the approximate alignment. Our main technical contribution is a partitioning of alignments such that the number of the subsets in the partition is not too large and every alignment in one subset is worse than an alignment considered by our algorithm with high probability. Similar techniques may be of interest in the average-case analysis of other problems commonly solved via dynamic programming.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/10/2019

Constant factor approximations to edit distance on far input pairs in nearly linear time

For any T ≥ 1, there are constants R=R(T) ≥ 1 and ζ=ζ(T)>0 and a randomi...
research
04/04/2019

A new algorithm for shape matching and pattern recognition using dynamic programming

We propose a new method for shape recognition and retrieval based on dyn...
research
06/12/2018

Indexed Dynamic Programming to boost Edit Distance and LCSS Computation

There are efficient dynamic programming solutions to the computation of ...
research
07/14/2023

Approximating Edit Distance in the Fully Dynamic Model

The edit distance is a fundamental measure of sequence similarity, defin...
research
05/11/2023

Optimal Algorithms for Bounded Weighted Edit Distance

The edit distance of two strings is the minimum number of insertions, de...
research
07/03/2019

Safe Approximate Dynamic Programming Via Kernelized Lipschitz Estimation

We develop a method for obtaining safe initial policies for reinforcemen...
research
11/12/2017

Longest Alignment with Edits in Data Streams

Analyzing patterns in data streams generated by network traffic, sensor ...

Please sign up or login with your details

Forgot password? Click here to reset