| Name : R-calACS
| |
| Version : 2.2.2
| Vendor : obs://build_opensuse_org/devel:languages:R
|
| Release : lp153.2.13
| Date : 2024-06-14 11:05:38
|
| Group : Development/Libraries/Other
| Source RPM : R-calACS-2.2.2-lp153.2.13.src.rpm
|
| Size : 0.03 MB
| |
| Packager : (none)
| |
| Summary : Calculations for All Common Subsequences
|
Description :
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.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/R:/autoCRAN/openSUSE_Leap_15.3/x86_64 |
