1 paper
Zhi Wang, Yanni Li, Tihua Duan +3
Mining multiple longest common subsequences (\textit{MLCS}) from a set of sequences of three or more over a finite alphabet I^£ (a classical NP-hard problem) is an important task…