Sciweavers

BIRTHDAY
2010
Springer
13 years 8 months ago
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 occurren...
Kimmo Fredriksson