Approximate Boyer-Moore String Matching for Small Alphabets-Reference-Cited by-同舟云学术

Approximate Boyer-Moore String Matching for Small Alphabets

Published:2009-02-18 Issue:3 Volume:58 Page:591-609
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Salmela Leena,Tarhio Jorma,Kalsi Petri

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-009-9286-3.pdf

Reference18 articles.

1. Arlazarov, V., Dinic, E., Kronrod, M., Faradzev, I.: On economic construction of the transitive closure of a directed graph. Dokl. Acad. Nauk SSSR 194, 487–488 (1970) (in Russian). English translation in Sov. Math. Dokl. 11, 1209–1210 (1975)

2. Baeza-Yates, R., Gonnet, G.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)

3. Baeza-Yates, R., Gonnet, G.: Fast string matching with mismatches. Inf. Comput. 108(2), 187–199 (1994)

4. Baeza-Yates, R., Perleberg, C.: Fast and practical approximate string matching. Inf. Process. Lett. 59(1), 21–27 (1996)

5. Boyer, R., Moore, J.: A fast string searching algorithm. Commun. ACM 10(20), 762–772 (1977)

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

1. Approximate String Matching with SIMD;The Computer Journal;2021-02-23

2. A randomized Numerical Aligner (rNA);Journal of Computer and System Sciences;2012-11

3. Research on Distributed Intrusion Detection System Based on Mobile Agent;Journal of Computers;2012-08-01

4. Average complexity of backward q-gram string matching algorithms;Information Processing Letters;2012-06

5. A Randomized Numerical Aligner (rNA);Language and Automata Theory and Applications;2010