{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:40:10Z","timestamp":1745944810467,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357947"},{"type":"electronic","value":"9783642357954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35795-4_72","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T09:49:42Z","timestamp":1357292982000},"page":"572-579","source":"Crossref","is-referenced-by-count":1,"title":["Speeding Up Double-Array Trie Construction for String Matching"],"prefix":"10.1007","author":[{"given":"Niu","family":"Shuai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Yanbing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Xinbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"72_CR1","unstructured":"http:\/\/linux.thai.net\/~thep\/datrie\/datrie.html"},{"key":"72_CR2","unstructured":"http:\/\/urlblacklist.com\/"},{"key":"72_CR3","unstructured":"http:\/\/www.snort.org\/"},{"issue":"6","key":"72_CR4","doi-asserted-by":"publisher","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. Communications of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"issue":"10","key":"72_CR5","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"Boyer, R., Moore, J.: A fast string searching algorithm. Communications of the ACM\u00a020(10), 761\u2013772 (1977)","journal-title":"Communications of the ACM"},{"issue":"1","key":"72_CR6","first-page":"322","volume":"6","author":"J.H. Morris","year":"1977","unstructured":"Morris, J.H., Knuth, D.E., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(1), 322\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"72_CR7","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/359168.359175","volume":"22","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E., Yao, A.C.: Storing a Sparse Table. Communications of the ACM\u00a022(11), 606\u2013611 (1979)","journal-title":"Communications of the ACM"},{"key":"72_CR8","unstructured":"Aho, A., Sethi, R., Ullman, J.: Compilers: Principles, Techniques, and Tools. Addison-Wesley (1985)"},{"issue":"9","key":"72_CR9","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1109\/32.31365","volume":"15","author":"J. Aoe","year":"1989","unstructured":"Aoe, J.: An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering\u00a015(9), 1066\u20131077 (1989)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"8","key":"72_CR10","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/32.31357","volume":"15","author":"J. Aoe","year":"1989","unstructured":"Aoe, J.: An Efficient Implementation of Static String Pattern Matching Machines. IEEE Transactions on Software Engineering\u00a015(8), 1010\u20131016 (1989)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"9","key":"72_CR11","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1002\/spe.4380220902","volume":"22","author":"J. Aoe","year":"1992","unstructured":"Aoe, J., Morimoto, K.: An Efficient Implementation of Trie Structures. Software-Practice and Experience\u00a022(9), 695\u2013721 (1992)","journal-title":"Software-Practice and Experience"},{"issue":"3","key":"72_CR12","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/69.506713","volume":"8","author":"J. Aoe","year":"1996","unstructured":"Aoe, J., Morimoto, K., Shishibori, M., Park, K.-H.: A trie compaction algorithm for a large set of keys. IEEE Transactions on Knowledge and Data Engineering\u00a08(3), 476\u2013491 (1996)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"72_CR13","doi-asserted-by":"crossref","unstructured":"Morita, K., Tanaka, A., Fuketa, M., Aoe, J.: Implementation of Update Algorithms for a Double-Array Structure. In: 2001 IEEE International Conference on Systems, Man, and Cybernetics, pp. 494\u2013499 (2001)","DOI":"10.1109\/ICSMC.2001.969862"},{"key":"72_CR14","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings: Practical on-line search algorithms for texts and biological sequences (2002)","DOI":"10.1017\/CBO9781316135228"},{"key":"72_CR15","unstructured":"Tuck, N., Sherwood, T., Calder, B., Varghese, G.: Deterministic Memory-Efficient String Matching Algorithms for Intrusion Detection. In: IEEE INFOCOM (2004)"}],"container-title":["Communications in Computer and Information Science","Trustworthy Computing and Services"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35795-4_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T15:59:54Z","timestamp":1745942394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35795-4_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357947","9783642357954"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35795-4_72","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}