AI RESEARCH
OVT-MLCS: An Online Visual Tool for MLCS Mining from Long or Big Sequences
arXiv CS.AI
•
ArXi:2604.13037v1 Announce Type: cross Mining multiple longest common subsequences (\textit{MLCS}) from a set of sequences of three or over a finite alphabet $\Sigma$ (a classical NP-hard problem) is an important task in a wide variety of application fields. Unfortunately, there is still no exact \textit{MLCS} algorithm/tool that can handle long (length $\ge$ 1,000) or big (length $\ge$ 10,000) sequences, which seriously hinders the development and utilization of massive long or big sequences from various application fields today.