Pages that link to "Item:Q843615"
From MaRDI portal
The following pages link to Faster subsequence recognition in compressed strings (Q843615):
Displaying 11 items.
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Finding characteristic substrings from compressed texts (Q2909195) (← 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)
- (Q5091741) (← links)
- Efficient List-Based Computation of the String Subsequence Kernel (Q5404907) (← links)