Huafeng Quan

A hybrid beam search framework with deep representation learning for the multiple longest common subsequence problem

The Multiple Longest Common Subsequence (MLCS) problem is a classical computational challenge in biological sequence analysis and comparative genomics. Existing approximate methods often lack effective mechanisms for incorporating contextual information from local sequence fragme...