The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
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 |
| DOI: | 10.32614/CRAN.package.calACS |
| 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 |
| 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 |
| macOS binaries: | r-release (arm64): calACS_2.2.2.tgz, r-oldrel (arm64): calACS_2.2.2.tgz, r-release (x86_64): calACS_2.2.2.tgz, r-oldrel (x86_64): calACS_2.2.2.tgz |
| Old sources: | calACS archive |
Please use the canonical form https://CRAN.R-project.org/package=calACS to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.