The edit distance (aka the Levenshtein distance) between two strings is defined as the
minimum number of insertions, deletions or substitutions of symbols needed to transform …

Classic similarity measures of strings are longest common subsequence and Levenshtein
distance (ie, The classic edit distance). A classic similarity measure of curves is dynamic …

The CFG recognition problem is as follows: given a context-free grammar G and a string w of
length n, decide whether w can be obtained from G. This is the most basic parsing question …

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 a new distributed model of probabilistically checkable proofs (PCP). A satisfying
assignment x∈{0, 1} n to a CNF formula φ is shared between two parties, where Alice …

Sublinear Time Algorithms Page 1 Copyright © by SIAM. Unauthorized reproduction of this article
is prohibited. SIAM J. DISCRETE MATH. c 2011 Society for Industrial and Applied Mathematics …

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 …

It is a major open problem whether the (\min,+)-product of two n*n matrices has a truly
subcubic (ie, O(n^3-ε) for ε>0) time algorithm; in particular, since it is equivalent to the …

We show how to compute the edit distance between two strings of length n up to a factor of 2
(O-tilde (sqrt (log n))) in n (1+ o (1)) time. This is the first sub-polynomial approximation …

Abstract Motivation Segmental duplications (SDs) or low-copy repeats, are segments of
DNA> 1 Kbp with high sequence identity that are copied to other regions of the genome …