Description Usage Arguments Value Examples

Count the total number of all common subsequences between a string and a vector/list of strings. Subsequences cannot be interrupted by any item, i.e. q-w is not considered a subsequence of q-e-w-r due to the interrupting 'e'

1 2 | ```
calACSStrict(vecA, listB, sep = "-", dropFirstItem = FALSE,
ignoreLenOneSubseq = FALSE, ignoreLenZeroSubseq = FALSE)
``` |

`vecA` |
The single string |

`listB` |
The vector/list of 1 or more strings |

`sep` |
Delimiter separating each items in a sequence |

`dropFirstItem` |
Boolean. If true, the first item in each sequence is excluded from counting all subsequences |

`ignoreLenOneSubseq` |
Boolean. If true, all length one subequences are not counted as common subsequences |

`ignoreLenZeroSubseq` |
Boolean. If true, the length zero subsequence (empty set) is not counted as a common subsequence |

The total number of all common subsequences as an integer in a vector

1 2 | ```
calACSStrict("q-w-e-r", c("q-e-w-r","q-r-e-w"), "-")
calACSStrict("itemToBeDropped-q-w-e-r", "itemToBeDroped-q-e-w-r", "-", dropFirstItem=TRUE)
``` |

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.