activity
20132015
most citedAn Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains

2 citations · 4 across the 7 of their papers we have counts for

collaborators

7 papers

cs.DS2015★ 1 cited

A Practical O(R\log\log n+n) time Algorithm for Computing the Longest Common Subsequence

Daxin Zhu, Lei Wang, Yingjie Wu +1

In this paper, we revisit the much studied LCS problem for two given sequences. Based on the algorithm of Iliopoulos and Rahman for solving the LCS problem, we have suggested 3 new…

cs.DS2015

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

Daxin Zhu, Lei Wang, Yingjie Wu +1

In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length must be included as a substring and the other constraini…

cs.DS2015★ 1 cited

An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints

Daxin Zhu, Lei Wang, Yingjie Wu +1

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

cs.DS2014

A note on the largest number of red nodes in red-black trees

Yingjie Wu, Daxin Zhu, Lei Wang +1

In this paper, we are interested in the number of red nodes in red-black trees. We first present an time dynamic programming solution for computing , the large…

cs.DS2013

Complete Solutions for a Combinatorial Puzzle in Linear Time

Lei Wang, Xiaodong Wang, Yingjie Wu +1

In this paper we study a single player game consisting of black checkers and white checkers, called shifting the checkers. We have proved that the minimum number of steps n…

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…