关于解决多变量间隙最长公共子序列问题
On Solving the Multiple Variable Gapped Longest Common Subsequence Problem
AI总结:
本文提出基于根状态图的搜索框架,利用迭代束搜索策略解决VGLCS问题,通过引入LCS文献中的启发式方法,首次系统研究了包含320个合成实例的VGLCS问题。
摘要:
本文针对变量间隙最长公共子序列(VGLCS)问题,该问题是对经典最长公共子序列(LCS)问题的推广,涉及在连续解之间允许灵活的间隙约束。该问题出现在分子序列比较中,需要尊重残基间的结构距离约束,在时间序列分析中,事件必须在指定的时间延迟内发生。我们提出了一种基于根状态图的搜索框架,其中状态空间包含大量根状态子图。为应对由此产生的组合爆炸问题,采用迭代束搜索策略,动态维护一个包含有前途候选根节点的全局池,从而在迭代中有效控制多样性。为了利用搜索寻找高质量解,将几种已知的LCS文献中的启发式方法应用于独立的束搜索过程中。据我们所知,这是首次对VGLCS问题进行系统研究,包含320个合成实例,最多10个输入序列和最多500个字符。实验结果表明,所设计的方法在可比运行时间内具有鲁棒性。
英文摘要:
This paper addresses the Variable Gapped Longest Common Subsequence (VGLCS) problem, a generalization of the classical LCS problem involving flexible gap constraints between consecutive solutions' characters. The problem arises in molecular sequence comparison, where structural distance constraints between residues must be respected, and in time-series analysis where events are required to occur within specified temporal delays. We propose a search framework based on the root-based state graph representation, in which the state space comprises a generally large number of rooted state subgraphs. To cope with the resulting combinatorial explosion, an iterative beam search strategy is employed, dynamically maintaining a global pool of promising candidate root nodes, enabling effective control of diversification across iterations. To exploit the search for high-quality solutions, several known heuristics from the LCS literature are utilized into the standalone beam search procedure. To the best of our knowledge, this is the first comprehensive computational study on the VGLCS problem comprising 320 synthetic instances with up to 10 input sequences and up to 500 characters. Experimental results show robustness of the designed approach over the baseline beam search in comparable runtimes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。