From Nondeterministic Suffix Automaton to Lazy Suffix Tree

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 occurrences of P in T. The well-known Backward-Nondeterministic-DAWG-Matching (BNDM) algorithm is one of the most efficient algorithm for short to moderate length patterns. In this paper

• Type: Conference
• Year: 2010
• Where: BIRTHDAY
• Authors: Kimmo Fredriksson
• Keywords: Algorithms, Applied Computing, BIRTHDAY 2010, Efficient Algorithm, Nondeterministic Suffix Automaton