calACS: Calculations for All Common Subsequences

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.

Version: 2.2.2
Published: 2016-03-31
Author: Alan Gu
Maintainer: Alan Gu <alan.on.ca at gmail.com>
License: GPL-2 | GPL-3 [expanded from: GPL]
NeedsCompilation: no
CRAN checks: calACS results

Downloads:

Reference manual: calACS.pdf
Package source: calACS_2.2.2.tar.gz
Windows binaries: r-devel: calACS_2.2.2.zip, r-release: calACS_2.2.2.zip, r-oldrel: calACS_2.2.2.zip
OS X Mavericks binaries: r-release: calACS_2.2.2.tgz, r-oldrel: calACS_2.2.2.tgz
Old sources: calACS archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=calACS to link to this page.