{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:13Z","timestamp":1725540673944},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_20","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T04:32:11Z","timestamp":1356064331000},"page":"169-181","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations"],"prefix":"10.1007","author":[{"given":"Pritom","family":"Ahmed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S. M. Shohidull","family":"Islam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"20_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"key":"20_CR2","unstructured":"Cantone, D., Faro, S., Giaquinta, E.: Approximate string matching allowing for inversions and translocations. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.), pp. 37\u201351 (2010)"},{"key":"20_CR3","unstructured":"Charras, C., Lecroq, T.: Handbook of Exact String Matching Algorithms. College Publications (2004)"},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"F. Damerau","year":"1964","unstructured":"Damerau, F.: A technique for computer detection and correction of spelling errors. Commun. ACM\u00a07(3), 171\u2013176 (1964)","journal-title":"Commun. ACM"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-77566-9_27","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"C.S. Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Rahman, M.S.: A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 316\u2013327. Springer, Heidelberg (2008)"},{"key":"20_CR6","first-page":"707","volume":"10","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady\u00a010, 707 (1966)","journal-title":"Soviet Physics Doklady"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:33:49Z","timestamp":1620135229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}