{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:44:57Z","timestamp":1725551097686},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121883"},{"type":"electronic","value":"9783642121890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12189-0_24","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T18:11:05Z","timestamp":1270059065000},"page":"273-283","source":"Crossref","is-referenced-by-count":4,"title":["String Matching with Mismatches by Real-Valued FFT"],"prefix":"10.1007","author":[{"given":"Kensuke","family":"Baba","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/s004530010062","volume":"29","author":"M.J. Atallah","year":"2001","unstructured":"Atallah, M.J., Chyzak, F., Dumas, P.: A randomized algorithm for approximate string matching. Algorithmica\u00a029(3), 468\u2013486 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"24_CR2","first-page":"2","volume":"10","author":"K. Baba","year":"2003","unstructured":"Baba, K., Shinohara, A., Takeda, M., Inenaga, S., Arikawa, S.: A note on randomized algorithm for string matching with mismatches. Nordic Journal of Computing\u00a010(1), 2\u201312 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"24_CR3","unstructured":"Baba, K., Tanaka, Y., Nakatoh, T., Shinohara, A.: A generalization of FFT algorithms for string matching. In: Proc. International Symposium on Information Science and Electrical Engineering 2003 (ISEE 2003), pp. 191\u2013194. Kyushu University (2003)"},{"key":"24_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"24_CR5","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"24_CR6","unstructured":"Fischer, M.J., Paterson, M.S.: String-matching and other products. Complexity of Computation (SIAM-AMS Proceedings), 113\u2013125 (1974)"},{"key":"24_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"issue":"5\/6","key":"24_CR8","first-page":"697","volume":"10","author":"T. Nakatoh","year":"2005","unstructured":"Nakatoh, T., Baba, K., Ikeda, D., Yamada, Y., Hirokawa, S.: An efficient mapping for scores of string matching. Journal of Automata, Languages and Combinatorics\u00a010(5\/6), 697\u2013704 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"3","key":"24_CR9","first-page":"25","volume":"6","author":"T. Nakatoh","year":"2007","unstructured":"Nakatoh, T., Baba, K., Mori, M., Hirokawa, S.: An optimal mapping for score of string matching with FFT. DBSJ Letters\u00a06(3), 25\u201328 (2007) (in Japanese)","journal-title":"DBSJ Letters"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jalgor.2005.01.001","volume":"57","author":"T. Schoenmeyr","year":"2005","unstructured":"Schoenmeyr, T., Yu-Zhang, D.: FFT-based algorithms for the string matching with mismatches problem. Journal of Algorithms\u00a057, 130\u2013139 (2005)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"24_CR11","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1109\/TASSP.1987.1165220","volume":"35","author":"H.V. Sorensen","year":"1987","unstructured":"Sorensen, H.V., Jones, D.L., Heideman, M.T., Burrus, C.S.: Real-valued fast Fourier transform algorithms. IEEE Trans. Acoust., Speech, Signal Processing, ASSP\u00a035(6), 849\u2013863 (1987)","journal-title":"IEEE Trans. Acoust., Speech, Signal Processing, ASSP"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12189-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:04:35Z","timestamp":1619769875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12189-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121883","9783642121890"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12189-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}