1 paper · 1 filter
Farhana Akter Tumpa, Rebin Silva Valan Arasu, Rajiv Gupta
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…