Dichotomic Selection on Words: A Probabilistic Analysis - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Dichotomic Selection on Words: A Probabilistic Analysis

Ali Akhavi
Dimitri Darthenay
  • Function : Author
  • PersonId : 1048571
Loïck Lhote


The paper studies the behaviour of selection algorithms that are based on dichotomy principles. On the entry formed by an ordered list L and a searched element x ∈ L, they return the interval of the list L the element x belongs to. We focus here on the case of words, where dichotomy principles lead to a selection algorithm designed by Crochemore, Hancart and Lecroq, which appears to be "quasi-optimal". We perform a probabilistic analysis of this algorithm that exhibits its quasi-optimality on average.
Fichier principal
Vignette du fichier
LIPIcs-CPM-2019-19.pdf (698.87 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-02152162 , version 1 (11-06-2019)



Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote, Brigitte Vallée. Dichotomic Selection on Words: A Probabilistic Analysis. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), Jun 2019, Pisa, Italy. pp.19:1-19:19, ⟨10.4230/LIPIcs.CPM.2019.19⟩. ⟨hal-02152162⟩
169 View
77 Download



Gmail Facebook X LinkedIn More