A BRKGA with an efficient random-key decoder is reported to beat MMAS and CPLEX on the NP-hard longest run subsequence problem, though large-alphabet instances still need improvement.
How do rna folding algorithms work? Nature Biotechnology, 22 0 (11): 0 1457--1458, 2004
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem
A BRKGA with an efficient random-key decoder is reported to beat MMAS and CPLEX on the NP-hard longest run subsequence problem, though large-alphabet instances still need improvement.