6 citations · 11 across the 8 of their papers we have counts for
8 papers
A Simple and Space Efficient Segment Tree Implementation
Lei Wang, Xiaodong Wang
The segment tree is an extremely versatile data structure. In this paper, a new heap based implementation of segment trees is proposed. In such an implementation of segment tree, t…
A simple linear space algorithm for computing a longest common increasing subsequence
Daxin Zhu, Lei Wang, Tinran Wang +1
This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space alg…
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…
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…
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…
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…