{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:56:24Z","timestamp":1742950584112,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030453848"},{"type":"electronic","value":"9783030453855"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45385-5_42","type":"book-chapter","created":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T12:13:38Z","timestamp":1590581618000},"page":"472-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Highly Parallel Convolution Method to Compare DNA Sequences with Enforced In\/Del and Mutation Tolerance"],"prefix":"10.1007","author":[{"given":"Anna","family":"Molyavko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Shaidurov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenia","family":"Karepova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Sadovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-319-38827-4_14","volume-title":"Algorithms for Computational Biology","author":"SP Tsarev","year":"2016","unstructured":"Tsarev, S.P., Sadovsky, M.G.: New error tolerant method for search of long repeats in DNA sequences. In: Bot\u00f3n-Fern\u00e1ndez, M., Mart\u00edn-Vide, C., Santander-Jim\u00e9nez, S., Vega-Rodr\u00edguez, M.A. (eds.) AlCoB 2016. LNCS, vol. 9702, pp. 171\u2013182. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-38827-4_14"},{"issue":"3","key":"42_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"issue":"14","key":"42_CR3","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.ipl.2010.05.010","volume":"110","author":"V Freschi","year":"2010","unstructured":"Freschi, V., Bogliolo, A.: A faster algorithm for the computation of string convolutions using lz78 parsing. Inform. Process. Lett. 110(14), 609\u2013613 (2010)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"42_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ipl.2004.02.011","volume":"90","author":"V Freschi","year":"2004","unstructured":"Freschi, V., Bogliolo, A.: Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism. Inform. Process. Lett. 90(4), 167\u2013173 (2004)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"42_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00011669","volume":"3","author":"E Keogh","year":"2001","unstructured":"Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. Knowl. Inf. Syst. 3(3), 263\u2013286 (2001)","journal-title":"Knowl. Inf. Syst."},{"issue":"14","key":"42_CR6","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1093\/nar\/gkf436","volume":"30","author":"K Katoh","year":"2002","unstructured":"Katoh, K., Misawa, K., Kuma, K.I., Miyata, T.: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res. 30(14), 3059\u20133066 (2002)","journal-title":"Nucleic Acids Res."},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/11430919_85","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"GJ Janacek","year":"2005","unstructured":"Janacek, G.J., Bagnall, A.J., Powell, M.: A likelihood ratio distance measure for the similarity between the Fourier transform of time series. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 737\u2013743. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11430919_85"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Hetland, M.L.: A survey of recent methods for efficient retrieval of similar time sequences. In: Data Mining in Time Series Databases, pp. 23\u201342. World Scientific (2004)","DOI":"10.1142\/9789812565402_0002"},{"issue":"21","key":"42_CR9","doi-asserted-by":"publisher","first-page":"6305","DOI":"10.1093\/nar\/18.21.6305","volume":"18","author":"DC Benson","year":"1990","unstructured":"Benson, D.C.: Fourier methods for biosequence analysis. Nucleic Acids Res. 18(21), 6305\u20136310 (1990)","journal-title":"Nucleic Acids Res."},{"key":"42_CR10","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Pearson Education India, Bengaluru (1974)"},{"key":"42_CR11","volume-title":"Computer Algorithms: Introduction to Design and Analysis","author":"S Baase","year":"2009","unstructured":"Baase, S.: Computer Algorithms: Introduction to Design and Analysis. Pearson Education India, Bengaluru (2009)"},{"key":"42_CR12","volume-title":"The Design and Analysis of Algorithms","author":"DC Kozen","year":"2012","unstructured":"Kozen, D.C.: The Design and Analysis of Algorithms. Springer, Heidleberg (2012)"},{"key":"42_CR13","unstructured":"Levenshtein, V.I.: Bounds for deletion\/insertion correcting codes. In: Proceedings IEEE International Symposium on Information Theory, p. 370. IEEE (2002)"},{"issue":"3","key":"42_CR14","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s00041-018-9616-4","volume":"25","author":"S Merhi","year":"2019","unstructured":"Merhi, S., Zhang, R., Iwen, M.A., Christlieb, A.: A new class of fully discrete sparse fourier transforms: faster stable implementations with guarantees. J. Fourier Anal. Appl. 25(3), 751\u2013784 (2019)","journal-title":"J. Fourier Anal. Appl."},{"issue":"6","key":"42_CR15","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/LSP.2019.2910466","volume":"26","author":"C Karam","year":"2019","unstructured":"Karam, C., Sugimoto, K., Hirakawa, K.: Fast convolutional distance transform. IEEE Signal Process. Lett. 26(6), 853\u2013857 (2019)","journal-title":"IEEE Signal Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics and Biomedical Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45385-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T12:17:27Z","timestamp":1590581847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45385-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030453848","9783030453855"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45385-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWBBIO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Work-Conference on Bioinformatics and Biomedical Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Granada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwbbio2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwbbio.ugr.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}