pmatchPattern {Biostrings} | R Documentation |
Functions for searching the Longest Common Prefix/Suffix/Substring of two strings.
WARNING: These functions are currently under development and might not work properly! Full documentation will come later.
Please send questions/comments to hpages@fhcrc.org
Thanks for your comprehension!
lcprefix(s1, s2) lcsuffix(s1, s2) lcsubstr(s1, s2) pmatchPattern(pattern, subject, maxlength.out=1L)
s1 |
1st string, a character string or a BString object. |
s2 |
2nd string, a character string or a BString object. |
pattern |
The pattern string. |
subject |
A BString (or derived) object containing the subject string. |
maxlength.out |
The maximum length of the output i.e. the maximum number of views in the returned object. |
[TODO]
[TODO]
matchPattern, BStringViews-class, BString-class, DNAString-class, RNAString-class, AAString-class
## [TODO]