The following pages link to (Q2728909):
Displaying 12 items.
- A fast dynamic compression scheme for natural language texts (Q630711) (← links)
- String matching over compressed text on handheld devices using tagged sub-optimal code (TSC) (Q813136) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Improved characters distance sampling for online and offline text searching (Q2682926) (← links)
- Re-examining regular expressions with backreferences (Q2699953) (← links)
- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding (Q2942259) (← links)
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (Q3602815) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)