| LCS {PTXQC} | R Documentation |
Compute longest common substring of two strings.
Description
Implementation is very inefficient (dynamic programming in R) –> use only on small instances
Usage
LCS(s1, s2)
Arguments
s1 |
String one |
s2 |
String two |
Value
String containing the longest common substring
[Package PTXQC version 1.1.1 Index]