Pages that link to "Item:Q1402213"
From MaRDI portal
The following pages link to Approximate matching of run-length compressed strings (Q1402213):
Displaying 17 items.
- Compressed matching for feature vectors (Q294934) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- An algorithm for matching run-length coded strings (Q685867) (← links)
- Classification of run-length encoded binary data (Q853145) (← links)
- Computing similarity of run-length encoded strings with affine gap penalty (Q932322) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Matching for run-length encoded strings (Q1288529) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
- Binary jumbled string matching for highly run-length compressible texts (Q2444848) (← links)
- Levenshtein graphs: resolvability, automorphisms \& determining sets (Q2689484) (← links)
- Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions (Q3177340) (← links)
- Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- (Q4547735) (← links)
