Login / Signup

A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings.

Hsing-Yen AnnChang-Biau YangChiou-Ting TsengChiou-Yi Hor
Published in: Inf. Process. Lett. (2008)
Keyphrases
  • run length
  • longest common subsequence
  • computational complexity
  • np hard
  • matching algorithm
  • machine learning
  • optimal solution
  • edit distance
  • dynamic programming
  • gray level