Pages that link to "Item:Q3611932"
From MaRDI portal
The following pages link to A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array (Q3611932):
Displaying 34 items.
- Optimal suffix sorting and LCP array construction for constant alphabets (Q344531) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Linear time algorithms for generalizations of the longest common substring problem (Q547294) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees (Q975453) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Q2437762) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Fully functional static and dynamic succinct trees (Q2799480) (← links)
- Array Range Queries (Q2848983) (← links)
- The longest common substring problem (Q2971067) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- An Encoding for Order-Preserving Matching. (Q5111725) (← links)
- Structural Pattern Matching - Succinctly. (Q5136254) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
