Skip to Main content Skip to Navigation
Journal articles

Efficient dynamic range minimum query

Alice Héliou 1, 2 Martine Léonard 3 Laurent Mouchard 4, 5 Mikael Salson 6, 7 
2 AMIB - Algorithms and Models for Integrative Biology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
5 TIBS - LITIS - Equipe Traitement de l'information en Biologie Santé
LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
7 BONSAI - Bioinformatics and Sequence Analysis
Université de Lille, Sciences et Technologies, Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189, CNRS - Centre National de la Recherche Scientifique
Abstract : The Range Minimum Query problem consists in answering efficiently to a simple question: " what is the minimal element appearing between two specified indices of a given array? ". In this paper we present a novel approach that offers a satisfying trade-off between time and space. Moreover we show how the structure can be easily maintained whenever an insertion, modification or deletion modifies the array.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Mikaël Salson Connect in order to contact the contributor
Submitted on : Tuesday, November 15, 2016 - 2:20:27 PM
Last modification on : Thursday, September 8, 2022 - 3:57:28 AM
Long-term archiving on: : Thursday, March 16, 2017 - 6:13:06 PM


Publisher files allowed on an open archive


Distributed under a Creative Commons Attribution 4.0 International License



Alice Héliou, Martine Léonard, Laurent Mouchard, Mikael Salson. Efficient dynamic range minimum query. Theoretical Computer Science, Elsevier, 2016, 656, pp.108-117. ⟨10.1016/j.tcs.2016.07.002⟩. ⟨hal-01255499v2⟩



Record views


Files downloads