Efficient parameterized string matching-Reference-Cited by-同舟云学术

Efficient parameterized string matching

Published:2006-11 Issue:3 Volume:100 Page:91-96
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Fredriksson Kimmo,Mozgovoy Maxim

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference17 articles.

1. Efficient string matching: an aid to bibliographic search;Aho;Comm. ACM,1975

2. Alphabet dependence in parameterized matching;Amir;Inform. Process. Lett.,1994

3. String searching algorithms revisited;Baeza-Yates,1989

4. A new approach to text searching;Baeza-Yates;Comm. ACM,1992

5. B.S. Baker, Parameterized pattern matching by Boyer–Moore-type algorithms, in: Proceedings of the 6th ACM–SIAM Annual Symposium on Discrete Algorithms, San Francisco, CA, 1995, pp. 541–550

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Practical Power of Automata in Pattern Matching;SN Computer Science;2024-04-06

2. Efficient Structural Matching for RNA Secondary Structure Using Bit-Parallelism;Lecture Notes in Electrical Engineering;2022

3. Computing the Parameterized Burrows–Wheeler Transform Online;String Processing and Information Retrieval;2022

4. A Method to Improve Exact Matching Results in Compressed Text using Parallel Wavelet Tree;Scalable Computing: Practice and Experience;2021-11-24

5. Secure Parameterized Multi-Pattern Matching in Multi-Text Owner Setting;2021 18th International ISC Conference on Information Security and Cryptology (ISCISC);2021-09-01