Title: Calculations for All Common Subsequences
Description: Implements several string comparison algorithms, including calACS
(count all common subsequences), lenACS (calculate the lengths of all common subsequences), and lenLCS
(calculate the length of the longest common subsequence).
Some algorithms differentiate between the more strict
can be interrupted by other items. This difference is shown in the suffix of the algorithm (-Strict vs -Loose).
For example, q-w is a common subsequence
of q-w-e-r and q-e-w-r on the looser definition, but not on the more strict

Description: Implements several string comparison algorithms, including calACS (count all common subsequences), lenACS (calculate the lengths of all common subsequences), and lenLCS (calculate the length of the longest common subsequence). Some algorithms differentiate between the more strict definition of subsequence, where a common subsequence cannot be separated by any other items, from its looser counterpart, where a common subsequence can be interrupted by other items. This difference is shown in the suffix of the algorithm (-Strict vs -Loose). For example, q-w is a common subsequence of q-w-e-r and q-e-w-r on the looser definition, but not on the more strict definition. calACSLoose Algorithm from Wang, H. All common subsequences (2007) IJCAI International Joint Conference on Artificial Intelligence, pp. 635-640.

Title: Simple Wrapper for Computationally Expensive Functions
Description: This is a one-function package that will pass only unique values to a computationally-expensive function that returns an output of the same length as the input.
In importing and working with tidy data, it is common to have index columns, often including time stamps that are far from unique. Some functions to work with these such as text conversion to other variable types (e.g. as.POSIXct()), various grep()-based functions, and often the cut() function are relatively slow when working with tens of millions of rows or more.
Packaged: 2020-04-27 19:01:43 UTC; sfroehlich