Large neighbourhood search algorithms for the founder sequence reconstruction problem

DOI10.1016/j.cor.2011.03.012zbMath1251.90337OpenAlexW2079795452MaRDI QIDQ1761968

Stefano Benedettini, Andrea Roli, Christian Blum, Thomas Stützle

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.03.012

zbMATH Keywords

stochastic local searchlarge neighbourhood searchfounder sequence reconstruction

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20)

Related Items (2)

MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS ⋮ Explanation-based large neighborhood search

Uses Software

• JOBSHOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Hybrid metaheuristics. An emerging approach to optimization.
• An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations
• Tuning metaheuristics. A machine learning Perspective
• MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS
• Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• A Computational Study of the Job-Shop Scheduling Problem
• Principles and Practice of Constraint Programming – CP 2004
• Variable neighborhood search: Principles and applications

This page was built for publication: Large neighbourhood search algorithms for the founder sequence reconstruction problem