subseq_long0: Find the longest subsequence(s) common to two sequences
In jalapic/behavseq: Sequential methods for the behavioral sciences
Description
Usage
Arguments
Value
Further details
Examples
Description
Find the longest subsequence(s) common to two sequences
Usage
1
subseq_long0(x, y)
Arguments
x
character sequence 1
y
character sequence 2
Value
Longest subsequence(s) common to both
Further details
Find the longest subsequence(s) common to two sequences
Examples
1
subseq_long0("ababdcbdabdbcabadbcbabbcbdabc", "dbadbcdbadbcaddbdddbc")
jalapic/behavseq documentation built on May 18, 2019, 11:17 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.
Description Usage Arguments Value Further details Examples
Description
Find the longest subsequence(s) common to two sequences
Usage
1 | subseq_long0(x, y)
|
Arguments
x |
character sequence 1 |
y |
character sequence 2 |
Value
Longest subsequence(s) common to both
Further details
Find the longest subsequence(s) common to two sequences
Examples
1 | subseq_long0("ababdcbdabdbcabadbcbabbcbdabc", "dbadbcdbadbcaddbdddbc")
|
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.