{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:12:07Z","timestamp":1743009127904,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_24","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"292-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evolutive Tandem Repeats Using Hamming Distance"],"prefix":"10.1007","author":[{"given":"Richard","family":"Groult","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martine","family":"L\u00e9onard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Mouchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"issue":"9","key":"24_CR1","first-page":"2488","volume":"60","author":"S.A. Ahrendt","year":"2001","unstructured":"S.A. Ahrendt, P.A. Decker, K. Doffek, B. Wang, L. Xu, M.J. Demeure, J. Jen, and D. Sidransky. Microsatellite instability at selected tetranu-cleotide repeats is associated with p53 mutations in non-small cell lung cancer. Cancer Research, 60(9):2488\u20132491, 2001.","journal-title":"Cancer Research"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"G. Benson. An algorithm for finding tandem repeats of unspecified pattern size. In S. Istrail, P. Pevzner, and M. Waterman, editors, Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), pages 20\u201329, New York, March 22\u201325 1998. ACM Press.","DOI":"10.1145\/279069.279079"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1126\/science.273.5278.1058","volume":"273","author":"C.J. Bult","year":"1996","unstructured":"C.J. Bult et al.. Complete genome sequence of the methanogenic archaeon, Methanococcus jannaschii. Science, 273:1058\u20131073, 1996.","journal-title":"Science"},{"issue":"5","key":"24_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"M. Crochemore. An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett., 12(5):244\u2013250, 1981.","journal-title":"Inf. Process. Lett."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1126\/science.7542800","volume":"269","author":"R.D. Fleischmann","year":"1995","unstructured":"Fleischmann R.D. et al. Whole-genome random sequencing and assembly of Haemophilus influenzae Science, 269:496\u2013512, 1995.","journal-title":"Science"},{"issue":"21","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1056\/NEJM200005253422111","volume":"342","author":"K. Heinimann","year":"2000","unstructured":"K. Heinimann, H. Muller, and Z Dobbie. Microsatellite instability in colorectal cancer. New England Journal of Medicine, 342(21):1607\u20131608, 2000.","journal-title":"New England Journal of Medicine"},{"key":"24_CR7","unstructured":"C. S. Iliopoulos, M. Kumar, L. Mouchard, and S. Venkatesh. Motif evolution in polyphonic musical sequences. In L. Brankovic and J. Ryan, editors, Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, pages 53\u201366, Hunter Valley, Australia, 2000."},{"key":"24_CR8","series-title":"Lect Notes Comput Sci","first-page":"262","volume-title":"Combinatorics, Computation and Logic. Proceedings of DMTCS\u201999 and CATS\u201999","author":"C. S. Iliopoulos","year":"1999","unstructured":"C. S. Iliopoulos and L. Mouchard. An O(n log n) algorithm for computing all maximal quasiperiodicities in strings. In C. S. Calude and M. J. Dinneen, editors, Combinatorics, Computation and Logic. Proceedings of DMTCS\u201999 and CATS\u201999, Lecture Notes in Computer Science, pages 262\u2013272, Auckland, New-Zealand, 1999. Springer-Verlag, Singapore."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"C. S. Iliopoulos, D. W. G. Moore, and K. Park. Covering a string. Algorithmica, 16:289\u2013297, September 1996.","DOI":"10.1007\/BF01955677"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"S. Kurtz and C. Schleiermacher. Reputer-fast computation of maximal repeats in complete genomes. Bioinformatics, 15(5), 1999.","DOI":"10.1093\/bioinformatics\/15.5.426"},{"key":"24_CR11","unstructured":"A. Lefebvre and T. Lecroq. Computing repeated factors with a factor oracle. In L. Brankovic and J. Ryan, editors, Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, pages 145\u2013158, Hunter Valley, Australia, 2000."},{"key":"24_CR12","unstructured":"M.-F. Sagot, V. Escalier, A. Viari, and H. Soldano. Searching for repeated words in a text allowing for mismatches and gaps. In R. Baeza-Yates and U. Manber, editors, Proceedings of the 2nd South American Workshop on String Processing, pages 101\u2013116, Valpara\u00edso, Chile, 1995."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"M. Sagot and E. W. Myers. Identifying satellites in nucleic acid sequences. In S. Istrail, P. Pevzner, and M. Waterman, editors, Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), pages 234\u2013242, New York, March 22\u201325 1998. ACM Press.","DOI":"10.1145\/279069.279120"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T20:19:17Z","timestamp":1675714757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}