calACSLoose: Calculate the total number of all common subsequences between...

Description Usage Arguments Value Examples

View source: R/calACSLoose.r

Description

Calculate the total number of all common subsequences between a string and a vector/list of strings. Subsequences can be interrupted by items, i.e. q-w is considered a subsequence of q-e-w-r

Usage

1
calACSLoose(vecA, listB, sep = "-", dropFirstItem = FALSE)

Arguments

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

Value

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

Examples

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

calACS documentation built on May 30, 2017, 7:17 a.m.