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

TL;DR
The paper introduces OVT-MLCS, an online visual tool for mining and analyzing multiple longest common subsequences from long or large sequences, overcoming previous limitations.
Contribution
It presents a novel key point-based MLCS algorithm, a compact pattern representation method, and an online visual tool with real-time visualization for large sequence analysis.
Findings
Effective online mining of MLCS from sequences up to length 5000
Visualization and analysis functions facilitate pattern inspection
Enables storage and download of MLCS in graphical and textual formats
Abstract
Mining multiple longest common subsequences (\textit{MLCS}) from a set of sequences of three or more over a finite alphabet (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 1,000) or big (length 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
