The following pages link to (Q4508365):
Displaying 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Longest common extensions in trees (Q294947) (← links)
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Order-preserving indexing (Q294954) (← links)
- Order-preserving pattern matching with \(k\) mismatches (Q294955) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- Compressed property suffix trees (Q386003) (← links)
- One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking (Q391129) (← links)
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Extending common intervals searching from permutations to sequences (Q473211) (← links)
- Linear-space data structures for range minority query in arrays (Q494786) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Fitting a step function to a point set (Q547281) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- A scalable parallelization of the gene duplication problem (Q666045) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Efficient indexing algorithms for one-dimensional discretely-scaled strings (Q765528) (← links)
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Algorithms for radius-optimally augmenting trees in a metric space (Q832891) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- The 2-radius and 2-radiian problems on trees (Q955029) (← links)
- Efficient inclusion for a class of XML types with interleaving and counting (Q964806) (← links)
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees (Q975453) (← links)
