A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
From MaRDI portal
Publication:3611932
DOI10.1007/978-3-540-74450-4_41zbMath1176.68058OpenAlexW1506856932WikidataQ56449769 ScholiaQ56449769MaRDI QIDQ3611932
Publication date: 3 March 2009
Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_41
Related Items
Space-Efficient Frameworks for Top- k String Retrieval, Optimal suffix sorting and LCP array construction for constant alphabets, The range 1 query (R1Q) problem, Parallel construction of succinct trees, Space-time trade-offs for finding shortest unique substrings and maximal unique matches, Extracting powers and periods in a word from its runs structure, One-dimensional approximate point set pattern matching with \(L_p\)-norm, Colored range queries and document retrieval, On compressing and indexing repetitive sequences, Efficient seed computation revisited, Improved data structures for the orthogonal range successor problem, Efficient algorithms for three variants of the LPF table, Cache oblivious algorithms for the RMQ and the RMSQ problems, Finding range minima in the middle: approximations and applications, New algorithms on wavelet trees and applications to information retrieval, Improved algorithms for the range next value problem and applications, The longest common substring problem, Dynamic 3-sided planar range queries with expected doubly-logarithmic time, Fast relative Lempel-Ziv self-index for similar sequences, An Online Algorithm for Finding the Longest Previous Factors, A simple linear-space data structure for constant-time range minimum query, Efficient Seeds Computation Revisited, A practical semi-external memory method for approximate pattern matching, On space efficient two dimensional range minimum data structures, Linear-space data structures for range mode query in arrays, Linear time algorithms for generalizations of the longest common substring problem, Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees, Optimal prefix and suffix queries on texts, Fully Functional Static and Dynamic Succinct Trees, Faster entropy-bounded compressed suffix trees, An Encoding for Order-Preserving Matching., Array Range Queries, Inducing Suffix and LCP Arrays in External Memory, Structural Pattern Matching - Succinctly.
