LCS: Compute longest common substring of two strings.
In PTXQC: Quality Report Generation for MaxQuant and mzTab Results
LCS 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
PTXQC documentation built on May 29, 2024, 9:26 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| LCS | 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
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.