Andrzej Ehrenfeucht
University of Colorado
Ross M. McConnell
Colorado State University
A Simple Algorithm for Constructing the DAWG•Constructing the DAWG in Linear Time
Using the Compact DAWG to Find the Locations of a String in the Text•Variations and Applications
Building the Position Heap•Querying the Position Heap•Time Bounds•Improvements to the Time Bounds
Searching for occurrences of a substring in a text is a common operation familiar to anyone who uses a text editor, word processor, or web browser. It is also the case that algorithms for analyzing textual databases can generate a large number of searches. ...
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
