The following pages link to Fully compressed suffix trees (Q3189038):
Displaying 20 items.
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Linear-size suffix tries (Q294967) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Tree path majority data structures (Q784481) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- Ranked document selection (Q2297857) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Succinct 2D dictionary matching (Q2392930) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Locally Compressed Suffix Arrays (Q2828176) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- The longest common substring problem (Q2971067) (← links)
- (Q5091063) (← links)
- Structural Pattern Matching - Succinctly. (Q5136254) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
