Pages that link to "Item:Q5307491"

The following pages link to Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE (Q5307491):

Displaying 46 items.

• Longest common extensions in trees (Q294947) (← links)
• Fast error-tolerant quartet phylogeny algorithms (Q390892) (← links)
• Counting distinct palindromes in a word in linear time (Q407601) (← links)
• Efficient algorithms for three variants of the LPF table (Q414447) (← links)
• Improved algorithms for the range next value problem and applications (Q428870) (← links)
• Efficient dynamic range minimum query (Q507385) (← links)
• On Cartesian trees and range minimum queries (Q528853) (← links)
• A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
• The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
• Finding range minima in the middle: approximations and applications (Q626956) (← links)
• On space efficient two dimensional range minimum data structures (Q692632) (← links)
• Efficiently computing runs on a trie (Q820550) (← links)
• New results on Nyldon words and Nyldon-like sets (Q820920) (← links)
• Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
• Computing runs on a general alphabet (Q903195) (← 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)
• Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees (Q975453) (← links)
• Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
• Computing longest common extensions in partial words (Q1647840) (← links)
• Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
• A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
• Range minimum queries in minimal space (Q2078612) (← links)
• Linear-space data structures for range mode query in arrays (Q2254510) (← links)
• Cartesian and Lyndon trees (Q2285120) (← links)
• On the range maximum-sum segment query problem (Q2384388) (← links)
• Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
• Time-space trade-offs for longest common extensions (Q2442815) (← links)
• Tight lower bounds for the longest common extension problem (Q2628282) (← links)
• Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
• The longest common substring problem (Q2971067) (← links)
• An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
• (Q4508365) (← links)
• (Q5002705) (← links)
• (Q5005170) (← links)
• Computing runs on a trie (Q5088914) (← links)
• (Q5090343) (← links)
• LZ-End Parsing in Linear Time (Q5111742) (← links)
• Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
• Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. (Q5140774) (← links)
• Tree-Based Coarsening and Partitioning of Complex Networks (Q5266614) (← links)
• The “Runs” Theorem (Q5359492) (← links)
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint (Q5387633) (← links)
• Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
• Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842) (← links)
• Linear time maximum segmentation problems in column stream model (Q6536264) (← links)
• Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets (Q6536267) (← links)