154 search results - page 10 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
120
click to vote
SPIRE
1998
Springer
15 years 3 months ago
1998
Springer
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
NIPS
2008
15 years 1 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
100
Voted
CPM
2000
Springer
15 years 4 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...
107
click to vote
DASFAA
2003
IEEE
15 years 4 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...
87
Voted
FCCM
2006
IEEE
15 years 5 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...