An iterative beam search with LCS heuristics solves the multiple VGLCS problem more robustly than baseline on 320 synthetic instances up to 10 sequences and 500 characters.
International Conference on Combinatorial Optimization and Applications , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Solving the Multiple Variable Gapped Longest Common Subsequence Problem
An iterative beam search with LCS heuristics solves the multiple VGLCS problem more robustly than baseline on 320 synthetic instances up to 10 sequences and 500 characters.