{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T22:10:11Z","timestamp":1748988611166,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388267"},{"type":"electronic","value":"9783319388274"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-38827-4_14","type":"book-chapter","created":{"date-parts":[[2016,6,11]],"date-time":"2016-06-11T12:10:29Z","timestamp":1465647029000},"page":"171-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Error Tolerant Method for Search of Long Repeats in DNA Sequences"],"prefix":"10.1007","author":[{"given":"Sergey P.","family":"Tsarev","sequence":"first","affiliation":[]},{"given":"Michael G.","family":"Sadovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,12]]},"reference":[{"issue":"3","key":"14_CR1","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."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE 2000, pp. 39\u201348. IEEE Computer Society (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"issue":"21","key":"14_CR3","doi-asserted-by":"publisher","first-page":"2683","DOI":"10.1093\/bioinformatics\/btt482","volume":"29","author":"GL Chen","year":"2013","unstructured":"Chen, G.L., Chang, Y.J., Hsueh, C.H.: PRAP: an ab initio software package for automated genome-wide analysis of DNA repeats for prokaryotes. Bioinformatics. 29(21), 2683\u20132689 (2013)","journal-title":"Bioinformatics."},{"key":"14_CR4","series-title":"Computational Biology","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/978-3-319-24966-7","volume-title":"Distributed and Sequential Algorithms for Bioinformatics","author":"K Erciyes","year":"2015","unstructured":"Erciyes, K.: Distributed and Sequential Algorithms for Bioinformatics. Computational Biology, vol. 23, p. 367. Springer, Cham (2015)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1186\/s12859-015-0654-5","volume":"16","author":"HZ Girgis","year":"2015","unstructured":"Girgis, H.Z.: Red: an intelligent, rapid, accurate tool for detecting repeats de-novo on the genomic scale. BMC Bioinform. 16, 227 (2015)","journal-title":"BMC Bioinform."},{"issue":"6","key":"14_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s12539-015-0119-6","volume":"8","author":"S Lian","year":"2016","unstructured":"Lian, S., Chen, X., Wang, P., Zhang, X., Dai, X.: A complete and accurate Ab initio repeat finding algorithm. Interdiscip. Sci. 8(1), 75\u201383 (2016)","journal-title":"Interdiscip. Sci."},{"issue":"2","key":"14_CR8","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 subsequences and supersequences. J. ACM 25(2), 322\u2013336 (1978). ACM Press","journal-title":"J. ACM"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20(1), 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"14_CR10","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1093\/bioinformatics\/btt054","volume":"29","author":"P Nov\u00e1k","year":"2013","unstructured":"Nov\u00e1k, P., Neumann, P., Pech, J., Steinhaisl, J., Macas, J.: RepeatExplorer: a galaxy-based web server for genome-wide characterization of eukaryotic repetitive elements from next-generation sequence reads. Bioinformatics 29(6), 792\u2013793 (2013)","journal-title":"Bioinformatics"},{"key":"14_CR11","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 USA 85, 2444\u20132448 (1988)","journal-title":"PNAS USA"},{"key":"14_CR12","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. Biology. 68, 156 (2006)","journal-title":"Bull. Math. Biology."},{"key":"14_CR13","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Vernier_scale"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38827-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T21:28:43Z","timestamp":1748986123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-38827-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388267","9783319388274"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38827-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"12 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}