Adaptive dictionary matching

Authors:
Amihood Amir;Martin Farach
Affiliations:
-;-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 10

Highly efficient dictionary matching in parallel

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Multiple matching of rectangular patterns

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Dynamic dictionary matching

Journal of Computer and System Sciences
Optimal parallel dictionary matching and compression (extended abstract)

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Improved dynamic dictionary matching

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Indexing and Dictionary Matching with One Error

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Dictionary matching and indexing with errors and don't cares

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Dynamic dictionary matching and compressed suffix trees

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Compressed indexes for dynamic text collections

ACM Transactions on Algorithms (TALG)
Dynamic dictionary matching using inverted lists

ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Semiadaptive and fully adaptive dictionary matching algorithms are presented. In the fully adaptive algorithm, the dictionary is processed in time O( mod D mod log mod D mod ). Inserting a new pattern P/sub k+1/ into the dictionary can be done in time O mod P/sub K+1/ mod log mod D mod ). A dictionary pattern can be deleted in time O(log mod D mod ). Text scanning is accomplished in time O( mod T mod log mod D mod ). 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.