274 search results - page 10 / 55 » Approximating Edit Distance Efficiently |
ICDE
2003
IEEE
14 years 11 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
CPM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
RSA
2008
13 years 9 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
BIBE
2005
IEEE
14 years 3 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...