calACS (2.2.2)
Calculations for All Common Subsequences.
http://cran.rproject.org/web/packages/calACS
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, qw is a common subsequence of qwer and qewr 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. 635640.
Maintainer:
Alan Gu
Author(s): Alan Gu
License: GPL
Uses: Does not use any package
Released almost 4 years ago.
4 previous versions
 calACS_2.2.1. Released almost 4 years ago.
 calACS_1.2. Released about 4 years ago.
 calACS_1.1. Released about 4 years ago.
 calACS_0.2. Released about 4 years ago.
Ratings
Overall: 

Documentation: 

Log in to vote.
Reviews
No one has written a review of calACS yet. Want to be the first? Write one now.
Related packages: … (20 best matches, based on common tags.)
Search for calACS on google, google scholar, rhelp, rdevel.
Visit calACS on R Graphical Manual.