Construction of Aho Corasick automaton in linear time for integer alphabets

Information Processing Letters

Volumn 98, Issue 2, 2006, Pages 66-72

  Dori, Shiri ^a   Landau, Gad M ^a,b  

^a UNIVERSITY OF HAIFA   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Design of algorithms; String matching; Suffix array; Suffix tree

Indexed keywords

ALGORITHMS; TREES (MATHEMATICS);

DESIGN OF ALGORITHMS; STRING MATCHING; SUFFIX ARRAY; SUFFIX TREE;

SET THEORY;

EID: 32644440602     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.11.019     Document Type: Article

References (17)

1. M.I. Abouelhoda, S. Kurtz, and E. Ohlebusch Replacing suffix trees with enhanced suffix arrays J. Discrete Algorithms 2 1 2004 53 86
2. A.V. Aho, and M.J. Corasick Efficient string matching Comm. ACM 18 6 1975 333 340
3. A. Andersson, S. Nilsson, A new efficient radix sort, in: Proc. 35th IEEE Symp. on Foundations of Computer Science, 1994, pp. 714-721
4. M.T. Chen, and J. Seiferas Efficient and elegant subword-tree construction A. Apostolico Z. Galil Combinatorial Algorithms on Words 1985 Springer-Verlag Berlin 97 107
5. M. Farach, Optimal suffix tree construction with large alphabets, in: Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 137-143
6. G. Gonnet, R. Baeza-Yates, and T. Sinder New indices for text: PAT trees and PAT arrays W.B. Frakes R. Baeza-Yates Information Retrieval: Data Structures and Algorithms 1992 Prentice-Hall Englewood Cliffs, NJ
7. D. Gusfield Algorithms on Strings, Trees, and Sequences 1997 Cambridge University Press Cambridge
8. J. Kärkkäinen, and P. Sanders Simple linear work suffix array construction Proc. 30th Internat. Colloquium on Automata, Languages and Programming (ICALP 03) Lecture Notes in Comput. Sci. vol. 2719 2003 Springer Berlin 943 955
9. D.K. Kim, J.E. Jeon, and H. Park Efficient index data structure with the capabilities of suffix trees and suffix arrays for alphabets of non-negligble size A. Apostolico A. Melucci String Processing and Information Retrieval (SPIRE 04) Lecture Notes in Comput. Sci. vol. 3246 2004 Springer Berlin 138 149
10. D.K. Kim, J.S. Sim, H. Park, and K. Park Linear-time construction of suffix arrays Symp. Combinatorial Pattern Matching (CPM 03) Lecture Notes in Comput. Sci. vol. 2676 2003 Springer Berlin 186 199
11. D.E. Knuth, J.H. Morris Jr., and V.R. Pratt Fast pattern matching in strings SIAM J. Comput. 6 1977 323 350
12. P. Ko, and S. Aluru Space-efficient linear-time construction of suffix arrays Symp. Combinatorial Pattern Matching (CPM 03) Lecture Notes in Comput. Sci. vol. 2676 2003 Springer Berlin 200 210
13. U. Manber, and G. Myers Suffix arrays: A new method for on-line string searches SIAM J. Comput. 22 5 1993 935 948
14. E.M. McCreight A space-economical suffix tree construction algorithm J. ACM 23 2 1976 262 272
15. R. Paige, and R.E. Tarjan Three partition refinement algorithms SIAM J. Comput. 16 6 1987 973 989
16. E. Ukkonen On-line construction of suffix trees Algorithmica 14 1995 249 260
17. P. Weiner, Linear pattern matching algorithm, in: Proc. 14 IEEE Symp. on Switching and Automata Theory, 1973, pp. 1-11