Proceedings of the 5th International Conference on Information Engineering for Mechanics and Materials

An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-IC-LCS Problem

Authors
Daxin Zhu, Xiaodong Wang
Corresponding Author
Daxin Zhu
Available Online July 2015.
DOI
10.2991/icimm-15.2015.31How to use a DOI?
Keywords
Generalized LCS; subsequences; dynamic programming; algorithm.
Abstract

In this paper, we consider a generalized longest common subsequence problem, in which two constraining sequences of length and must be included as the subsequences of the two main sequences and the length of the result must be maximal. For the two input sequences and of lengths and , and the given two constraining sequences of length and , we present an time dynamic programming algorithm for solving the new generalized longest common subsequence problem. The correctness of the new algorithm is proved.

Copyright
© 2015, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 5th International Conference on Information Engineering for Mechanics and Materials
Series
Advances in Engineering Research
Publication Date
July 2015
ISBN
978-94-62520-88-2
ISSN
2352-5401
DOI
10.2991/icimm-15.2015.31How to use a DOI?
Copyright
© 2015, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Daxin Zhu
AU  - Xiaodong Wang
PY  - 2015/07
DA  - 2015/07
TI  - An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-IC-LCS Problem
BT  - Proceedings of the 5th International Conference on Information Engineering for Mechanics and Materials
PB  - Atlantis Press
SP  - 159
EP  - 163
SN  - 2352-5401
UR  - https://doi.org/10.2991/icimm-15.2015.31
DO  - 10.2991/icimm-15.2015.31
ID  - Zhu2015/07
ER  -