178 search results - page 10 / 36 » Fast Algorithms for Top-k Approximate String Matching |
92
Voted
DASFAA
2003
IEEE
15 years 2 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...
82
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
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...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
111
click to vote
ICDAR
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...