102 search results - page 3 / 21 » Fast exact string matching algorithms |
AAAI
2010
13 years 11 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
CPM
1998
Springer
14 years 2 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
SOFSEM
2005
Springer
14 years 3 months ago
2005
Springer
CPM
2009
Springer
14 years 1 months ago
2009
Springer
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...