910 search results - page 9 / 182 » Detecting False Matches in String Matching Algorithms |
CPM
2009
Springer
15 years 3 months ago
2009
Springer
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
102
Voted
SODA
1998
ACM
15 years 29 days ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
Copy-move forgeries are parts of the image that are duplicated elsewhere into the same image, often after being modified by geometrical transformations. In this paper we present a...
ICDAR
1999
IEEE
15 years 3 months ago
1999
IEEE
Abstract
102
click to vote
AAAI
2010
15 years 1 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...