{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:59:17Z","timestamp":1782791957816,"version":"3.54.5"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,7,27]],"date-time":"2011-07-27T00:00:00Z","timestamp":1311724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s11432-011-4363-z","type":"journal-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T04:02:29Z","timestamp":1311652949000},"page":"1562-1571","source":"Crossref","is-referenced-by-count":1,"title":["Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm"],"prefix":"10.1007","volume":"54","author":[{"given":"Yue","family":"Hu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"QingShi","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"PeiFeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,7,27]]},"reference":[{"key":"4363_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. Aho","year":"1975","unstructured":"Aho A, Corasick M. Efficient string matching: An aid to bibliographic search. Commun ACM, 1975, 18: 333\u2013340","journal-title":"Commun ACM"},{"key":"4363_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings: Practical On-line Search Algorithms for Texts and Biological Sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro G, Raffitnot M. Flexible Pattern Matching in Strings: Practical On-line Search Algorithms for Texts and Biological Sequences. Cambridge: Cambridge Univercity Press, 2002"},{"key":"4363_CR3","doi-asserted-by":"crossref","unstructured":"Alicherry M, Muthuprasanna M, Kumar V. High speed pattern matching for network IDS\/IPS. In: Proceedings of IEEE International Conference on Network Protocols, Santa Barbara, USA, 2006. 187\u2013196","DOI":"10.1109\/ICNP.2006.320212"},{"key":"4363_CR4","doi-asserted-by":"crossref","unstructured":"Baker Z, Prasanna V. High-throughput linked-pattern matching for intrusion detection systems. In: Proceedings of the 2005 ACM Symposium on Architecture for Networking and Communications Systems, Princeton, USA, 2005. 193\u2013202","DOI":"10.1145\/1095890.1095918"},{"key":"4363_CR5","doi-asserted-by":"crossref","unstructured":"Baker Z K, Prasanna V K. Time and area efficient pattern matching on FPGAs. In: Proceedings of the ACM\/SIGDA 12th International Symposium on Field Programmable Gate Arrays, Monterey, USA, 2004. 223\u2013232","DOI":"10.1145\/968280.968312"},{"key":"4363_CR6","doi-asserted-by":"crossref","unstructured":"Bispo J, Sourdis I, Cardoso J M, et al. Regular expression matching for reconfigurable packet inspection. In: Proceedings of IEEE International Conference on Field Programmable Technology, Bangkok Thailand, 2006. 119\u2013126","DOI":"10.1109\/FPT.2006.270302"},{"key":"4363_CR7","doi-asserted-by":"crossref","unstructured":"Clark C R, Schimmel D E. Scalable pattern matching for high speed networks. In: Proceedings of 12th IEEE Symposium on Field-Programmable Custom Computing Machines, Napa Valley, USA, 2004. 249\u2013257","DOI":"10.1109\/FCCM.2004.50"},{"key":"4363_CR8","doi-asserted-by":"crossref","first-page":"1781","DOI":"10.1109\/JSAC.2006.877131","volume":"24","author":"S. Dharmapurikar","year":"2006","unstructured":"Dharmapurikar S, Lockwood J W. Fast and scalable pattern matching for network intrusion detection systems. IEEE J Select Areas Commun, 2006, 24: 1781\u20131792","journal-title":"IEEE J Select Areas Commun"},{"key":"4363_CR9","volume-title":"The Art of Computer Programming, Vol. 3, Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth D. The Art of Computer Programming, Vol. 3, Sorting and Searching. Boston: Addison-Wesley, 1973"},{"key":"4363_CR10","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1360\/jos160676","volume":"16","author":"L. T. He","year":"2005","unstructured":"He L T, Fang B X, Yu X Z. A time optimal exact string matching algorithm (in Chinese). J Softw, 2005, 16: 676\u2013683","journal-title":"J Softw"},{"key":"4363_CR11","doi-asserted-by":"crossref","unstructured":"Kumar S, Dharmapurikar S, Yu F. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: Proceedings of SIGCOMM, Pisa, Italy, 2006. 339\u2013350","DOI":"10.1145\/1151659.1159952"},{"key":"4363_CR12","doi-asserted-by":"crossref","unstructured":"Liu Y B, Yang Y F, Liu P, et al. Table compression method for extended Aho-Corasick automaton. In: Proceedings of the 14th International Conference on Implementation and Application of Automata, Sydney, Australia, 2009. 84\u201393","DOI":"10.1007\/978-3-642-02979-0_12"},{"key":"4363_CR13","volume-title":"Research of string matching for Internet content filtering (in Chinese)","author":"P. Liu","year":"2005","unstructured":"Liu P. Research of string matching for Internet content filtering (in Chinese). Dissertation for Master\u2019s Degree. Beijing: Institute of Computing Technology, Chinese Academy of Sciences, 2005"},{"key":"4363_CR14","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/spe.785","volume":"37","author":"J. Nieminen","year":"2007","unstructured":"Nieminen J, Kilpel P. Efficient implementation of Aho-Corasick pattern matching automata using unicode. Softw Pract Exper, 2007, 37: 669\u2013690","journal-title":"Softw Pract Exper"},{"key":"4363_CR15","doi-asserted-by":"crossref","unstructured":"Nishimuar T, Fukamachi S, Shinohara T. Speed-up of Aho-Corasick pattern matching machines by rearranging states. In: Proceedings of SPIRE, Laguna de San Rafael, Chile, 2001. 175\u2013185","DOI":"10.1109\/SPIRE.2001.989753"},{"key":"4363_CR16","doi-asserted-by":"crossref","unstructured":"Papaefstathiou I, Dimopoulos V, Pnevmatikatos D. A memory-efficient reconfigurable Aho-Corasick FSM implementation for intrusion detection systems. In: Proceedings of IEEE ICSAMOS, Samos, Greece, 2007. 186\u2013193","DOI":"10.1109\/ICSAMOS.2007.4285750"},{"key":"4363_CR17","doi-asserted-by":"crossref","unstructured":"Piyachon P, Luo Y. Efficient memory utilization on network processors for deep packet inspection. In: Proceedings of the 2006 ACM\/IEEE Symposium on Architectures for Networking and Communications Systems, San Jose, USA, 2006. 71\u201380","DOI":"10.1145\/1185347.1185358"},{"key":"4363_CR18","doi-asserted-by":"crossref","unstructured":"Rejeb J, Srinivasan M. Extension of Aho-Corasick algorithm to detect injection attacks. Adv Comput Inf Sci Eng, 2008, 207\u2013212","DOI":"10.1007\/978-1-4020-8741-7_37"},{"key":"4363_CR19","first-page":"940","volume":"41","author":"H. Song","year":"2004","unstructured":"Song H, Dai Y Q. A new fast string matching algorithm for content filtering and detection (in Chinese). Comput Res Dev, 2004, 41: 940\u2013948","journal-title":"Comput Res Dev"},{"key":"4363_CR20","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/TVLSI.2007.912036","volume":"16","author":"I. Sourdis","year":"2008","unstructured":"Sourdis I, Pnevmatikatos D N, Vassiliadis S. Scalable multigigabit pattern matching for packet inspection. IEEE Trans VLSI Syst, 2008, 16: 156\u2013166","journal-title":"IEEE Trans VLSI Syst"},{"key":"4363_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1132462.1132464","volume":"3","author":"L. Tan","year":"2006","unstructured":"Tan L, Brotherton B, Sherwood T. Bit-split string-matching engines for intrusion detection and prevention. ACM Trans Archit Code Optim, 2006, 3: 3\u201334","journal-title":"ACM Trans Archit Code Optim"},{"key":"4363_CR22","unstructured":"Tripp G. A finite-state machine based string matching system for intrusion detection on high-speed networks. In: Proceedings of EICAR, Saint Julians, Malta, 2005. 26\u201340"},{"key":"4363_CR23","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1294313.1294314","volume":"35","author":"K. K. Tseng","year":"2007","unstructured":"Tseng K K, Lai Y C, Lin Y D, et al. A fast scalable automaton matching accelerator for embedded content processors. ACM SIGARCH Comput Archit News, 2007, 35: 38\u201343","journal-title":"ACM SIGARCH Comput Archit News"},{"key":"4363_CR24","unstructured":"Tuck N, Sherwood T, Calder B, et al. Deterministic memory efficient string matching algorithms for intrusion detection. In: Proceedings of the IEEE INFOCOM, Hong Kong, China, 2004. 333\u2013340"},{"key":"4363_CR25","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S1007-0214(07)70137-2","volume":"12","author":"J. M. Yu","year":"2007","unstructured":"Yu J M, Xue Y B, Li J. Memory efficient string matching algorithm for network intrusion management system. Tsinghua Sci Technol, 2007, 12: 585\u2013593","journal-title":"Tsinghua Sci Technol"},{"key":"4363_CR26","doi-asserted-by":"crossref","unstructured":"Hu Y, Wang P F, Hwang K. A fast algorithm for multi-string matching based on automata optimization. In: Proceedings of IEEE International Conference on Future Computer and Communication, Wuhan, China, 2010","DOI":"10.1109\/ICFCC.2010.5497448"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4363-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4363-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4363-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T12:23:34Z","timestamp":1741350214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4363-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,27]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["4363"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4363-z","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,27]]}}}