{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:23:50Z","timestamp":1781108630331,"version":"3.54.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"special issue FCT'15","license":[{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>A gapped repeat (respectively, palindrome) occurring in a word $w$ is a factor $uvu$ (respectively, $u^Rvu$) of $w$. In such a repeat (palindrome) $u$ is called the arm of the repeat (respectively, palindrome), while $v$ is called the gap. We show how to compute efficiently, for every position $i$ of the word $w$, the longest gapped repeat and palindrome occurring at that position, provided that the length of the gap is subject to various types of restrictions. That is, that for each position $i$ we compute the longest prefix $u$ of $w[i..n]$ such that $uv$ (respectively, $u^Rv$) is a suffix of $w[1..i-1]$ (defining thus a gapped repeat $uvu$ -- respectively, palindrome $u^Rvu$), and the length of $v$ is subject to the aforementioned restrictions.<\/jats:p><jats:p>Comment: This is an extension of the conference papers &amp;quot;Longest   $\\alpha$-Gapped Repeat and Palindrome&amp;quot;, presented by the second and third   authors at FCT 2015, and &amp;quot;Longest Gapped Repeats and Palindromes&amp;quot;, presented   by the first and third authors at MFCS 2015<\/jats:p>","DOI":"10.23638\/dmtcs-19-4-4","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:36:57Z","timestamp":1743698217000},"source":"Crossref","is-referenced-by-count":2,"title":["Longest Gapped Repeats and Palindromes"],"prefix":"10.23638","volume":"Vol. 19 no. 4, FCT '15","author":[{"given":"Marius","family":"Dumitran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2017,10,13]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1511.07180v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1511.07180v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:36:57Z","timestamp":1743698217000},"score":1,"resource":{"primary":{"URL":"http:\/\/dmtcs.episciences.org\/1337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,13]]},"references-count":0,"journal-issue":{"issue":"special issue FCT'15","published-online":{"date-parts":[[2017,10,13]]}},"URL":"https:\/\/doi.org\/10.23638\/dmtcs-19-4-4","relation":{"has-preprint":[{"id-type":"arxiv","id":"1511.07180v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1511.07180v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1511.07180","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1511.07180","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"value":"1365-8050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,13]]},"article-number":"1337"}}