The edit distance between two strings is defined as the smallest number of insertions,
deletions, and substitutions that need to be made to transform one of the strings to another …

We present an algorithm for approximating the edit distance between two strings of length n
in time n 1+ ε, for any, up to a constant factor. Our result completes a research direction set …

Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance
(UL) are three fundamental string problems that can be classically solved in near linear time …

We design an almost linear-size sketching scheme for computing edit distance up to a given
threshold k. The scheme consists of two algorithms, a sketching algorithm and a recovery …

Longest common subsequence (LCS) is a classic and central problem in combinatorial
optimization. While LCS admits a quadratic time solution, recent evidence suggests that …

For any T≥ 1, there are constants R= R (T)≥ 1 and ζ= ζ (T)> 0 and a randomized algorithm
that takes as input an integer n and two strings x, y of length at most n, and runs in time O (n …

Edit distance is a measure of similarity of two strings based on the minimum number of
character insertions, deletions, and substitutions required to transform one string into the …

In this paper we provide a new locally consistent decomposition of strings. Each string x is
decomposed into blocks that can be described by grammars of size O (k)(using some …

Real-world data often comes in compressed form. Analyzing compressed data directly
(without first decompressing it) can save space and time by orders of magnitude. In this …

The edit distance is a fundamental measure of sequence similarity, defined as the minimum
number of character insertions, deletions, and substitutions needed to transform one string …