Advances on Stochastic Local Search Algorithms for the Genomic Median Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Advances on Stochastic Local Search Algorithms for the Genomic Median Problem

Abstract

The genomic median problem aims at finding the organization of the chromosome of a common ancestor to multiple living species. The problem is often formulated as searching for a genome that minimizes some distance measure among given genomes. In our previous research, we have proposed a new stochastic local search algorithm for this problem that combined elements of tabu search, iterated local search, and a reactive search mechanism for adapting crucial parameters while solving an instance. In this talk, we will report on several improvements upon the initial algorithm and additional computational results including comparisons to current state-of-the-art algorithms for the genomic median problem.
No file

Dates and versions

hal-01542519 , version 1 (19-06-2017)

Identifiers

  • HAL Id : hal-01542519 , version 1

Cite

Renaud Lenne, Christine Solnon, Thomas Stützle, Eric Tannier. Advances on Stochastic Local Search Algorithms for the Genomic Median Problem. International Conference on Metaheuristics and Nature Inspired Computing (META), Oct 2008, Hammamet, Tunisie, Tunisia. pp.266-276. ⟨hal-01542519⟩
156 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More