Finding Patterns with Variable Length Gaps or Don’t Cares-Reference-Cited by-同舟云学术

Finding Patterns with Variable Length Gaps or Don’t Cares

Published:2006 Issue: Volume: Page:146-155
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Rahman M. Sohel,Iliopoulos Costas S.,Lee Inbok,Mohamed Manal,Smyth William F.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11809678_17.pdf

Reference18 articles.

1. Aho, A., Corasick, M.: Efficient string matching: an aid to bibliographic search. Communications of the ACM 18, 333–340 (1975)

2. Akutsu, T.: Approximate string matching with variable length don’t care characters. IEICE Trans. Information and Systems E79-D, 1353–1354 (1996)

3. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. In: Proceedings of the Symposium on Discrete Algorithms (SODA 2000), pp. 794–803 (2000)

4. Baeza-Yates, R., Gonnet, G.: A new approach to text searching. Communications of the ACM 35, 74–82 (1992)

5. Cole, R., Hariharan, R.: Approximate string matching: a faster simpler algorithm. In: Proceedings of the Symposium on Discrete Algorithms (SODA 1998), pp. 463–472 (1998)

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

1. Suffix array for multi-pattern matching with variable length wildcards;Intelligent Data Analysis;2021-03-04

2. Detecting Pattern Efficiently with Don’t Cares;Proceedings of the 21st EANN (Engineering Applications of Neural Networks) 2020 Conference;2020

3. Multi-pattern matching with variable-length wildcards using suffix tree;Pattern Analysis and Applications;2018-09-25

4. Efficient Pattern Matching in Elastic-Degenerate Texts;Language and Automata Theory and Applications;2017

5. Approximate pattern matching with gap constraints;Journal of Information Science;2016-07-10