Skip to Main content Skip to Navigation
Conference papers

Dichotomic Selection on Words: A Probabilistic Analysis

Ali Akhavi 1 Julien Clément 1 Dimitri Darthenay 1 Loïck Lhote 1 Brigitte Vallée 1 
1 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : 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.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Julien Clément Connect in order to contact the contributor
Submitted on : Tuesday, June 11, 2019 - 3:11:14 PM
Last modification on : Saturday, June 25, 2022 - 9:53:30 AM


Publisher files allowed on an open archive



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⟩



Record views


Files downloads