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}
}
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
13 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

ed.): Advances in structural and syntactic pattern recognition

  • H. Bunke
  • Singapore: World Scientific Publ. Co
  • 1993

An O ( ND ) difference algorithm and its variations

  • E. W. Myers
  • Algorithmica
  • 1986

Algorithms for approximate string matching

  • W. J. Masek
  • Inform . Control
  • 1985

Computer text recognition and error correction

  • S. N. Srihari
  • Silver Spring : IEEE Computer Society Press
  • 1985

ed.): Computer text recognition and error correction. Silver Spring: IEEE Computer Society

  • S. N. Srihari
  • 1985
1 Excerpt

Binary codes capable of correcting deletions , insertions , and reversals

  • V. I. Levensthtein
  • Cyber - netics and Control Theory
  • 1966

Similar Papers

Loading similar papers…