{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:21:16Z","timestamp":1742912476120,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":20,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_24","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:51Z","timestamp":1214505471000},"page":"48-51","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Tandem Repeats"],"prefix":"10.1007","author":[{"given":"Gregory","family":"Kucherov","sequence":"first","affiliation":[]},{"given":"Dina","family":"Sokol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1_24","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1093\/nar\/27.2.573","volume":"27","author":"G. Benson","year":"1999","unstructured":"Benson, G.: Tandem Repeats Finder: a\u00a0program to analyze DNA sequences. Nucleic Acids Res. 27, 573\u2013580 (1999)","journal-title":"Nucleic Acids Res."},{"key":"24_CR2_24","unstructured":"Boeva, V.A., R\u00e9gnier, M., Makeev, V.J.: SWAN: searching for highly divergent tandem repeats in DNA sequences with the evaluation of their statistical significance. Proceedings of JOBIM 2004, Montreal, Canada, p. 40 (2004)"},{"key":"24_CR3_24","unstructured":"Butler, J.M.: Forensic DNA Typing: Biology and Technology Behind STR Markers. Academic Press (2001)"},{"key":"24_CR4_24","first-page":"781","volume":"296","author":"M. Crochemore","year":"1983","unstructured":"Crochemore, M.: Recherche lin\u00e9aire d'un carr\u00e9 dans un mot. Comptes Rendus Acad. Sci. Paris S\u00e9r. I Math. 296, 781\u2013784 (1983)","journal-title":"Comptes Rendus Acad. Sci. Paris S\u00e9r. I Math."},{"key":"24_CR5_24","doi-asserted-by":"publisher","first-page":"2812","DOI":"10.1093\/bioinformatics\/bth335","volume":"20","author":"O. Delgrange","year":"2004","unstructured":"Delgrange, O., Rivals, E.: STAR \u2013 an algorithm to Search for Tandem Approximate Repeats. Bioinform. 20, 2812\u20132820 (2004)","journal-title":"Bioinform."},{"key":"24_CR6_24","doi-asserted-by":"crossref","unstructured":"Gelfand, Y., Rodriguez, A., Benson, G.: TRDB\u00a0\u2013 The Tandem Repeats Database. Nucl. Acids Res. 35(suppl. 1), D80\u2013D87 (2007)","DOI":"10.1093\/nar\/gkl1013"},{"key":"24_CR7_24","doi-asserted-by":"publisher","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 (1997)"},{"key":"24_CR8_24","first-page":"596","volume-title":"Proceedings of the 40th Symposium on Foundations of Computer Science","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a\u00a0word in linear time. In: 40th Symp. Foundations of Computer Science (FOCS), pp. 596\u2013604. IEEE Computer Society Press (1999)"},{"issue":"13","key":"24_CR9_24","doi-asserted-by":"publisher","first-page":"3672","DOI":"10.1093\/nar\/gkg617","volume":"31","author":"R. Kolpakov","year":"2003","unstructured":"Kolpakov, R., Bana, G., Kucherov, G.: mreps: efficient and flexible detection of tandem repeats in DNA. Nucl. Acids Res. 31(13), 3672\u20133678 (2003)","journal-title":"Nucl. Acids Res."},{"issue":"1","key":"24_CR10_24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"33","author":"R. Kolpakov","year":"2003","unstructured":"Kolpakov, R., Kucherov, G.: Finding approximate repetitions under Hamming distance. Theoret. Comput. Sci. 33(1), 135\u2013156, (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR11_24","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Identification of periodic structures in words. In: Berstel, J., Perrin, D. (eds.) Applied combinatorics on words. Encyclopedia of Mathematics and its Applications. Lothaire books, vol.\u00a0104, pp.\u00a0430\u2013477. Cambridge University Press (2005)","DOI":"10.1017\/CBO9781107341005.009"},{"issue":"1","key":"24_CR12_24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"G.M. Landau","year":"1988","unstructured":"Landau, G.M., Vishkin, U.: Fast string matching with k differences. J.\u00a0Comput. Syst. Sci. 37(1), 63\u201378 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"24_CR13_24","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"G.M. Landau","year":"1998","unstructured":"Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557\u2013582 (1998)","journal-title":"SIAM J. Comput."},{"key":"24_CR14_24","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. J.\u00a0Comput. Biol. 8, 1\u201318 (2001)","journal-title":"J. Comput. Biol."},{"key":"24_CR15_24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","volume":"25","author":"M. Main","year":"1989","unstructured":"Main, M.: Detecting leftmost maximal periodicities. Discret. Appl. Math. 25, 145\u2013153 (1989)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"24_CR16_24","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M. Main","year":"1984","unstructured":"Main, M., Lorentz, R.: An $$ { O(n \\log n) } $$ algorithm for finding all repetitions in a\u00a0string. J.\u00a0Algorithms 5(3), 422\u2013432 (1984)","journal-title":"J. Algorithms"},{"issue":"5","key":"24_CR17_24","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1093\/molbev\/msm035","volume":"24","author":"P.W. Messer","year":"2007","unstructured":"Messer, P.W., Arndt, P.F.: The majority of recent short DNA insertions in the human genome are tandem duplications. Mol. Biol. Evol. 24(5), 1190\u20137 (2007)","journal-title":"Mol. Biol. Evol."},{"issue":"1","key":"24_CR18_24","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1981","unstructured":"Rodeh, M., Pratt, V., Even, S.: Linear algorithm for data compression via string matching. J.\u00a0Assoc. Comput. Mach. 28(1), 16\u201324 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"24_CR19_24","doi-asserted-by":"crossref","first-page":"e30","DOI":"10.1093\/bioinformatics\/btl309","volume":"23","author":"D. Sokol","year":"2006","unstructured":"Sokol, D., Benson, G., Tojeira, J.: Tandem repeats over the edit distance. Bioinform. 23(2), e30\u2013e35 (2006)","journal-title":"Bioinform."},{"issue":"7","key":"24_CR20_24","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1089\/cmb.2005.12.928","volume":"12","author":"Y. Wexler","year":"2005","unstructured":"Wexler, Y., Yakhini, Z., Kashi, Y., Geiger, D.: Finding approximate tandem repeats in genomic sequences. J.\u00a0Comput. Biol. 12(7), 928\u201342 (2005)","journal-title":"J. Comput. Biol."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:59:17Z","timestamp":1662170357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_24"}},"subtitle":["2001; Landau, Schmidt, Sokol\n            2003; Kolpakov, Kucherov"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_24","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}