{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:46:52Z","timestamp":1725907612671},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319584232"},{"type":"electronic","value":"9783319584249"}],"license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-58424-9_20","type":"book-chapter","created":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T03:33:44Z","timestamp":1502508824000},"page":"355-367","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Search in Digital Forensics"],"prefix":"10.1007","author":[{"given":"Slobodan","family":"Petrovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"20_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. (1975). Efficient string matching: An aid to bibliographic search. Communications of the ACM, 18, 333\u2013340.","journal-title":"Communications of the ACM"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., & Gonnet, G. (1992). A new approach to text searching. Communications of the ACM, 35, 74\u201382.","journal-title":"Communications of the ACM"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Barton, C., Iliopoulos, C., & Pissis, S. (2015). Average-case optimal approximate circular string matching. In A. Dediu, E. Formenti, C. Mar\u00edn-Vide, & B. Truthe (Eds.), Language and automata theory and applications (pp.\u00a085\u201396).","DOI":"10.1007\/978-3-319-15579-1_6"},{"key":"20_CR4","unstructured":"Bro. \nhttps:\/\/www.bro.org\/\n\n. Cited April 25, 2017"},{"key":"20_CR5","unstructured":"Elasticsearch. \nhttps:\/\/www.elastic.co\/products\/elasticsearch\n\n. Cited May 9, 2017"},{"key":"20_CR6","unstructured":"Faro, S., & Lecroq, T. (2012). Twenty years of bit-parallelism in string matching. In J. Holub, B. Watson, J. \u017dd\u00e1rek (Eds.), Festschrift for Bo\u0159ivoj Melichar (pp.\u00a072\u2013101)."},{"key":"20_CR7","unstructured":"Forensic Toolkit (FTK). \nhttp:\/\/accessdata.com\/solutions\/digital-forensics\/forensic-toolkit-ftk\n\n. Cited May 9, 2017"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Kuri, J., & Navarro, G. (2000). Fast multipattern search algorithms for intrusion detection. In String processing and information retrieval (SPIRE 2000) (pp.\u00a0169\u2013180).","DOI":"10.1109\/SPIRE.2000.878193"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"94","DOI":"10.7763\/IJET.2016.V8.865","volume":"8","author":"N. Le-Dang","year":"2016","unstructured":"Le-Dang, N., Le, D., & Le, V. (2016). A new multiple-pattern matching algorithm for the network intrusion detection system. IACSIT International Journal of Engineering and Technology, 8, 94\u2013100.","journal-title":"IACSIT International Journal of Engineering and Technology"},{"key":"20_CR10","first-page":"707","volume":"10","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V. (1966). Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics-Doklady, 10, 707\u2013710.","journal-title":"Soviet Physics-Doklady"},{"key":"20_CR11","unstructured":"Lucene, A. \nhttp:\/\/lucene.apache.org\/\n\n. Cited April 25, 2017"},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1162\/0891201042544938","volume":"30","author":"S. Mihov","year":"2004","unstructured":"Mihov, S., & Schulz, K. (2004). Fast approximate search in large dictionaries. Journal of Computational Linguistics, 30, 451\u2013477.","journal-title":"Journal of Computational Linguistics"},{"issue":"4","key":"20_CR13","first-page":"1","volume":"5","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., & Raffinot, M. (2000). Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithms, 5(4), 1\u201336.","journal-title":"ACM Journal of Experimental Algorithms"},{"key":"20_CR14","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., & Raffinot, M. (2002). Flexible pattern matching in strings: Practical on-line search algorithms for texts and biological sequences. New York: Cambridge University Press."},{"key":"20_CR15","unstructured":"Petrovi\u0107, S. (2016). A SPAM filtering scenario using bit-parallel approximate search. In P. Gomila, & M. Hinarejos (Eds.), Proceedings of the XIV Spanish Conference on Cryptology and Information Security (RECSI2016) (pp.\u00a0186\u2013190)."},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10032-002-0082-8","volume":"5","author":"K. Shulz","year":"2002","unstructured":"Shulz, K., & Mihov, S. (2002). Fast string correction with Levenshtein automata. International Journal on Document Analysis and Recognition (IJDAR), 5, 67\u201385.","journal-title":"International Journal on Document Analysis and Recognition (IJDAR)"},{"key":"20_CR17","unstructured":"Shrestha, A., & Petrovi\u0107, S. (2015). Approximate search with constraints on indels with application in SPAM filtering. In V. Oleshchuk (Ed.) Proceedings of Norwegian Information Security Conference (NISK-2015) (pp.\u00a022\u201333)."},{"key":"20_CR18","unstructured":"Shrestha, A., & Petrovi\u0107, S. (2016). Constrained row-based bit-parallel search in intrusion detection. In A. Kolosha (Ed.) Proceedings of Norwegian Information Security Conference (NISK-2016) (pp.\u00a068\u201379)."},{"key":"20_CR19","unstructured":"Snort. \nhttps:\/\/www.snort.org\/\n\n. Cited April 25, 2017"},{"key":"20_CR20","unstructured":"Sung-il, O., Min, S., & Inbok, L. (2013). An efficient bit-parallel algorithm for IDS. In: A. Aghdam, & M. Guo (Eds.) Proceedings of RACS 2013 (pp.\u00a043\u201344)."},{"key":"20_CR21","unstructured":"Suricata. \nhttps:\/\/suricata-ids.org\/\n\n. Cited April 25, 2017"},{"key":"20_CR22","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/MM.2006.5","volume":"26","author":"L. Tan","year":"2006","unstructured":"Tan, L., & Sherwood, T. (2006). Architectures for bit-split string scanning in intrusion detection. IEEE Micro, 26, 110\u2013117.","journal-title":"IEEE Micro"},{"key":"20_CR23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., & Manber, U. (1992). Fast text searching allowing errors. Communications of the ACM, 35, 83\u201391.","journal-title":"Communications of the ACM"}],"container-title":["Computer and Network Security Essentials"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58424-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T03:44:10Z","timestamp":1502509450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58424-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,13]]},"ISBN":["9783319584232","9783319584249"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58424-9_20","relation":{},"subject":[],"published":{"date-parts":[[2017,8,13]]}}}