Faster STR-EC-LCS Computation

Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga +2

The longest common subsequence (LCS) problem is a central problem in stringology that finds the longest common subsequence of given two strings $A$ and $B$. More recently, a set of…