Efficient Experimental String Matching by Weak Factor Recognition*-Reference-Cited by-同舟云学术

Efficient Experimental String Matching by Weak Factor Recognition*

Published:2001 Issue: Volume: Page:51-72
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Allauzen Cyril,Crochemore Maxime,Raffinot Mathieu

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48194-X_5

Reference11 articles.

1. C. Allauzen. Combinatoire sur les mots et recherche de motifs (Combinatorics on words and string matching). PhD thesis, Université de Marne-la-Vallée, 2001.

2. Lect Notes Comput Sci;C. Allauzen,1999

3. C. Allauzen and M. Raffinot. Factor oracle of a set of words. Technical Report 99-11, Institut Gaspard-Monge, Université de Marne-la-Vallée, 1999. http://www-igm.univ-mlv.fr/~raffinot/ftp/IGM99-11-english.ps.gz .

4. R.A. Baeza-Yates. Searching subsequences. Theor. Comput. Sci., 78(2):363–376, 1991.

5. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci., 40(1):31–55, 1985.

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

1. An efficient parallel algorithm for exact multi-pattern matching;Security and Communication Networks;2014-09-21

2. Fast Multi-Pattern String Matching Algorithms Based on Q-Grams Bit-Parallelism Filter and Hash;Lecture Notes in Electrical Engineering;2012-11-06

3. A Bit-Parallel Exact String Matching Algorithm for Small Alphabet;Frontiers in Algorithmics;2009

4. On the Structure of Consistent Partitions of Substring Set of a Word;Frontiers in Algorithmics;2009

5. THE STRUCTURE OF FACTOR ORACLES;International Journal of Foundations of Computer Science;2007-08