• Home
  • Search
  • Finding Range Minima in the Middle: Approximations and Applications
  • Open Access IconOpen Access
  • Cite Icon17
  • https://doi.org/10.1007/s11786-009-0007-8Copy DOI Icon

Finding Range Minima in the Middle: Approximations and Applications

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constraint is that if the minimum in a query interval is not unique, then the query should return an approximation of the median position among all positions that attain this minimum. We present a succinct preprocessing scheme using Dn + o(n) bits in addition to the static input array (small constant D), such that subsequent “range median of minima queries” can be answered in constant time. This data structure can be built in linear time, with little extra space needed at construction time. We introduce several new combinatorial concepts such as Super-Cartesian Trees and Super-Ballot Numbers. We give applications of our preprocessing scheme in text indexes such as (compressed) suffix arrays and trees.

Similar Papers
  • Supplementary Content
  • Citations1

Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space

  • Jan 01, 2021
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Dhrumil Patel +1
  • Dissertation

2-Dimensional String Problems: Data Structures and Quantum Algorithms

  • Jul 01, 2022
  • Dhrumilkumar Patel
  • Book Chapter
  • Citations2

Compressed Range Minimum Queries

  • Jan 01, 2018
  • Seungbum Jo +2
  • Conference Article
  • Citations14

I/O-Efficient Compressed Text Indexes: From Theory to Practice

  • Jan 01, 2010
  • Sheng-Yuan Chiu +3
  • Conference Article
  • Citations58

String Matching in Hardware Using the FM-Index

  • May 01, 2011
  • Edward Fernandez +2
  • PDF
  • Research Article
  • Citations17

Suffix-Sorting via Shannon-Fano-Elias Codes

  • Apr 01, 2010
  • Algorithms
  • Donald Adjeroh +1
  • Conference Article
  • Citations21

Dynamic suffix array with polylogarithmic queries and updates

  • Jun 09, 2022
  • Dominik Kempa +1
  • Book Chapter
  • Citations2

Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings

  • Jan 01, 2022
  • Takuya Mieno +1
  • Research Article
  • Citations81

Breaking a Time-and-Space Barrier in Constructing Full-Text Indices

  • Jan 01, 2009
  • SIAM Journal on Computing
  • Wing-Kai Hon +2
  • Conference Article
  • Citations30

Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures

  • Jan 23, 2011
  • Allan Grønlund Jørgensen +1
  • Conference Article
  • Citations42

Parallel suffix array and least common prefix for the GPU

  • Feb 23, 2013
  • Mrinal Deo +1
  • Conference Article
  • Citations101

Space-Efficient Framework for Top-k String Retrieval Problems

  • Oct 01, 2009
  • Wing-Kai Hon +2
  • Conference Article
  • Citations1

English

  • Jan 01, 2008
  • Artur J Ferreira +2
  • Research Article
  • Citations25

The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences

  • Jan 01, 2008
  • International Journal of Bioinformatics Research and Applications
  • Marcel H. Schulz +2
  • Research Article
  • Citations337

The string B-tree

  • Mar 01, 1999
  • Journal of the ACM
  • Paolo Ferragina +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.