An efficient dynamic programming algorithm for a new generalized LCS problem

被引：0

作者：

Zhu, Daxin ^{[1
]}

Wang, Lei ^{[2
]}

Tian, Jun ^{[3
]}

Wang, Xiaodong ^{[4
]}

机构：

[1] Quanzhou Normal University, Quanzhou, China

[2] Facebook, 1 Hacker Way, Menlo Park,CA,94052, United States

[3] Fujian Medical University, Fuzhou, China

[4] Fujian University of Technology, Fuzhou, China

来源：

IAENG International Journal of Computer Science | 2016年 / 43卷 / 02期

关键词：

Dynamic programming algorithm - Input sequence - Longest common subsequence problem - Longest common subsequences - Substring - Time complexity - Time dynamic;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length s must be included as a substring and the other constraining sequence of length t must be included as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences X and Y of lengths n and m, and the given two constraining sequences of length s and t, we present an O(nmst) time dynamic programming algorithm for solving the new generalized longest common subsequence problem. The time complexity can be reduced further to cubic time in a more detailed analysis. The correctness of the new algorithm is proved.

引用

页码：204 / 211

共 50 条

[1] An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
Wu, Yingjie
Wang, Lei
Zhu, Daxin
Wang, Xiaodong
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2014, 26 : 98 - 105
[2] A dynamic programming solution to a generalized LCS problem
Wang, Lei
Wang, Xiaodong
Wu, Yingjie
Zhu, Daxin
[J]. INFORMATION PROCESSING LETTERS, 2013, 113 (19-21) : 723 - 728
[3] A Dynamic Programming Algorithm for a Generalized LCS Problem with Multiple Subsequence Inclusion Constraints
Zhu, Daxin
Wu, Yingjie
Wang, Xiaodong
[J]. INTERNET OF VEHICLES - SAFE AND INTELLIGENT MOBILITY, IOV 2015, 2015, 9502 : 439 - 446
[4] An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-IC-LCS Problem
Zhu, Daxin
Wang, Xiaodong
[J]. PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING FOR MECHANICS AND MATERIALS, 2015, 21 : 159 - 163
[5] An Efficient Dynamic Programming Algorithm for STR-IC-STR-IC-LCS Problem
Zhu, Daxin
Wu, Yingjie
Wang, Xiaodong
[J]. ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2016, PT II, 2016, 9652 : 466 - 477
[6] An Efficient Dynamic Programming Algorithm for STR-IC-STR-EC-LCS Problem
Zhu, Daxin
Wu, Yingjie
Wang, Xiaodong
[J]. GREEN, PERVASIVE, AND CLOUD COMPUTING, 2016, 9663 : 3 - 17
[7] An Efficient Algorithm for a New Constrained LCS Problem
Zhu, Daxin
Wu, Yingjie
Wang, Xiaodong
[J]. Intelligent Information and Database Systems, ACIIDS 2016, Pt II, 2016, 9622 : 261 - 267
[8] EFFICIENT SPARSE DYNAMIC PROGRAMMING FOR THE MERGED LCS PROBLEM WITH BLOCK CONSTRAINTS
Peng, Yung-Hsing
Yang, Chang-Biau
Huang, Kuo-Si
Tseng, Chiou-Ting
Hor, Chiou-Yi
[J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2010, 6 (04): : 1935 - 1947
[9] New Efficient Algorithms for the Merged LCS Problem With and Without Block Constraints Using Sparse Dynamic Programming
Rahman, A. H. M. Mahfuzur
Rahman, M. Sohel
[J]. 2012 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT), 2012, : 26 - 35
[10] An efficient sequential algorithm for the k-LCS problem
Semé, D
[J]. COMPUTER APPLICATIONS IN INDUSTRY AND ENGINEERING, 2000, : 185 - 188

← 1 2 3 4 5 →