Pages that link to "Item:Q2464333"

The following pages link to Compressed suffix trees with full functionality (Q2464333):

Displaying 50 items.

• Compressed string dictionary search with edit distance one (Q270017) (← links)
• Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
• Compressed property suffix trees (Q386003) (← links)
• Multi-pattern matching with bidirectional indexes (Q396713) (← links)
• Cross-document pattern matching (Q396714) (← links)
• Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
• Efficient dynamic range minimum query (Q507385) (← links)
• Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
• Combined data structure for previous- and next-smaller-values (Q533896) (← links)
• Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
• Finding range minima in the middle: approximations and applications (Q626956) (← links)
• A linear size index for approximate pattern matching (Q655440) (← links)
• On space efficient two dimensional range minimum data structures (Q692632) (← links)
• Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
• Encoding 2D range maximum queries (Q897899) (← links)
• Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
• Dynamic extended suffix arrays (Q972366) (← links)
• Wee LCP (Q991794) (← links)
• Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
• Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
• Extended suffix array construction using Lyndon factors (Q1615410) (← links)
• The range 1 query (R1Q) problem (Q1659997) (← links)
• Approximate string matching with compressed indexes (Q1662494) (← links)
• Practical compressed suffix trees (Q1736557) (← links)
• Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
• The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
• Range minimum queries in minimal space (Q2078612) (← links)
• Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
• Space-efficient construction of compressed suffix trees (Q2220837) (← links)
• Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
• Sliding suffix tree (Q2331636) (← links)
• Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
• Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
• Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
• On succinct representations of binary trees (Q2363992) (← links)
• Improved range minimum queries (Q2397152) (← links)
• Parallel construction of succinct trees (Q2410360) (← links)
• Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
• Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
• Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
• An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
• GLOUDS: representing tree-like graphs (Q2634715) (← links)
• Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
• Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
• Locally Compressed Suffix Arrays (Q2828176) (← links)
• Compact Indexes for Flexible Top-$$k$$ Retrieval (Q2942258) (← links)
• Longest Common Prefix with Mismatches (Q2949838) (← links)
• Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
• The longest common substring problem (Q2971067) (← links)
• Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)