40 search results - page 5 / 8 » Fast Searching in Packed Strings |
ALGORITHMICA
2005
13 years 9 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
BIBM
2009
IEEE
14 years 1 months ago
2009
IEEE
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
SIGIR
2011
ACM
13 years 18 days ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
CSR
2006
Springer
14 years 1 months ago
2006
Springer
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...