The following pages link to (Q5390005):
Displaying 16 items.
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- Edit distance with block deletions (Q1736478) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- Compression-based distance between string data and its application to literary work classification based on authorship (Q2255859) (← links)
- Generalized substring compression (Q2437745) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts (Q2891377) (← 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)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Boosting over non-deterministic ZDDs (Q5919322) (← links)
- Extended formulations via decision diagrams (Q6591617) (← links)
