A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem

Christian Blum, Pedro Pinacho-Davidson

The longest run subsequence (LRS) problem is an NP-hard combinatorial optimization problem belonging to the class of subsequence problems from bioinformatics. In particular, the pr…