Comparison of an exact method (DFS) and a metaheuristic (Tabu Search) to solve the Longest Common Subsequence (LCS) problem in Python.
algorithms longest-common-subsequence depth-first-search tabu-search metaheuristics combinatorial-optimization recherche-tabou lcs-problem optimisation-combinatoire
-
Updated
Jul 9, 2025 - Python