Added function ‘common’ which identifies common substrings inside a pair of chains
Expanded function “fcommon” capability to parallel processing for substrings longer than 20 characters. A local parallel plan is set when formal argument “strategy” receives a value. Pending on this, formal argments “workers” and “maxSize” may also receive values. Without a parallel plan, the function returns long substrings as they are with a message.
Function “fcommon” output is no longer a closure but a character vector.
Function “common” remains available.
Modified the Manual accordingly.
Added package “future” to Suggests and package “future.apply” to Depends in DESCRIPTION.
Minor changes to “fcommon” code.
Added function “cover” which calculates the number of combinations for a common substring covering. Returns the “total”, “min”, “max” as a prettified, named vector and a plot on request.
Modified the Manual accordingly.
Function “common” is now deprecated.
Bugfix: Re-coded the sequence isolation in matrix indices routine which were missing few short substrings.
Redesigned function “fcommon” which is now fully sequential.
Expanded function “cover” capability to show a list of valid substrings out of the string covering using combinatorial method (recommended for short strings).
Removed packages ‘future.apply’ from Depends and ‘future’ from Suggests in DESCRIPTION.
Function “common” is now defunct.