125 search results - page 2 / 25 » Cross-Domain Approximate String Matching |
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
ISAAC
2001
Springer
15 years 1 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
ALENEX
2007
14 years 10 months ago
2007
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
104
click to vote
CPM
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...