id: 01856426
dt: j
an: 01856426
au: Arbell, Ora; Landau, Gad M.; Mitchell, Joseph S. B.
ti: Edit distance of run-length encoded strings.
so: Inf. Process. Lett. 83, No. 6, 307-314 (2002).
py: 2002
pu: Elsevier Sciences Publishers (North-Holland), Amsterdam
la: EN
cc: 
ut: String matching; Dynamic programming; Run-length compression; Edit
    distance; Algorithms
ci: 
li: doi:10.1016/S0020-0190(02)00215-6
ab: Summary: Let $X$ and $Y$ be two run-length encoded strings, of encoded
    lengths $k$ and $l,$ respectively. We present a simple $O(\vert X\vert
    l+\vert Y\vert k)$ time algorithm that computes their edit distance.
rv: