Highly Influenced

# An algorithm for matching run-length coded strings

@article{Bunke1993AnAF, title={An algorithm for matching run-length coded strings}, author={Horst Bunke and J{\'a}nos Csirik}, journal={Computing}, year={1993}, volume={50}, pages={297-314} }

- Published 1993 in Computing
DOI:10.1007/BF02243873

An algorithm for the computation of the edit distance of run-length coded strings is given. In run-length coding, not all individual symbols in a string are explicitly listed. Instead, one run of identical consecutive symbols is coded by giving one representative symbol together with its multiplicity. The algorithm determines the minimum cost sequence of edit operations transforming one string into another. In the worst case, the algorithm has a time complexity ofO(n·m), wheren andm give the… CONTINUE READING