Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2019.19
URN: urn:nbn:de:0030-drops-104903
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10490/
Akhavi, Ali ; Clément, Julien ; Darthenay, Dimitri ; Lhote, Loïck ; Vallée, Brigitte
Dichotomic Selection on Words: A Probabilistic Analysis
| pdf-format: |
|
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 not in 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.
BibTeX - Entry
@InProceedings{akhavi_et_al:LIPIcs:2019:10490,
author = {Ali Akhavi and Julien Cl{\'e}ment and Dimitri Darthenay and Loick Lhote and Brigitte Vall{\'e}e},
title = {{Dichotomic Selection on Words: A Probabilistic Analysis}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {19:1--19:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Nadia Pisanti and Solon P. Pissis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10490},
URN = {urn:nbn:de:0030-drops-104903},
doi = {10.4230/LIPIcs.CPM.2019.19},
annote = {Keywords: dichotomic selection, text algorithms, analysis of algorithms, average case analysis of algorithms, trie, suffix array, lcp-array, information theory}
}
| Keywords: | dichotomic selection, text algorithms, analysis of algorithms, average case analysis of algorithms, trie, suffix array, lcp-array, information theory | |
| Seminar: | 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 06.06.2019 |
