On Maximal Unbordered Factors - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

On Maximal Unbordered Factors

Résumé

Given a string S of length n, its maximal unbordered factor is the longest factor which does not have a border. In this work we investigate the relationship between n and the length of the maximal unbordered factor of S. We prove that for the alphabet of size σ ≥ 5 the expected length of the maximal unbordered factor of a string of length n is at least 0.99n (for sufficiently large values of n). As an application of this result, we propose a new algorithm for computing the maximal unbordered factor of a string.
Fichier principal
Vignette du fichier
main.pdf (324.19 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01250522 , version 1 (04-01-2016)

Identifiants

Citer

Alexander Loptev, Gregory Kucherov, Tatiana Starikovskaya. On Maximal Unbordered Factors. Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM), June 29 - July 1, 2015, Ischia Island (Italy), Jun 2015, Ischia Island, Italy. pp.12, ⟨10.1007/978-3-319-19929-0_29⟩. ⟨hal-01250522⟩
189 Consultations
90 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More