Edit distance for a run-length-encoded string and an uncompressed string

@article{Liu2007EditDF,
  title={Edit distance for a run-length-encoded string and an uncompressed string},
  author={Jia Jie Liu and Guan-Shieng Huang and Yue-Li Wang and Richard C. T. Lee},
  journal={Inf. Process. Lett.},
  year={2007},
  volume={105},
  pages={12-16}
}
We propose a new algorithm for computing the edit distance of an uncompressed string against a run-length-encoded string. For an uncompressed string of length n and a compressed string with M runs, the algorithm computes their edit distance in time O(Mn). This result directly implies an O(min{mN,Mn}) time algorithm for strings of lengths m and n with M and N runs, respectively. It improves the previous best known time bound O(mN + Mn). © 2007 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

E

  • K. Sayoood
  • Fow (Eds.), Introduction to Data Compression…
  • 2000
1 Excerpt

Binary codes capable of correcting

  • V. I. Levenshtein
  • deletions, insertions and reversals, Soviet…
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…