96 search results - page 4 / 20 » Improved Algorithms for Approximate String Matching (Extende... |
SPIRE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
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...
DASFAA
2003
IEEE
15 years 3 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...
ICCSA
2010
Springer
15 years 4 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
116
click to vote
STRINGOLOGY
2004
14 years 11 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...