R中最长的公共子串在两个字符串之间找到非连续匹配

I have a question regarding finding the longest common substring in R. While searching through a few posts on StackOverflow, I got to know about the qualV package. However, I see that the LCS function in this package actually finds all characters from string1 which are present in string2, even if they are not contiguous.I have a question regarding finding the longest