910 search results - page 34 / 182 » Detecting False Matches in String Matching Algorithms |
132
Voted
CPM
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
109
Voted
ICAIL
2003
ACM
15 years 8 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
130
click to vote
SPIRE
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
123
Voted
TSP
2008
15 years 2 months ago
2008
We propose a two stage detector consisting of a Subspace Detector (SD) followed by the Whitened Adaptive Beamformer Orthogonal Rejection Test (W-ABORT). The performance analysis sh...
128
click to vote
DSD
2005
IEEE
15 years 8 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...