{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:30:16Z","timestamp":1743013816014,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992761"},{"type":"electronic","value":"9783319992778"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99277-8_9","type":"book-chapter","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T01:58:12Z","timestamp":1535594292000},"page":"141-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Collecting Network Evidence Using Constrained Approximate Search Algorithms"],"prefix":"10.1007","author":[{"given":"Ambika Shrestha","family":"Chitrakar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slobodan","family":"Petrovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"A. Aho and M. Corasick, Efficient string matching: An aid to bibliographic search, Communications of the ACM, vol. 18(6), pp. 333\u2013340, 1975.","DOI":"10.1145\/360825.360855"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates and G. Navarro, Faster approximate string matching, Algorithmica, vol. 23(2), pp. 127\u2013158, 1999.","DOI":"10.1007\/PL00009253"},{"key":"9_CR3","unstructured":"S. Faro and T. Lecroq, Twenty years of bit-parallelism in string matching, in Festschrift for Borivoj Melichar, J. Holub, B. Watson and J. Zdarek (Eds.), Prague Stringology Club, Prague, Czech Republic, pp. 72\u2013101, 2012."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"R. Joshi and E. Pilli, Fundamentals of Network Forensics: A Research Perspective, Springer-Verlag, London, United Kingdom, 2016.","DOI":"10.1007\/978-1-4471-7299-4"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"G. Navarro, NR-grep: A fast and flexible pattern-matching tool, Software \u2013 Practice and Experience, vol. 31(13), pp. 1265\u20131312, 2001.","DOI":"10.1002\/spe.411"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"G. Navarro and M. Raffinot, A bit-parallel approach to suffix automata: Fast extended string matching, Proceedings of the Annual Symposium on Combinatorial Pattern Matching, pp. 14\u201333, 1998.","DOI":"10.1007\/BFb0030778"},{"key":"9_CR7","unstructured":"M. Roesch, Snort \u2013 Lightweight intrusion detection for networks, Proceedings of the Thirteenth USENIX Conference on System Administration, pp. 229\u2013238, 1999."},{"key":"9_CR8","unstructured":"M. Roesch and C. Green, Snort Users Manual 2.9.9, The Snort Project (manual-snort-org.s3-website-us-east-1.amazonaws.com), 2017."},{"key":"9_CR9","unstructured":"D. Sankoff and J. Kruskal, Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, Addison Wesley, Reading, Massachusetts, 1983."},{"key":"9_CR10","unstructured":"A. Shrestha Chitrakar and S. Petrovic, Approximate search with constraints on indels with application in spam filtering, Proceedings of the Norwegian Information Security Conference, pp. 22\u201333, 2015."},{"key":"9_CR11","unstructured":"A. Shrestha Chitrakar and S. Petrovic, Constrained row-based bit-parallel search in intrusion detection, Proceedings of the Norwegian Information Security Conference, pp. 68\u201379, 2016."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"A. Shrestha Chitrakar and S. Petrovic, CRBP-OpType: A constrained approximate search algorithm for detecting similar attack patterns, in Computer Security, S. Katsikas, F. Cuppens, N. Cuppens, C. Lambrinoudakis, C. Kalloniatis, J. Mylopoulos, A. Anton and S. Gritzalis (Eds.), Springer, Cham, Switzerland, pp. 163\u2013176, 2018.","DOI":"10.1007\/978-3-319-72817-9_11"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"S. Wu and U. Manber, Fast text searching: Allowing errors, Communications of the ACM, vol. 35(10), pp. 83\u201391, 1992.","DOI":"10.1145\/135239.135244"}],"container-title":["IFIP Advances in Information and Communication Technology","Advances in Digital Forensics XIV"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99277-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:03:29Z","timestamp":1661731409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99277-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992761","9783319992778"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99277-8_9","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"30 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DigitalForensics","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Digital Forensics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 January 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"digitalforensics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ifip119.org\/Conferences\/WG11-9-CFP-2018.pdf","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}