{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:03:42Z","timestamp":1648609422262},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,3,1]]},"DOI":"10.1093\/comjnl\/bxl058","type":"journal-article","created":{"date-parts":[[2006,10,13]],"date-time":"2006-10-13T05:24:49Z","timestamp":1160717089000},"page":"178-185","source":"Crossref","is-referenced-by-count":5,"title":["Locating Maximal Multirepeats in Multiple Strings Under Various Constraints \u2020"],"prefix":"10.1093","volume":"50","author":[{"given":"A.","family":"Bakalis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Makris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sioutas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Tsichlas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2006,10,12]]},"reference":[{"key":"key\n\t\t\t\t20171012214038_BXL058C1","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":"key\n\t\t\t\t20171012214038_BXL058C2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O ( n \u00a0log\u00a0 n ) algorithm for finding all repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithm."},{"key":"key\n\t\t\t\t20171012214038_BXL058C3","first-page":"596","article-title":"Finding maximal repetitions in a word in linear time","author":"Kolpakov","year":"1999"},{"key":"key\n\t\t\t\t20171012214038_BXL058C4","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","article-title":"Linear time algorithms for finding and representing all the tandem repeats in a string","volume":"69","author":"Gusfield","year":"2004","journal-title":"J. Comput. Sys. Sci."},{"key":"key\n\t\t\t\t20171012214038_BXL058C5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1089\/106652701300099038","article-title":"An algorithm for approximate tandem repeats","volume":"8","author":"Landau","year":"2001","journal-title":"J. Comput. Biol."},{"key":"key\n\t\t\t\t20171012214038_BXL058C6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","article-title":"Finding approximate repetitions under Hamming distance","volume":"303","author":"Kolpakov","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"key\n\t\t\t\t20171012214038_BXL058C7","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1093\/nar\/27.2.573","article-title":"Tandem repeats finder: a program to analyze DNA sequences","volume":"27","author":"Benson","year":"1999","journal-title":"Nucleic Acids Res."},{"key":"key\n\t\t\t\t20171012214038_BXL058C8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0304-3975(03)00423-7","article-title":"Speeding up the detection of evolutive tandem repeats","volume":"310","author":"Groult","year":"2004","journal-title":"Theor. Comput. Sci."},{"key":"key\n\t\t\t\t20171012214038_BXL058C9","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1089\/cmb.2005.12.928","article-title":"Finding approximate tandem repeats in genomic sequences","volume":"12","author":"Wexler","year":"2005","journal-title":"J. Comput. Biol."},{"key":"key\n\t\t\t\t20171012214038_BXL058C10","article-title":"Motifs in sequences: localization and extraction","volume-title":"Handbook of Computational Chemistry","author":"Crochemore","year":"2004"},{"key":"key\n\t\t\t\t20171012214038_BXL058C11","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1089\/106652700750050826","article-title":"Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification","volume":"7","author":"Marsan","year":"2000","journal-title":"J. Comput. Biol."},{"key":"key\n\t\t\t\t20171012214038_BXL058C12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"key":"key\n\t\t\t\t20171012214038_BXL058C13","first-page":"134","article-title":"Finding maximal pairs with bounded gaps","author":"Brodal","year":"1999"},{"key":"key\n\t\t\t\t20171012214038_BXL058C14","doi-asserted-by":"crossref","first-page":"4633","DOI":"10.1093\/nar\/29.22.4633","article-title":"REPuter: the manifold applications of repeat analysis on a genomic scale","volume":"29","author":"Kurtz","year":"2001","journal-title":"Nucleic Acids Res."},{"key":"key\n\t\t\t\t20171012214038_BXL058C15","first-page":"263","article-title":"An algorithm for the organization of Information","volume":"146","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"key\n\t\t\t\t20171012214038_BXL058C16","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","article-title":"Design and analysis of a data structure for representing sorted lists","volume":"9","author":"Brown","year":"1980","journal-title":"SIAM J. Comput."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/50\/2\/178\/7903193\/bxl058.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T14:20:45Z","timestamp":1555856445000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/50\/2\/178\/2568652\/Locating-Maximal-Multirepeats-in-Multiple-Strings"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,12]]},"references-count":16,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2006,10,12]]},"published-print":{"date-parts":[[2007,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxl058","relation":{},"ISSN":["1460-2067","0010-4620"],"issn-type":[{"value":"1460-2067","type":"electronic"},{"value":"0010-4620","type":"print"}],"subject":[],"published-other":{"date-parts":[[2007,3]]},"published":{"date-parts":[[2006,10,12]]}}}