Improved Algorithms for the Range Next Value Problem and Applications

Maxime Crochemore (1, 2) , Costas Iliopoulos (2) , Marcin Kubica (3) , M. Sohel Rahman (2) , Tomasz Walen (3)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 DCS - Department of Computer Science
3 Institute of Informatics [Warsaw]

The Range Next Value problem (Problem RNV) is a recent interesting variant of the range search problems, where the query is for the immediate next (or equal) value of a given number within a given interval of an array. Problem RNV was introduced and studied very recently by Crochemore et.\ al [Finding Patterns In Given Intervals, MFCS 2007]. In this paper, we present improved algorithms for Problem RNV. We also show how this problem can be used to achieve optimal query time for a number of interesting variants of the classic pattern matching problems.

Mots clés: Algorithms; Data structures

Domaines: Algorithme et structure de données [cs.DS]

Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen. Improved Algorithms for the Range Next Value Problem and Applications. STACS 2008, Feb 2008, Bordeaux, France. pp.205-216. ⟨hal-00214309⟩