Calculations for All Common Subsequences

[Up] [Top]

Documentation for package ‘calACS’ version 2.2.1

Help Pages

calACSLoose 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
calACSStrict 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'
calACSstrLoose Internal function: Calculate the total number of all common subsequences between 2 strings. Subsequences can be interrupted by items, i.e. q-w is a common subsequence of q-w-e-r and q-e-w-r
calACSstrStrict Internal function: Calculate the total number of all common subsequences between 2 strings Subsequences cannot be interrupted by any item, i.e. q-w is not a common subsequence of q-w-e-r and q-e-w-r due to the interrupting 'e' in the second sequence
GeneratePossibleSubsequences Internal function: Genearte all possible subsequences of the input vector. Require all items in the vector to be unique
is.subvector Internal function: Check if the input vector subvec is a subvector of the other input vector vec
lenACSStrict Calculate the length of each 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'
lenACSstrStrict Internal function: Calculate the length of the common subsequences between 2 input strings
lenLCSStrict 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'
lenLCSstrStrict Internal function: Calculate the length of the longest common subsequence between 2 input strings
longestVec The function takes in multiple vectors of any length, and returns the one with the longest length. The tieBreaker variable controls if the first or the last of the longest vectors gets returned in case there are multiple