calACS: Calculations for All Common Subsequences
Version 2.2.2

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.

Getting started

Package details

AuthorAlan Gu
Date of publication2016-03-31 19:35:54
MaintainerAlan Gu <alan.on.ca@gmail.com>
LicenseGPL
Version2.2.2
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("calACS")

Try the calACS package in your browser

Any scripts or data that you put into this service are public.

calACS documentation built on May 30, 2017, 7:17 a.m.