58 citations · 115 across the 15 of their papers we have counts for
1 paper · 2 filters
Soroush Vahidi, Baruch Schieber, Zhihui Du +1
One of the most critical problems in the field of string algorithms is the longest common subsequence problem (LCS). The problem is NP-hard for an arbitrary number of strings but c…