{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:18:06Z","timestamp":1757452686694},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00423-7","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T16:31:46Z","timestamp":1062606706000},"page":"309-328","source":"Crossref","is-referenced-by-count":9,"title":["Speeding up the detection of evolutive tandem repeats"],"prefix":"10.1016","volume":"310","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":"78","reference":[{"issue":"9","key":"10.1016\/S0304-3975(03)00423-7_BIB1","first-page":"2488","article-title":"Microsatellite instability at selected tetranucleotide repeats is associated with p53 mutations in non-small cell lung cancer","volume":"60","author":"Ahrendt","year":"2001","journal-title":"Cancer Res."},{"issue":"3","key":"10.1016\/S0304-3975(03)00423-7_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in a string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00423-7_BIB3","series-title":"Proc. Second Annu. Internat. Conf. Computational Molecular Biology (RECOMB-98)","first-page":"20","article-title":"An algorithm for finding tandem repeats of unspecified pattern size","author":"Benson","year":"1998"},{"issue":"2","key":"10.1016\/S0304-3975(03)00423-7_BIB4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1093\/nar\/27.2.573","article-title":"Tandem repeats finder","volume":"27","author":"Benson","year":"1999","journal-title":"Nucleic Acids Res."},{"issue":"5","key":"10.1016\/S0304-3975(03)00423-7_BIB5","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","article-title":"An optimal algorithm for computing the repetitions in a word","volume":"12","author":"Crochemore","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(03)00423-7_BIB6","doi-asserted-by":"crossref","unstructured":"R. Groult, M. L\u00e9onard, L. Mouchard, Evolutive tandem repeats using Hamming distance, in: K. Diks, W. Rytter (Eds.), Proc. MFCS\u201902: the 27th Internat. Symp. Mathematical Foundations of Computer Science, Warszawa, Otwock, Poland, August 2002, Lecture Notes in Computer Science, Vol. 2420, Springer, Berlin, pp. 292\u2013304.","DOI":"10.1007\/3-540-45687-2_24"},{"key":"10.1016\/S0304-3975(03)00423-7_BIB7","unstructured":"D. Gusfield, J. Stoye, Linear time algorithms for finding and representing all the tandem repeats in a string, Technical Report CSE-98-E, 1998."},{"issue":"21","key":"10.1016\/S0304-3975(03)00423-7_BIB8","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1056\/NEJM200005253422111","article-title":"Microsatellite instability in colorectal cancer","volume":"342","author":"Heinimann","year":"2000","journal-title":"New England J. Med."},{"key":"10.1016\/S0304-3975(03)00423-7_BIB9","series-title":"Proc. the 11th Australasian Workshop on Combinatorial Algorithms","first-page":"53","article-title":"Motif evolution in polyphonic musical sequences","author":"Iliopoulos","year":"2000"},{"key":"10.1016\/S0304-3975(03)00423-7_BIB10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01955677","article-title":"Covering a string","volume":"16","author":"Iliopoulos","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(03)00423-7_BIB11","unstructured":"C.S. Iliopoulos, L. Mouchard, An O(nlogn) algorithm for computing all maximal quasiperiodicities in strings, in: C.S. Calude, M.J. Dinneen (Eds.), Combinatorics, Computation and Logic, Proc. DMTCS\u201999 and CATS\u201999, Auckland, New-Zealand, Lecture Notes in Computer Science, Springer, Singapore, 1999, pp. 262\u2013272."},{"key":"10.1016\/S0304-3975(03)00423-7_BIB12","doi-asserted-by":"crossref","unstructured":"R.M. Kolpakov, G. Kucherov, Finding maximal repetitions in a word in linear time, in: IEEE Symp. Foundations of Computer Science, New York, 1999, pp. 596\u2013604.","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"10.1016\/S0304-3975(03)00423-7_BIB13","doi-asserted-by":"crossref","unstructured":"R.M. Kolpakov, G. Kucherov, Finding approximate repetitions under hamming distance, in: Proc. the Ninth European Symp. Algorithms, Lecture Notes in Computer Science, Vol. 2161, Springer, Berlin, 2001, pp. 171\u2013180.","DOI":"10.1007\/3-540-44676-1_14"},{"key":"10.1016\/S0304-3975(03)00423-7_BIB14","unstructured":"S. Kurtz, E. Ohlebusch, C. Schleiermacher, J. Stoye, R. Giegerrich, Computation and visualization of degenerate repeats in complete genome, in: Proc. Eighth Internat. Conf. Intelligent Systems for Molecular Biology, The AAAI Press, La Jolla, California, 2000, pp. 228\u2013238."},{"key":"10.1016\/S0304-3975(03)00423-7_BIB15","doi-asserted-by":"crossref","unstructured":"G.M. Landau, J.P. Schmidt, An algorithm for approximate tandem repeats, in: A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Proc. Fourth Annu. Symp. Combinatorial Pattern Matching, Padova, Italy, Lecture Notes in Computer Science, Vol. 684, Springer, Berlin, 1993, pp. 120\u2013133.","DOI":"10.1007\/BFb0029801"},{"issue":"3","key":"10.1016\/S0304-3975(03)00423-7_BIB16","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(nlogn) algorithm for finding all repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/S0304-3975(03)00423-7_BIB17","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0304-3975(00)00065-7","article-title":"Normal forms of quasiperiodic strings","volume":"249","author":"Mouchard","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00423-7_BIB18","series-title":"Proc. Second South American Workshop on String Processing","first-page":"101","article-title":"Searching for repeated words in a text allowing for mismatches and gaps","author":"Sagot","year":"1995"},{"key":"10.1016\/S0304-3975(03)00423-7_BIB19","series-title":"Proc. Second Annu. Internat. Conf. Computational Molecular Biology (RECOMB-98)","first-page":"234","article-title":"Identifying satellites in nucleic acid sequences","author":"Sagot","year":"1998"},{"key":"10.1016\/S0304-3975(03)00423-7_BIB20","first-page":"1","article-title":"\u00dcber die gegenseitige lage gleicher teile gewisser zeichenreichen","volume":"1","author":"Thue","year":"1912","journal-title":"Nor. Vidensk. Selsk. Skr. Mat. Nat. Kl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:27:54Z","timestamp":1551090474000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503004237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503004237"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00423-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}