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.
https://anaconda.org/bioconda/longestrunsubsequence/badges/version.svg
https://anaconda.org/bioconda/longestrunsubsequence/badges/latest_release_date.svg
https://anaconda.org/bioconda/longestrunsubsequence/badges/latest_release_relative_date.svg
https://anaconda.org/bioconda/longestrunsubsequence/badges/platforms.svg
https://anaconda.org/bioconda/longestrunsubsequence/badges/license.svg
https://anaconda.org/bioconda/longestrunsubsequence/badges/downloads.svg