longestrunsubsequence
Implementation of a solver for the Longest Run Subsequence Problem. Given a sequence as input, compute a longest subsequence such that there is at most one run for every character.More Information
For more information visit the longestrunsubsequence website.
Available Versions
These versions of longestrunsubsequence are available on the BEAR systems (BlueBEAR and BEAR Cloud VMs). These will be retained in accordance with our Applications Support and Retention Policy.
Version | BEAR Apps Version |
---|---|
1.0.1-foss-2024a | 2024a |