Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
From MaRDI portal
(Redirected from Publication:5307491)
Recommendations
Cited in
(72)- Faster entropy-bounded compressed suffix trees
- How to answer a small batch of RMQs or LCA queries in practice
- Computing longest common extensions in partial words
- Period recovery of strings over the Hamming and edit distances
- Range minimum queries in minimal space
- Linear-space data structures for range mode query in arrays
- Cartesian and Lyndon trees
- On the range maximum-sum segment query problem
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Time-space trade-offs for longest common extensions
- Tight lower bounds for the longest common extension problem
- Time-Space Trade-Offs for Longest Common Extensions
- Longest common extensions in trees
- The longest common substring problem
- Data structures for efficient string algorithms.
- An Online Algorithm for Finding the Longest Previous Factors
- Fast error-tolerant quartet phylogeny algorithms
- Counting distinct palindromes in a word in linear time
- Efficient algorithms for three variants of the LPF table
- Improved algorithms for the range next value problem and applications
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- Practical range minimum queries revisited
- scientific article; zbMATH DE number 7375961 (Why is no real title available?)
- Fast entropy-bounded string dictionary look-up with mismatches
- Efficient dynamic range minimum query
- Computing runs on a trie
- Minimum segmentation for pan-genomic founder reconstruction in linear time
- LZ-End Parsing in Linear Time
- Almost linear time computation of maximal repetitions in run length encoded strings
- Locally maximal common factors as a tool for efficient dynamic string algorithms
- Tree-based coarsening and partitioning of complex networks
- On Cartesian trees and range minimum queries
- A practical semi-external memory method for approximate pattern matching
- The ``runs theorem
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Shortest rectilinear path queries to rectangles in a rectangular domain
- The longest common extension problem revisited and applications to approximate string searching
- Finding range minima in the middle: approximations and applications
- Linear time maximum segmentation problems in column stream model
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- Quantum data structure for range minimum query
- Complexity of linear operators
- Regular expressions with backreferences: polynomial-time matching techniques
- On space efficient two dimensional range minimum data structures
- Efficient computation of all tolerances in the sparse maxmin path problem
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
- Maps for learning indexable classes
- On the necessity of some topological spaces
- Computing the index of non-isometric k-ary words with Hamming and Lee distance
- An improved algorithm for the k-Dyck edit distance problem
- Refl-spanners: a purely regular approach to non-regular core spanners
- Simple linear time algorithm for sorting strings in omega-order with applications
- Linear time runs over general ordered alphabets
- Longest common extensions with wildcards: trade-off and applications
- Approximate Cartesian tree matching with one difference
- Efficient online sensitivity analysis for the injective bottleneck path problem
- An optimal 3-fault-tolerant connectivity oracle
- Efficiently computing runs on a trie
- New results on Nyldon words and Nyldon-like sets
- Linear-time superbubble identification algorithm for genome assembly
- Computing runs on a general alphabet
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
This page was built for publication: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307491)
