{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:08Z","timestamp":1740099068123,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319919379"},{"type":"electronic","value":"9783319919386"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-91938-6_8","type":"book-chapter","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:04:12Z","timestamp":1526447052000},"page":"88-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Algorithm for Vernier Search of\u00a0Long Repeats in DNA Sequences with\u00a0Bounded Error Density"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9759-6925","authenticated-orcid":false,"given":"Sergey P.","family":"Tsarev","sequence":"first","affiliation":[]},{"given":"Maria Y.","family":"Senashova","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1807-0715","authenticated-orcid":false,"given":"Michael G.","family":"Sadovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"key":"8_CR1","first-page":"13","volume":"47","author":"I Alsmadi","year":"2012","unstructured":"Alsmadi, I., Nuser, M.: String matching evaluation methods for DNA comparison. Int. J. Adv. Sci. Technol. 47, 13\u201332 (2012)","journal-title":"Int. J. Adv. Sci. Technol."},{"issue":"3","key":"8_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., Meyers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"issue":"17","key":"8_CR3","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"SF Altschul","year":"1997","unstructured":"Altschul, S.F., Madden, T.L., Schaffer, A.A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. NAR 25(17), 3389\u20133402 (1997)","journal-title":"NAR"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1009637019316","volume":"5","author":"NN Bugaenko","year":"1998","unstructured":"Bugaenko, N.N., Gorban, A.N., Sadovsky, M.G.: Maximum entropy method in analysis of genetic text and measurement of its information content. Open Syst. Inf. Dyn. 5(2), 265\u2013278 (1998)","journal-title":"Open Syst. Inf. Dyn."},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/JPROC.2015.2455551","volume":"105","author":"S Canzar","year":"2017","unstructured":"Canzar, S., Salzberg, S.L.: Short read mapping: an algorithmic tour. Proc. IEEE 105(3), 436\u2013458 (2017)","journal-title":"Proc. IEEE"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jda.2014.08.003","volume":"28","author":"Ibrahim Chegrane","year":"2014","unstructured":"Chegrane I., Belazzougui, D.: Simple, compact and robust approximate string dictionary. \narXiv:1312.4678v2\n\n [cs.DS] (2014)","journal-title":"Journal of Discrete Algorithms"},{"issue":"1","key":"8_CR7","first-page":"3","volume":"2","author":"GH Gonnet","year":"2004","unstructured":"Gonnet, G.H.: Some string matching problems from Bioinformatics which still need better solutions. J. Dis. Alg. 2(1), 3\u201315 (2004)","journal-title":"J. Dis. Alg."},{"issue":"8","key":"8_CR8","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10(8), 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on substrings and supersequences. J. ACM 25(2), 322\u2013336 (1978)","journal-title":"J. ACM"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"e1005944","DOI":"10.1371\/journal.pcbi.1005944","volume":"14","author":"G Mar\u00e7ais","year":"2018","unstructured":"Mar\u00e7ais, G., Delcher, A.L., Phillippy, A.M., Coston, R., Salzberg, S.L., Zimin, A.: MUMmer4: a fast and versatile genome alignment system. PLoS Comput. Biol. 14(1), e1005944 (2018)","journal-title":"PLoS Comput. Biol."},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.disc.2014.09.005","volume":"338","author":"RR Martin","year":"2015","unstructured":"Martin, R.R.: On the computation of edit distance functions. Dis. Math. 338(2), 291\u2013305 (2015)","journal-title":"Dis. Math."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W Pearson","year":"1988","unstructured":"Pearson, W., Lipman, D.: Improved tools for biological sequence comparison. PNAS 85, 2444\u20132448 (1988)","journal-title":"PNAS"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1022554613105","volume":"29","author":"MG Sadovsky","year":"2003","unstructured":"Sadovsky, M.G.: Comparison of real frequencies of strings vs. the expected ones reveals the information capacity of macromoleculae. J. Biol. Phys. 29, 23 (2003)","journal-title":"J. Biol. Phys."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s11538-005-9017-0","volume":"68","author":"MG Sadovsky","year":"2006","unstructured":"Sadovsky, M.G.: Information capacity of nucleotide sequences and its applications. Bull. Math. Biol. 68, 156 (2006)","journal-title":"Bull. Math. Biol."},{"key":"8_CR15","series-title":"LNCS","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: Boton-Fernandez, M., Martin-Vide, C., Santander-Jimenez, S., Vega-Rodr\u00edguez, M.A. (eds.) Algorithms for Computational Biology. LNCS, vol. 9702, pp. 171\u2013182. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-38827-4_14"},{"key":"8_CR16","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Vernier_scale"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91938-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:05:40Z","timestamp":1526447140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91938-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319919379","9783319919386"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91938-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}