论文信息 - IAC: A Real-Time Multi-Pattern Matching Algorithm Based on Aho-Corsick Algorithm

IAC: A Real-Time Multi-Pattern Matching Algorithm Based on Aho-Corsick Algorithm

This paper describes IAC: a real-time multi-pattern matching algorithm which is based on Aho-Corsick Algorithm. The algorithm introduces a ReversoGto Function into AC finite state pattern matching machine. It supports inserting and deleting pattern in real-time without reconstructing the finite state pattern matching machine. The consumption of inserting and deleting operation is negligible. The algorithm has been implemented on an advertising system.

Yu He | Weitong Huang | Weitong Huang | Yu He

[1] Udi Manber,et al. A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING , 1999 .

[2] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[3] Enno Ohlebusch,et al. Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.

[4] Roberto Grossi,et al. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..

[5] Peter F. Stadler,et al. Fast Mapping of Short Sequences with Mismatches, Insertions and Deletions Using Index Structures , 2009, PLoS Comput. Biol..

[6] Roberto Grossi,et al. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.

[7] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.

[8] Beate Commentz-Walter,et al. A String Matching Algorithm Fast on the Average , 1979, ICALP.