Adaptive dictionary matching

Author

Amir, Amihood ; Farach, Martin

Author_Institution

Georgia Tech., Atlanta, GA, USA

fYear

1991

fDate

1-4 Oct 1991

Firstpage

760

Lastpage

766

Abstract

Semiadaptive and fully adaptive dictionary matching algorithms are presented. In the fully adaptive algorithm, the dictionary is processed in time O(|D| log |D|). Inserting a new pattern P_k+1 into the dictionary can be done in time O |P_K+1| log |D|). A dictionary pattern can be deleted in time O(log |D|). Text scanning is accomplished in time O(|T| log |D|). Also presented is a parallel version of the algorithm with optimal speedup for the dictionary construction and pattern addition phase and a logarithmic overhead in the text scan phase. The method used incorporates a new way of using suffix trees as well as a new data structure in which the suffix tree is embedded for the sequential algorithm

Keywords

computational complexity; data structures; parallel algorithms; programming theory; adaptive dictionary matching algorithms; data structure; dictionary construction; dictionary pattern; logarithmic overhead; parallel algorithms; pattern deletion; pattern insertion; sequential algorithm; suffix trees; text scanning; Computer science; Concurrent computing; Data structures; Dictionaries; Educational institutions; Hamming distance; Parallel algorithms; Pattern matching; Sequences; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on

Conference_Location

San Juan

Print_ISBN

0-8186-2445-0

Type

conf

DOI

10.1109/SFCS.1991.185445

Filename

185445