{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article8363","name":"Efficiently Finding All Maximal alpha-gapped Repeats","abstract":"For alpha >=1, an alpha-gapped repeat in a word w is a factor uvu of w such that |uv| <= alpha * |u|; the two occurrences of a factor u in such a repeat are called arms. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right nor to the left. We show that the number of all maximal alpha-gapped repeats occurring in words of length n is upper bounded by 18 * alpha * n, allowing us to construct an algorithm finding all maximal alpha-gapped repeats of a word on an integer alphabet of size n^{O}(1)} in {O}(alpha * n) time. This result is optimal as there are words that have Theta(alpha * n) maximal alpha-gapped repeats. Our techniques can be extended to get comparable results in the case of alpha-gapped palindromes, i.e., factors uvu^{T} with |uv| <= alpha |u|.","keywords":["combinatorics on words","counting algorithms"],"author":[{"@type":"Person","name":"Gawrychowski, Pawel","givenName":"Pawel","familyName":"Gawrychowski"},{"@type":"Person","name":"I, Tomohiro","givenName":"Tomohiro","familyName":"I"},{"@type":"Person","name":"Inenaga, Shunsuke","givenName":"Shunsuke","familyName":"Inenaga"},{"@type":"Person","name":"K\u00f6ppl, Dominik","givenName":"Dominik","familyName":"K\u00f6ppl"},{"@type":"Person","name":"Manea, Florin","givenName":"Florin","familyName":"Manea"}],"position":39,"pageStart":"39:1","pageEnd":"39:14","dateCreated":"2016-02-16","datePublished":"2016-02-16","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Gawrychowski, Pawel","givenName":"Pawel","familyName":"Gawrychowski"},{"@type":"Person","name":"I, Tomohiro","givenName":"Tomohiro","familyName":"I"},{"@type":"Person","name":"Inenaga, Shunsuke","givenName":"Shunsuke","familyName":"Inenaga"},{"@type":"Person","name":"K\u00f6ppl, Dominik","givenName":"Dominik","familyName":"K\u00f6ppl"},{"@type":"Person","name":"Manea, Florin","givenName":"Florin","familyName":"Manea"}],"copyrightYear":"2016","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2016.39","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/arxiv.org\/abs\/1406.0263","http:\/\/arxiv.org\/abs\/1309.4055","http:\/\/dx.doi.org\/10.1016\/j.tcs.2009.09.013"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume6250","volumeNumber":47,"name":"33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)","dateCreated":"2016-02-16","datePublished":"2016-02-16","editor":[{"@type":"Person","name":"Ollinger, Nicolas","givenName":"Nicolas","familyName":"Ollinger"},{"@type":"Person","name":"Vollmer, Heribert","givenName":"Heribert","familyName":"Vollmer"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article8363","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6250"}}}