1 paper
Wing-Kai Hon, Dominik Köppl, Jun-Hong Wang
We study a tie-breaking variant of the longest common subsequence problem on run-length encoded strings. Given two strings, the goal is first to maximize the number of equal aligne…