Jia Jie Liu

Learn More
In this paper, we propose an O(min{mN, Mn}) time algorithm for finding a longest common subsequence of strings X and Y with lengths M and N, respectively, and run-length-encoded lengths m and n, respectively. We propose a new recursive formula for finding a longest common subsequence of Y and X which is in the run-length-encoded format. That is, Y =y 1 y 2(More)
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) space, for two strings of lengths m and n, with m and n runs, respectively. We assume the linear-gap model and make no assumption on the scoring matrices, which maximizes the(More)