3 papers
cs.AI2026
On Solving the Multiple Variable Gapped Longest Common Subsequence Problem
Marko Djukanović, Nikola Balaban, Christian Blum +3
This paper addresses the Variable Gapped Longest Common Subsequence (VGLCS) problem, a generalization of the classical LCS problem involving flexible gap constraints between consec…
cs.NE2025
LLM-Based Instance-Driven Heuristic Bias In the Context of a Biased Random Key Genetic Algorithm
Camilo Chacón Sartori, Martín Isla Pino, Pedro Pinacho-Davidson +1
Integrating Large Language Models (LLMs) within metaheuristics opens a novel path for solving complex combinatorial optimization problems. While most existing approaches leverage L…
cs.AI2025
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…