3 search results - page 1 / 1 » From Nondeterministic Suffix Automaton to Lazy Suffix Tree |
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
STACS
1992
Springer
13 years 10 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
CSR
2006
Springer
13 years 10 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...