{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:41Z","timestamp":1725543461964},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_11","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T01:24:10Z","timestamp":1151285050000},"page":"90-101","source":"Crossref","is-referenced-by-count":2,"title":["Finding the Position of the k-Mismatch and Approximate Tandem Repeats"],"prefix":"10.1007","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nira","family":"Shafrir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized string matching. SIAM J. Comput.\u00a016(6), 1039\u20131051 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0196-6774(03)00097-X","volume":"50","author":"A. Amir","year":"2004","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms\u00a050(2), 257\u2013275 (2004)","journal-title":"J. Algorithms"},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/S0097539700370527","volume":"31","author":"R. Cole","year":"2002","unstructured":"Cole, R., Hariharan, R.: Approximate string matching: A simpler faster algorithm. SIAM J. Comput.\u00a031(6), 1761\u20131782 (2002)","journal-title":"SIAM J. Comput."},{"key":"11_CR4","first-page":"27","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms, pp. 27\u201331. Oxford Univ. Press, New-York (1994)"},{"key":"11_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(93)90177-B","volume":"48","author":"H.J. Karloff","year":"1993","unstructured":"Karloff, H.J.: Fast algorithms for approximately counting mismatches. Inf. Process. Lett.\u00a048(2), 53\u201360 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An algorithm for approximate tandem repeats. Journal of Computational Biology\u00a08(1), 1\u201318 (2001)","journal-title":"Journal of Computational Biology"},{"key":"11_CR8","first-page":"126","volume-title":"Proc. 26th IEEE Symposium on Foundations of Computer Science","author":"G.M. Landau","year":"1985","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching in the presence of errors. In: Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 126\u2013136. IEEE Computer Society, Los Alamitos (1985)"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M.G. Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An o(n log n) algorithm for finding all repetitions in a string. J. Algorithms\u00a05(3), 422\u2013432 (1984)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:19:11Z","timestamp":1619493551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11785293_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}