Add to ORKG[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string against a run-length-encoded string. For an uncompressed string of length n and a compressed string with M runs, the algorithm computes their edit distance in time O(Mn). This result directly implies an O(min{mN, Mn}) time algorithm for strings of lengths m and n with M and N runs, respectively. It improves the previous best known time bound O(mN + Mn). (c) 2007 Elsevier B.V. All rights reserved.[[note]]SC
AbstractThe notion of edit distance arises in very different fields such as self-correcting codes, p...
The notion of edit distance arises in very different fields such as self-correcting codes, parsing t...
Given a context free language L(G) over alphabet Σ and a string s ∈ Σ∗, the language edit distance p...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
We show that the edit distance between two run-length encoded strings of compressed lengths m and n ...
We show how to compute the edit distance between two strings of length n up to a factor of 2Õ( log ...
The edit distance between strings a1 … am and b1 … bn is the minimum cost s of a sequence of editing...
Abstract Background The problem of approximate string matching is important in many different areas ...
The edit distance problem is a classical fundamental problem in computer science in general, and in ...
We prove the first nontrivial communication complexity lower bound for the problem of estimating the...
Abstract We propose three algorithms for string edit distance with duplications and contractions. Th...
AbstractThe notion of edit distance arises in very different fields such as self-correcting codes, p...
The notion of edit distance arises in very different fields such as self-correcting codes, parsing t...
Given a context free language L(G) over alphabet Σ and a string s ∈ Σ∗, the language edit distance p...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
[[abstract]]We propose a new algorithm for computing the edit distance of an uncompressed string aga...
We show that the edit distance between two run-length encoded strings of compressed lengths m and n ...
We show how to compute the edit distance between two strings of length n up to a factor of 2Õ( log ...
The edit distance between strings a1 … am and b1 … bn is the minimum cost s of a sequence of editing...
Abstract Background The problem of approximate string matching is important in many different areas ...
The edit distance problem is a classical fundamental problem in computer science in general, and in ...
We prove the first nontrivial communication complexity lower bound for the problem of estimating the...
Abstract We propose three algorithms for string edit distance with duplications and contractions. Th...
AbstractThe notion of edit distance arises in very different fields such as self-correcting codes, p...
The notion of edit distance arises in very different fields such as self-correcting codes, parsing t...
Given a context free language L(G) over alphabet Σ and a string s ∈ Σ∗, the language edit distance p...