Computing the longest common subsequence of two run-length encoded strings

Abstract

The present article reveals that the problem of finding the longest common subsequence of two strings given in run-length encoded form can be solved in O(mnlog log min(m, n, M/m, N/n, X)) time, where one input string is of length M with m runs, the other is of length N with n runs, and X is the average difference between the length of a run from one input string and that of a run from the other. © Springer-Verlag 2012.