Pages that link to "Item:Q5756685"
From MaRDI portal
The following pages link to Querying and Embedding Compressed Texts (Q5756685):
Displayed 12 items.
- Leaf languages and string compression (Q550251) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Compressed Membership in Automata with Compressed Labels (Q3007633) (← 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)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- (Q5092480) (← links)
- Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662) (← links)