Year: 2015
Type: conference-paper
Abstract: In this paper, we consider a generalized longest common subsequence problem, in which two constraining sequences of length s and t 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 X and Y of lengths n and m , and the given two constraining sequences of length s and t , we present an ) (nmst O time dynamic programming algorithm for solving the new generalized longest common subsequence problem.The correctness of the new algorithm is proved.
Authors: Daxin Zhu, Xiaodong Wang
Institutions: Quanzhou Normal University, Fujian University of Technology
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4253152196