The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Engineering Small Space Dictionary Matching
[article]
2013
arXiv
pre-print
The dictionary matching problem is to locate occurrences of any pattern among a set of patterns in a given text. Massive data sets abound and at the same time, there are many settings in which working space is extremely limited. We introduce dictionary matching software for the space-constrained environment whose running time is close to linear. We use the compressed suffix tree as the underlying data structure of our algorithm, thus, the working space of our algorithm is proportional to the
arXiv:1301.6428v1
fatcat:5k34y7ew2jb5fbgvpu2xj7snn4