910 search results - page 8 / 182 » Detecting False Matches in String Matching Algorithms |
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
SPIRE
2005
Springer
15 years 5 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...
CLEF
2010
Springer
14 years 9 months ago
2010
Springer
Abstract This paper describes the University of Sheffield entry for the 2nd international plagiarism detection competition (PAN 2010). Our system attempts to identify extrinsic pla...
119
click to vote
ASAP
2004
IEEE
15 years 3 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
ISAAC
1994
Springer
15 years 3 months ago
1994
Springer
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...