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