910 search results - page 41 / 182 » Detecting False Matches in String Matching Algorithms |
121
click to vote
SIGIR
2010
ACM
14 years 9 months ago
2010
ACM
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
121
click to vote
JUCS
2010
15 years 1 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
113
click to vote
PR
2002
15 years 2 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
121
click to vote
CSB
2004
IEEE
15 years 6 months ago
2004
IEEE
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
107
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...