lenLCSStrict: Calculate the length of the longest common subsequence (KCS)...

Description Usage Arguments Value Examples

View source: R/lenLCSStrict.r

Description

Calculate the length of the longest common subsequence (KCS) 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'

Usage

1
lenLCSStrict(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

A list of vectors of the length of each common subsequence

Examples

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

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

Related to lenLCSStrict in calACS...