论文信息 - An Efficient Algorithm for a New Constrained LCS Problem

An Efficient Algorithm for a New Constrained LCS Problem

The solution to a generalized longest common subsequence problem is addressed in this paper. In this problem, two given sequences of their length s and t must be included as the subsequences of the two main sequences A and B, and the result subsequences must be the longest. If the lengths of the two main sequences A and B are n and m, and the lengths of their two constrained sequences are s and t respectively, the time complexity of the dynamic programming algorithm presented in this paper to solve the new generalized LCS problem must be O(nmst).

[1] Sebastian Deorowicz,et al. Quadratic-time algorithm for a string constrained LCS problem , 2011, Inf. Process. Lett..

[2] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[3] Yin-Te Tsai,et al. Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment , 2003, J. Bioinform. Comput. Biol..

[4] Kun-Mao Chao,et al. On the generalized constrained longest common subsequence problems , 2011, J. Comb. Optim..

[5] Mike Paterson,et al. A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..

[6] Moshe Lewenstein,et al. Constrained LCS: Hardness and Approximation , 2008, CPM.

[7] Sebastian Deorowicz,et al. Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem , 2010, Fundam. Informaticae.

[8] Ricardo A. Baeza-Yates,et al. Searching Subsequences , 1991, Theor. Comput. Sci..

[9] Chang-Biau Yang,et al. An Algorithm and Applications to Sequence Alignment with Weighted Constraints , 2010, Int. J. Found. Comput. Sci..

[10] Yin-Te Tsai,et al. The constrained longest common subsequence problem , 2003, Inf. Process. Lett..