OVT-MLCS: An Online Visual Tool for MLCS Mining from Long or Big Sequences

arXiv:2604.13037v1 Announce Type: cross Abstract: Mining multiple longest common subsequences (\textit{MLCS}) from a set of sequences of three or more over a finite alphabet $\Sigma$ (a classical NP-hard problem) is an important task in a wide variety of application fields. Unfortunately, there is...