74 search results - page 5 / 15 » Improved Approximate String Matching Using Compressed Suffix... |
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
FCCM
2006
IEEE
15 years 3 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...
80
Voted
BIRD
2008
Springer
14 years 11 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
CIKM
1997
Springer
15 years 1 months ago
1997
Springer
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...