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.

AuthorAlan Gu
Date of publication2016-03-31 19:35:54
MaintainerAlan Gu <alan.on.ca@gmail.com>
LicenseGPL
Version2.2.2

View on CRAN

Files in this package

calACS
calACS/NAMESPACE
calACS/R
calACS/R/is.subvector.r
calACS/R/calACSLoose.r
calACS/R/longestVec.r
calACS/R/calACSstrLoose.r
calACS/R/GeneratePossibleSubsequences.r
calACS/R/calACSstrStrict.R calACS/R/calACSStrict.R
calACS/R/lenACSStrict.r
calACS/R/lenLCSStrict.r
calACS/R/lenLCSstrStrict.r
calACS/R/lenACSstrStrict.r
calACS/MD5
calACS/DESCRIPTION
calACS/man
calACS/man/longestVec.Rd calACS/man/calACSStrict.Rd calACS/man/lenLCSStrict.Rd calACS/man/lenACSStrict.Rd calACS/man/calACSLoose.Rd

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.