Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints

2019 
Abstract In this article, we consider a generalized longest common subsequence (LCS) problem with multiple substring inclusive constraints. For the two input sequences X and Y of lengths n and m, a...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []