910 search results - page 24 / 182 » Detecting False Matches in String Matching Algorithms |
121
click to vote
CPM
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
122
click to vote
SIGMOD
2008
ACM
15 years 2 months ago
2008
ACM
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
140
click to vote
DASFAA
2003
IEEE
15 years 8 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
120
click to vote
FCCM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
124
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...