activity
20132018
most citedA simple linear space algorithm for computing a longest common increasing subsequence

6 citations · 11 across the 8 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

cs.DS2013★ 2 cited

An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains

Lei Wang, Xiaodong Wang, Yingjie Wu +1

In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences and of lengths and…

cs.DS2013

A Dynamic Programming Solution to a Generalized LCS Problem

Lei Wang, Xiaodong Wang, Yingjie Wu +1

In this paper, we consider a generalized longest common subsequence problem, the string-excluding constrained LCS problem. For the two input sequences and of lengths an…