Beam search for the longest common subsequence problem-Reference-Cited by-同舟云学术

Beam search for the longest common subsequence problem

Published:2009-12 Issue:12 Volume:36 Page:3178-3186
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Blum Christian,Blesa Maria J.,López-Ibáñez Manuel

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference32 articles.

1. Data structures and algorithms;Aho,1983

2. New approximation algorithms for longest common subsequences;Bergroth,1998

3. A survey of longest common subsequence algorithms;Bergroth,2000

4. Probabilistic beam search for the longest common subsequence problem;Blum,2007

5. Blum C, Blesa MJ, López-Ibáñez M. Beam search for the longest common subsequence problem. Technical Report LSI-08-29, Department LSI, Univeristat Politècnica de Catalunya, 2008.

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic-MLCS: Fast searching for dynamic multiple longest common subsequences in sequence stream data;Knowledge-Based Systems;2024-06

2. A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem;Lecture Notes in Computer Science;2024

3. Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem;Lecture Notes in Computer Science;2024

4. Lempel-Ziv-based Hyper-Heuristic Solution for Longest Common Subsequence Problem;2023 13th International Conference on Computer and Knowledge Engineering (ICCKE);2023-11-01

5. Longest common substring in Longest Common Subsequence’s solution service: A novel hyper-heuristic;Computational Biology and Chemistry;2023-08