The String-to-String Correction Problem
Journal of the ACM (JACM)
Simple and fast linear space computation of longest common subsequences
Information Processing Letters
The constrained longest common subsequence problem
Information Processing Letters
A simple algorithm for the constrained sequence problems
Information Processing Letters
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science
Dynamic programming algorithms for the mosaic longest common subsequence problem
Information Processing Letters
Two algorithms for LCS Consecutive Suffix Alignment
Journal of Computer and System Sciences
Exemplar Longest Common Subsequence
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient algorithms for finding interleaving relationship between sequences
Information Processing Letters
New efficient algorithms for the LCS and constrained LCS problems
Information Processing Letters
Efficient algorithms for the block edit problems
Information and Computation
A polyhedral investigation of the LCS problem and a repetition-free variant
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Repetition-free longest common subsequence
Discrete Applied Mathematics
Variants of constrained longest common subsequence
Information Processing Letters
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the generalized constrained longest common subsequence problems
Journal of Combinatorial Optimization
On the parameterized complexity of the repetition free longest common subsequence problem
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we generalize the inclusion constrained longest common subsequence (CLCS) problem to the hybrid CLCS problem which is the combination of the sequence inclusion CLCS and the string inclusion CLCS, called the sequential substring constrained longest common subsequence (SSCLCS) problem. In the SSCLCS problem, we are given two strings A and B of lengths m and n, respectively, formed by alphabet @S and a constraint sequence C formed by ordered strings (C^1,C^2,C^3,...,C^l) with total length r. The problem is that of finding the longest common subsequence D of A and B containing C^1,C^2,C^3,...,C^l as substrings and with the order of the C's retained. This problem has two variants, depending on whether the strings in C cannot overlap or may overlap. We propose algorithms with O(mnl+(m+n)(|@S|+r)) and O(mnr+(m+n)|@S|) time for the two variants. For the special case with one or two constraints, our algorithm runs in O(mn+(m+n)(|@S|+r)) or O(mnr+(m+n)|@S|) time, respectively-an order faster than the algorithm proposed by Chen and Chao.