2 citations · 3 across the 4 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
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…