24 citations · 82 across the 26 of their papers we have counts for
1 paper · 1 filter
François Le Gall, Saeed Seddighin
Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance (UL) are three fundamental string problems that can be classically solved in near linear time.…