Constrained Longest Common Subsequences with Run-Length-Encoded Strings

被引:4
作者
Liu, Jia-Jie [1 ]
Wang, Yue-Li [2 ]
Chiu, Yu-Shan [1 ]
机构
[1] Shih Hsin Univ, Dept Informat Management, Taipei 10607, Taiwan
[2] Natl Taiwan Univ Sci & Technol, Dept Informat Management, Taipei, Taiwan
关键词
longest common subsequence; constrained longest common subsequence; run-length-encoding; string compression; EDIT DISTANCE; ALGORITHM;
D O I
10.1093/comjnl/bxu012
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Given two strings X and Y and a constraining string P, a string Z is called a constrained longest common subsequence of X and Y with respect to P if Z is the longest common subsequence of X and Y such that P is a subsequence of Z. In this paper, we propose an O(r x min{mN, nM})-time algorithm for solving this problem, where m, n and r are the lengths of X, Y and P, respectively, and M and N are the number of runs of the run-length-encoded strings of X and Y, respectively.
引用
收藏
页码:1074 / 1084
页数:11
相关论文
共 17 条