OVT-MLCS: An Online Visual Tool for MLCS Mining from Long or Big Sequences
arXiv AIArchived Apr 17, 2026✓ Full text saved
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 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
Full text archived locally
✦ AI Summary· Claude Sonnet
Computer Science > Databases
[Submitted on 9 Jan 2026]
OVT-MLCS: An Online Visual Tool for MLCS Mining from Long or Big Sequences
Zhi Wang, Yanni Li, Tihua Duan, Bing Liu, Liyong Zhang, Hui Li
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 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. To address the challenge, we first propose a novel key point-based \textit{MLCS} algorithm for mining big sequences, called \textit{KP-MLCS}, and then present a new method, which can compactly represent all mined \textit{MLCSs} and quickly reveal common patterns among them. Furthermore, by introducing some new techniques, e.g., real-time graphic visualization and serialization, we have developed a new online visual \textit{MLCS} mining tool, called OVT-MLCS. OVT-MLCS demonstrates that it not only enables effective online mining, storing, and downloading of \textit{MLCSs} in the form of graphs and text from long or big sequences with a scale of 3 to 5000 but also provides user-friendly interactive functions to facilitate inspection and analysis of the mined \textit{MLCS}s. We believe that the functions provided by OVT-MLCS will promote stronger and wider applications of \textit{MLCS}.
Subjects: Databases (cs.DB); Artificial Intelligence (cs.AI)
Cite as: arXiv:2604.13037 [cs.DB]
(or arXiv:2604.13037v1 [cs.DB] for this version)
https://doi.org/10.48550/arXiv.2604.13037
Focus to learn more
Submission history
From: Zhi Wang [view email]
[v1] Fri, 9 Jan 2026 02:14:29 UTC (6,515 KB)
Access Paper:
HTML (experimental)
view license
Current browse context:
cs.DB
< prev | next >
new | recent | 2026-04
Change to browse by:
cs
cs.AI
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)