Pages that link to "Item:Q2380032"
From MaRDI portal
The following pages link to Edit distance for a run-length-encoded string and an uncompressed string (Q2380032):
Displaying 7 items.
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- (Q5092429) (← links)