Pages that link to "Item:Q3434688"
From MaRDI portal
The following pages link to Window Subsequence Problems for Compressed Texts (Q3434688):
Displaying 7 items.
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- Tree inclusions in windows and slices (Q843598) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts (Q3011864) (← links)
