Beam-ACO for the repetition-free longest common subsequence problem

DOI10.1007/978-3-319-11683-9_7MaRDI QIDQ6487177zbMATH OpenWikidataFDO

Authors Christian Blum, Maria J. Blesa, Borja Calvo

Publication date 25 January 2016

Full work available at URL https://doi.org/10.1007/978-3-319-11683-9_7

Mathematics Subject Classification ID

Algorithms on strings (68W32) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Beam search for the longest common subsequence problem
• A branch-and-cut approach to the repetition-free longest common subsequence problem
• Probabilistic Beam Search for the Longest Common Subsequence Problem
• A hybrid genetic algorithm for the repetition free longest common subsequence problem
• Repetition-free longest common subsequence

Cites work

• A large neighborhood search heuristic for the longest common subsequence problem
• Algorithms on Strings, Trees and Sequences
• Finding the longest common subsequence for multiple biological sequences by ant colony optimization
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• Repetition-free longest common subsequence
• The Complexity of Some Problems on Subsequences and Supersequences
• Variants of constrained longest common subsequence

Cited in

(6)

• Exact algorithms for the repetition-bounded longest common subsequence problem
• A branch-and-cut approach to the repetition-free longest common subsequence problem
• Probabilistic Beam Search for the Longest Common Subsequence Problem
• On the role of metaheuristic optimization in bioinformatics
• Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem
• Beam search for the longest common subsequence problem

This page was built for publication: Beam-ACO for the repetition-free longest common subsequence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487177)