calACS (1.2)

Count All Common Subsequences.

Count all common subsequences between 2 string sequences, with items separated by the same delimiter. The first string input is a length- one vector, the second string input can be a vector or list containing multiple strings. The algorithm differentiates 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. For example, q-w is a common subsequence of q-w-e-r and q-e-w-r on the looser definition, but not the more strict definition. calACSLoose Algorithm from Wang, H. All common subsequences (2007) IJCAI International Joint Conference on Artificial Intelligence, pp. 635-640.

Maintainer: Alan Gu
Author(s): Alan Gu

License: GPL

Uses: Does not use any package

Released about 4 years ago.