Pages that link to "Item:Q2464333"
From MaRDI portal
The following pages link to Compressed suffix trees with full functionality (Q2464333):
Displaying 25 items.
- The longest common substring problem (Q2971067) (← links)
- An Estimation of the Size of Non-Compact Suffix Trees (Q2973237) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Kings, Name Days, Lazy Servants and Magic (Q3305728) (← links)
- Arithmetics on Suffix Arrays of Fibonacci Words (Q3449364) (← links)
- Dynamic Fully-Compressed Suffix Trees (Q3506953) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- Fast matching statistics in small space (Q5140728) (← links)
- Dualities in tree representations (Q5140782) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
- Engineering a compressed suffix tree implementation (Q5406217) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711551) (← links)
- Combinatorial Pattern Matching (Q5713567) (← links)
- (Q5743458) (← links)
- (Q6065424) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- Algorithms and complexity on indexing founder graphs (Q6103519) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q6536270) (← links)
- Space-time trade-offs for the LCP array of Wheeler DFAs (Q6545421) (← links)
- Computing all-vs-all MEMs in grammar-compressed text (Q6545422) (← links)
- Non-overlapping indexing in BWT-runs bounded space (Q6545434) (← links)
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs (Q6610090) (← links)
