1272 search results - page 29 / 255 » Approximate Parameterized Matching |
SPIRE
2005
Springer
15 years 4 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
CPM
1999
Springer
15 years 3 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
JSA
2008
14 years 11 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
VLDB
2005
ACM
15 years 4 months ago
2005
ACM
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
ICDAR
1999
IEEE
15 years 3 months ago
1999
IEEE
Abstract