Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
An Efficient Algorithm for a New Constrained LCS Problem
verfasst von : Daxin Zhu, Yingjie Wu, Xiaodong Wang
Erschienen in: Intelligent Information and Database Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
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).