arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.12031cs.AI
收藏

受限最长公共子序列问题的一种学习搜索算法

A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem

Faculty of Natural Sciences and Mathematics, University of Banja Luka(巴尼亚卢卡大学自然科学与数学系);Artificial Intelligence Research Institute(人工智能研究所);Jožef Stefan Institute(约瑟夫·斯特凡研究所);Faculty of Mathematics, University of Belgrade(贝尔格莱德大学数学系)

Marko Djukanović, Jaume Reixach, Ana Nikolikj, Tome Eftimov, Aleksandar Kartelj, Christian Blum

AI总结:

本文针对受限最长公共子序列(RLCS)问题,提出了基于概率模型和遗传算法离线训练神经网络的两种启发式方法,并结合beam search框架构建了learning beam search混合算法,在真实学术摘要数据集上验证了有效性并进行了经验可解释性分析。

摘要:

本文探讨了受限最长公共子序列(RLCS)问题,这是著名最长公共子序列(LCS)问题的一种扩展。该问题在生物信息学中具有重要应用,特别是在识别DNA、RNA和蛋白质序列间的相似性、发现共同模式及重要基序方面。基于近期通过通用搜索框架解决该问题的进展,本文提出了两种新颖的启发式方法,旨在通过引导搜索过程趋向搜索空间中的有前景区域来增强搜索。第一种启发式方法采用概率模型在搜索过程中评估部分解。第二种启发式方法基于使用遗传算法离线训练的神经网络模型。该方法的一个关键点是提取部分解及完整问题实例的问题特定特征。通过将训练好的神经网络模型与beam search框架相结合,开发出一种有效的混合方法,称为learning beam search。本文的重要贡献在于生成真实世界实例,其中科学摘要作为输入字符串,文献中频繁出现的学术词汇集作为受限模式。综合实验评估证明了所提方法在解决RLCS问题上的有效性。最后,对所得结果应用了经验可解释性分析。由此,识别出了关键特征组合及其在不同问题类型中对算法成败的各自贡献。

英文摘要:

This paper addresses the Restricted Longest Common Subsequence (RLCS) problem, an extension of the well-known Longest Common Subsequence (LCS) problem. This problem has significant applications in bioinformatics, particularly for identifying similarities and discovering mutual patterns and important motifs among DNA, RNA, and protein sequences. Building on recent advancements in solving this problem through a general search framework, this paper introduces two novel heuristic approaches designed to enhance the search process by steering it towards promising regions in the search space. The first heuristic employs a probabilistic model to evaluate partial solutions during the search process. The second heuristic is based on a neural network model trained offline using a genetic algorithm. A key aspect of this approach is extracting problem-specific features of partial solutions and the complete problem instance. An effective hybrid method, referred to as the learning beam search, is developed by combining the trained neural network model with a beam search framework. An important contribution of this paper is found in the generation of real-world instances where scientific abstracts serve as input strings, and a set of frequently occurring academic words from the literature are used as restricted patterns. Comprehensive experimental evaluations demonstrate the effectiveness of the proposed approaches in solving the RLCS problem. Finally, an empirical explainability analysis is applied to the obtained results. In this way, key feature combinations and their respective contributions to the success or failure of the algorithms across different problem types are identified.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑