On maximal repetitions in words
Identifieur interne : 00B012 ( Main/Merge ); précédent : 00B011; suivant : 00B013On maximal repetitions in words
Auteurs : Roman Kolpakov [Russie] ; Gregory Kucherov [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A (fractional) repetition in a word w is a subword with the period of at most half of the subword length. We study maximal repetitions occurring in w, that is those for which any extended subword of w has a bigger period. The set of such repetitions represents in a compact way all repetitions in w. We first study maximal repetitions in Fibonacci words — we count their exact number, and estimate the sum of their exponents. These quantities turn out to be linearly-bounded in the length of the word. We then prove that the maximal number of maximal repetitions in general words (on arbitrary alphabet) of length n is linearly-bounded in n, and we mention some applications and consequences of this result.
Url:
DOI: 10.1007/3-540-48321-7_31
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002398
- to stream Istex, to step Curation: 002367
- to stream Istex, to step Checkpoint: 002346
Links to Exploration step
ISTEX:9A43E6F9F97663C764224D0C2E33B8AA421A35D7Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On maximal repetitions in words</title>
<author><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name>
</author>
<author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:9A43E6F9F97663C764224D0C2E33B8AA421A35D7</idno>
<date when="1999" year="1999">1999</date>
<idno type="doi">10.1007/3-540-48321-7_31</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-6TKPBL9M-3/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002398</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002398</idno>
<idno type="wicri:Area/Istex/Curation">002367</idno>
<idno type="wicri:Area/Istex/Checkpoint">002346</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002346</idno>
<idno type="wicri:doubleKey">0302-9743:1999:Kolpakov R:on:maximal:repetitions</idno>
<idno type="wicri:Area/Main/Merge">00B012</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On maximal repetitions in words</title>
<author><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name>
<affiliation wicri:level="3"><country xml:lang="fr">Russie</country>
<wicri:regionArea>French-Russian Institute for Informatics and Applied Mathematics, Moscow University, 119899, Moscow</wicri:regionArea>
<placeName><settlement type="city">Moscou</settlement>
<region>District fédéral central</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Russie</country>
</affiliation>
</author>
<author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>LORIA/INRIA-Lorraine, 615, rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: A (fractional) repetition in a word w is a subword with the period of at most half of the subword length. We study maximal repetitions occurring in w, that is those for which any extended subword of w has a bigger period. The set of such repetitions represents in a compact way all repetitions in w. We first study maximal repetitions in Fibonacci words — we count their exact number, and estimate the sum of their exponents. These quantities turn out to be linearly-bounded in the length of the word. We then prove that the maximal number of maximal repetitions in general words (on arbitrary alphabet) of length n is linearly-bounded in n, and we mention some applications and consequences of this result.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B012 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00B012 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Merge |type= RBID |clé= ISTEX:9A43E6F9F97663C764224D0C2E33B8AA421A35D7 |texte= On maximal repetitions in words }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |