Preprint
Sep 2026
A Configurable Heuristic for the MLCS Problem
Motivation: The Multiple Longest Common Subsequence (MLCS) problem for an arbitrary number of sequences is an NP-hard problem in sequence analysis. Existing exact algorithms based on dynamic programming or MLCS-DAG pruning rapidly exhaust memory as sequence lengths and set sizes grow, while heuristic and hyper-heuristi...
Farhana Akter Tumpa, R. Arasu, Rajiv Gupta
· 0 citations