{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:10:25Z","timestamp":1738325425897,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853022"},{"type":"electronic","value":"9783540853039"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85303-9_15","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:33:48Z","timestamp":1218544428000},"page":"159-168","source":"Crossref","is-referenced-by-count":1,"title":["Application of q-Gram Distance in Digital Forensic Search"],"prefix":"10.1007","author":[{"given":"Slobodan","family":"Petrovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sverre","family":"Bakke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Beebe, N., Clark, J.: Dealing with terabyte data sets in digital investigations. In: Advances in Digital Forensics: Proceedings of the IFIP International Conference on Digital Forensics, pp. 3\u201316 (2005)","DOI":"10.1007\/0-387-31163-7_1"},{"issue":"10","key":"15_CR2","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"Boyer, R., Moore, J.: A fast string searching algorithm. Comm. ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Comm. ACM"},{"key":"15_CR3","unstructured":"http:\/\/www.dtsearch.com"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TSE.1983.237018","volume":"SE-9","author":"R. Kashyap","year":"1983","unstructured":"Kashyap, R., Oommen, B.: The Noisy Substring Matching Problem. IEEE Trans. Software Eng.\u00a0SE-9(3), 365\u2013370 (1983)","journal-title":"IEEE Trans. Software Eng."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Computing"},{"key":"15_CR6","unstructured":"Kurtz, S.: Approximate String Searching under Weighted Edit Distance. In: Proceedings of Third South American Workshop on String Processing, Recife, Brazil, August, pp. 156\u2013170 (1996)"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1162\/0891201042544938","volume":"30","author":"S. Mihov","year":"2004","unstructured":"Mihov, S., Schulz, K.U.: Fast approximate search in large dictionaries. Computational Linguistics\u00a030(4), 451\u2013477 (2004)","journal-title":"Computational Linguistics"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Mihov, S., Mitankin, P., Schulz, K.U.: Fast selection of small and precise candidate sets from dictionaries for text correction tasks. In: Proceedings of ICDAR 2007, vol.\u00a01, pp. 471\u2013475 (2007)","DOI":"10.1109\/ICDAR.2007.4378754"},{"issue":"5","key":"15_CR9","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TPAMI.1987.4767962","volume":"PAMI-9","author":"B. Oommen","year":"1987","unstructured":"Oommen, B.: Recognition of Noisy Subsequences Using Constrained Edit Distances. IEEE Trans. Pattern Anal. Mach. Intell.\u00a0PAMI-9(5), 676\u2013685 (1987)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"15_CR10","unstructured":"Roussev, V., Richard III, G.: Breaking the performance wall: the cases for distributed digital forensics. In: Proceedings of the Digital Forensics Research Workshop, pp. 1\u201316 (2004)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Petrovi\u0107, S., Franke, K.: Improving the Efficiency of Digital Forensic Search by Means of the Constrained Edit Distance. In: Proceedings of the Third International Symposium on Information Assurance and Security, pp. 405\u2013410 (2007)","DOI":"10.1109\/IAS.2007.38"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P. Sellers","year":"1980","unstructured":"Sellers, P.: The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms\u00a01(4), 359\u2013373 (1980)","journal-title":"Journal of Algorithms"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-3-540-27772-9_27","volume-title":"Advances in Web-Age Information Management","author":"F. Shi","year":"2004","unstructured":"Shi, F.: Fast Approximate Search in Text Databases. In: Li, Q., Wang, G., Feng, L. (eds.) WAIM 2004. LNCS, vol.\u00a03129, pp. 259\u2013267. Springer, Heidelberg (2004)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/CIT.2005.23","volume-title":"Proceedings of Fifth International Conference on Computer and Information Technology (CIT 2005)","author":"F. Shi","year":"2005","unstructured":"Shi, F., Mefford, C.: A New Indexing Method for Approximate Search in String Databases. In: Proceedings of Fifth International Conference on Computer and Information Technology (CIT 2005), pp. 70\u201376. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science\u00a092, 191\u2013211 (1992)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computational Forensics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85303-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T11:52:31Z","timestamp":1738324351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85303-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540853022","9783540853039"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85303-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}