The following pages link to Combinatorial Pattern Matching (Q5713568):
Displaying 18 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- Flexible indexing of repetitive collections (Q2011648) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Parallel lightweight wavelet tree, suffix array and FM-index construction (Q2397146) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Deterministic Sparse Suffix Sorting on Rewritable Texts (Q2802962) (← links)
- Composite Repetition-Aware Data Structures (Q2942243) (← links)
- Counting Colours in Compressed Strings (Q3011854) (← links)
- (Q5088898) (← links)
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space (Q5133958) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- String Processing and Information Retrieval (Q5393958) (← links)
- (Q5708460) (← links)
- (Q5874481) (← links)
- Wheeler maps (Q6547930) (← links)