A hybrid genetic algorithm for the repetition free longest common subsequence problem

DOI10.1016/j.orl.2013.09.002zbMath1287.90052OpenAlexW2077783248WikidataQ62044790 ScholiaQ62044790MaRDI QIDQ2450749

Stefano Beretta, Mauro Castelli, Leonardo Vanneschi

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.09.002

zbMATH Keywords

heuristicsgenetic algorithmsestimation of distribution algorithmsrepetition free longest common subsequence

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Repetition-free longest common subsequence of random sequences ⋮ Solving longest common subsequence problems via a transformation to the maximum clique problem ⋮ On the role of metaheuristic optimization in bioinformatics ⋮ Exact algorithms for the repetition-bounded longest common subsequence problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variants of constrained longest common subsequence
• On the parameterized complexity of the repetition free longest common subsequence problem
• The constrained longest common subsequence problem
• A simple algorithm for the constrained sequence problems
• The Complexity of Some Problems on Subsequences and Supersequences
• Longest common subsequences
• A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
• Repetition-free longest common subsequence
• A survey of optimization by building and using probabilistic models

This page was built for publication: A hybrid genetic algorithm for the repetition free longest common subsequence problem