Showing cs.AIShow all
3 papers · 1 filter
cs.AI2026
Neuro-Evolved Heuristics for Variable Gapped Common Subsequence Identification
Marko DjukanoviÄ, Christian Blum, Aleksandar Kartelj +2
This study addresses the Variable Gapped Longest Common Subsequence Problem (VGLCSP), a variant of the classical longest common subsequence problem with additional gap constraints…
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.AI2024
A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem
Marko DjukanoviÄ, Jaume Reixach, Ana Nikolikj +3
This paper addresses the Restricted Longest Common Subsequence (RLCS) problem, an extension of the well-known Longest Common Subsequence (LCS) problem. This problem has significant…