View PDF HTML (experimental)
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 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}.
arXiv-issued DOI via DataCite
**Submission history**
From: Zhi Wang [view email] [v1] Fri, 9 Jan 2026 02:14:29 UTC (6,515 KB)
tl;dr: OVT-MLCS is an online visual tool for mining multiple longest common subsequences (MLCS) from long or big sequences, which addresses the challenge of handling such sequences using a novel key point-based MLCS algorithm and techniques for compact representation, real-time visualization, and interactive analysis.
tl;dr: OVT-MLCS: An Online Visual Tool for MLCS Mining from Long or Big Sequences Independent subcontexts and blocks of concept lattices. Definitions and relat... Decomposition of contexts into independent subcontexts based on thresholds TableNet A Large-Scale Table Dataset with LLM-Powered Autonomous A Pythonic Functional Approach for Semantic Data Harmonisation in the ILIAD P... Green by Design? Investigating the Energy and Carbon Footprint of Chia Network Draft-Refine-Optimize: Self-Evolved Learning for Natural Language to MongoDB ... A Domain-Specific Language for LL
Rocks good for bash head. Fire keep warm. Hunt big animal, eat meat. Make tool, chop wood, build shelter. Life hard, but tribe survive.
arXiv cs — 2026-04-17
https://arxiv.org/abs/2604.13037
https://arxiv.org/abs/2604.13039
https://arxiv.org/abs/2604.13040
https://arxiv.org/abs/2604.13041
https://arxiv.org/abs/2604.13042
https://arxiv.org/abs/2604.13044
https://arxiv.org/abs/2604.13045
https://arxiv.org/abs/2604.13046
https://arxiv.org/abs/2604.13047
https://arxiv.org/abs/2604.13048
https://arxiv.org/abs/2604.13049 ...and 927 more