{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T02:35:38Z","timestamp":1790822138737,"version":"4.1.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1186\/s13015-014-0021-5","type":"journal-article","created":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T18:30:23Z","timestamp":1408127423000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimal computation of all tandem repeats in a weighted sequence"],"prefix":"10.1186","volume":"9","author":[{"given":"Carl","family":"Barton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Costas S","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Solon P","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,16]]},"reference":[{"issue":"5","key":"21_CR1","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M Crochemore","year":"1981","unstructured":"Crochemore M: An optimal algorithm for computing the repetitions in a word Inf Process Lett. 1981, 12 (5): 244-250. 10.1016\/0020-0190(81)90024-7. [http:\/\/dblp.uni-trier.de\/db\/journals\/ipl\/ipl12.html&#Crochemore81]","journal-title":"Inf Process Lett"},{"key":"21_CR2","first-page":"596","volume-title":"Symposium on Foundations of Computer Science","author":"R Kolpakov","year":"1999","unstructured":"Kolpakov R, Kucherov G: Findingmaximal repetitions in a word in linear time. In Symposium on Foundations of Computer Science. Washington, DC, USA: IEEE Computer Society; 1999:596\u2013604."},{"key":"21_CR3","volume-title":"Genomes","author":"TA Brown","year":"1999","unstructured":"Brown TA: Genomes. 1999, BIOS Scientific Publishers, London, UK,"},{"issue":"12","key":"21_CR4","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1093\/nar\/25.12.2245","volume":"25","author":"M Mitas","year":"1997","unstructured":"Mitas M:Trinucleotide repeats associated with human disease. Nucleic Acids Res. 1997, 25 (12): 2245-2253. 10.1093\/nar\/25.12.2245. [http:\/\/nar.oxfordjournals.org\/content\/25\/12\/2245.abstract], http:\/\/nar.oxfordjournals.org\/content\/25\/12\/2245.abstract","journal-title":"Nucleic Acids Res"},{"issue":"2","key":"21_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1128\/MMBR.62.2.275-293.1998","volume":"62","author":"A van Belkum","year":"1998","unstructured":"van Belkum A, Scherer S, van Alphen L, Verbrugh H:Short-sequence DNA repeats in prokaryotic genomes. Microbiol Mol Biol Rev. 1998, 62 (2): 275-293.","journal-title":"Microbiol Mol Biol Rev"},{"issue":"2","key":"21_CR6","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 program to analyze DNA sequences. Nucleic Acids Res. 1999, 27 (2): 573-580. 10.1093\/nar\/27.2.573. [http:\/\/nar.oxfordjournals.org\/content\/27\/2\/573.abstract], http:\/\/nar.oxfordjournals.org\/content\/27\/2\/573.abstract","journal-title":"Nucleic Acids Res"},{"issue":"13","key":"21_CR7","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. Nucleic Acids Res. 2003, 31 (13): 3672-3678. 10.1093\/nar\/gkg617. [http:\/\/nar.oxfordjournals.org\/content\/31\/13\/3672.abstract], http:\/\/nar.oxfordjournals.org\/content\/31\/13\/3672.abstract","journal-title":"Nucleic Acids Res"},{"issue":"6","key":"21_CR8","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1093\/bioinformatics\/btk032","volume":"22","author":"V Boeva","year":"2006","unstructured":"Boeva V, Regnier M, Papatsenko D, Makeev V:Short fuzzy tandem repeats in genomic sequences, identification, and possible role in regulation of gene expression. Bioinformatics. 2006, 22 (6): 676-684. 10.1093\/bioinformatics\/btk032. [http:\/\/bioinformatics.oxfordjournals.org\/content\/22\/6\/676.abstract], http:\/\/bioinformatics.oxfordjournals.org\/content\/22\/6\/676.abstract","journal-title":"Bioinformatics"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"303","author":"R Kolpakov","year":"2003","unstructured":"Kolpakov R, Kucherov G: Finding approximate repetitions under Hamming distance. Theor Comput Sci.2003,303:135-156.10.1016\/S0304-3975(02)00448-6.[http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397502004486]. [Logic and Complexity in Computer Science], http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397502004486","journal-title":"Theor Comput Sci"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Nomenclature for incompletely specified bases in nucleic acid sequences. Recommendations 1984. Eur J Biochem. 1985, 150: 1-5. 10.1111\/j.1432-1033.1985.tb08977.x. [http:\/\/www.biomedsearch.com\/nih\/Nomenclature-Committee-International-Union-Biochemistry\/2410266.html], http:\/\/www.biomedsearch.com\/nih\/Nomenclature-Committee-International-Union-Biochemistry\/2410266.html","DOI":"10.1111\/j.1432-1033.1985.tb08977.x"},{"key":"21_CR11","first-page":"286","volume-title":"Proc. 11th Symposium on String Processing and Information Retrieval (SPIRE), Volume 3246 of LNCS","author":"CS Iliopoulos","year":"2004","unstructured":"Iliopoulos CS, Perdikuri K, Theodoridis E, Tsakalidis A, Tsichlas K: Motif extraction from weighted sequences . Proc. 11th Symposium on String Processing and Information Retrieval (SPIRE), Volume 3246 of LNCS. 2004, 286-297. Springer, Berlin, Heidelberg,"},{"issue":"2,3","key":"21_CR12","first-page":"259","volume":"71","author":"CS Iliopoulos","year":"2006","unstructured":"Iliopoulos CS, Makris C, Panagis Y, Perdikuri K, Theodoridis E, Tsakalidis A:The weighted suffix tree: an efficient data structure for handling molecular weighted sequences and its applications. Fundam Inf. 2006, 71 (2, 3): 259-277. [http:\/\/dl.acm.org\/citation.cfm?id=1227505.1227512], http:\/\/dl.acm.org\/citation.cfm?id=1227505.1227512","journal-title":"Fundam Inf"},{"issue":"5\/6","key":"21_CR13","first-page":"687","volume":"10","author":"CS Iliopoulos","year":"2005","unstructured":"Iliopoulos CS, Mouchard L, Perdikuri K, Tsakalidis AK:Computing the repetitions in a biological weighted sequence. J Automata Lang Combinatorics. 2005, 10 (5\/6): 687-696.","journal-title":"J Automata Lang Combinatorics"},{"issue":"6","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1089\/cmb.2006.13.1214","volume":"13","author":"M Christodoulakis","year":"2006","unstructured":"Christodoulakis M, Iliopoulos CS, Mouchard L, Perdikuri K, Tsakalidis AK, Tsichlas K:Computation of repetitions and regularities of biologically weighted sequences. J Comput Biol. 2006, 13 (6): 1214-1231. 10.1089\/cmb.2006.13.1214.","journal-title":"J Comput Biol"},{"issue":"9","key":"21_CR15","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.2174\/092986610791760324","volume":"17","author":"H Zhang","year":"2010","unstructured":"Zhang H, Guo Q, Fan J, Iliopoulos CS:Loose and strict repeats in weighted sequences of proteins. Protein Pept Lett. 2010, 17 (9): 1136-1142. 10.2174\/092986610791760324.","journal-title":"Protein Pept Lett"},{"issue":"S-8","key":"21_CR16","doi-asserted-by":"publisher","first-page":"S2","DOI":"10.1186\/1471-2105-14-S8-S2","volume":"14","author":"H Zhang","year":"2013","unstructured":"Zhang H, Guo Q, Iliopoulos CS:Locating tandem repeats in weighted sequences in proteins. BMC Bioinformatics. 2013, 14 (S-8): S2-10.1186\/1471-2105-14-S8-S2.","journal-title":"BMC Bioinformatics"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Barton C, Pissis SP: Optimal computation of all repetitions in a weighted string. In ICABD: CEUR-WS.org; 2014:9\u201315.,","DOI":"10.1186\/s13015-014-0021-5"},{"key":"21_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore M, Hancart C, Lecroq T: Algorithms on Strings. 2007, Cambridge University Press, New York, NY, USA,"},{"issue":"50","key":"21_CR19","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1016\/j.tcs.2009.08.024","volume":"410","author":"M Crochemore","year":"2009","unstructured":"Crochemore M, Ilie L, Rytter W:Repetitions in strings: algorithms and combinatorics. Theor Comput Sci. 2009, 410 (50): 5227-5235. 10.1016\/j.tcs.2009.08.024. [Mathematical Foundations of Computer Science (MFCS 2007)],","journal-title":"Theor Comput Sci"},{"issue":"6","key":"21_CR20","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1089\/cmb.2006.13.1214","volume":"13","author":"M Christodoulakis","year":"2006","unstructured":"Christodoulakis M, Iliopoulos CS, Mouchard L, Perdikuri K, Tsakalidis A, Tsichlas K:Computation of repetitions and regularities of biological weighted sequences. J Comput Biol. 2006, 13 (6): 1214-1231. 10.1089\/cmb.2006.13.1214.","journal-title":"J Comput Biol"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-014-0021-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13015-014-0021-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-014-0021-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-014-0021-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T11:10:41Z","timestamp":1598181041000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-014-0021-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["21"],"URL":"https:\/\/doi.org\/10.1186\/s13015-014-0021-5","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]},"assertion":[{"value":"31 March 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"21"}}