Pages that link to "Item:Q1939665"
From MaRDI portal
The following pages link to A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665):
Displaying 9 items.
- An algorithm for matching run-length coded strings (Q685867) (← links)
- Computing similarity of run-length encoded strings with affine gap penalty (Q932322) (← links)
- Edit distance of run-length encoded strings. (Q1853090) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
- Fast exact dynamic time warping on run-length encoded time series (Q2684485) (← links)
- Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions (Q3177340) (← links)
- (Q5092429) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)