Reactive stochastic local search algorithms for the genomic median problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4972 LNCS, Issue , 2008, Pages 266-276

  Lenne, Renaud ^a,b   Solnon, Christine ^a   Stützle, Thomas ^b   Tannier, Eric ^c   Birattari, Mauro ^b  

^a UNIVERSITÉ LYON 1   (France)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c LABORATOIRE DE BIOMÉTRIE ET BIOLOGIE EVOLUTIVE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; LEARNING ALGORITHMS; NUCLEAR PROPULSION; OPTIMIZATION; SOLUTIONS; STOCHASTIC PROGRAMMING; TELECOMMUNICATION NETWORKS;

ALGORITHM PERFORMANCE; ALGORITHMIC TECHNIQUES; BEST SOLUTION; COMPUTATIONAL RESULTS; DISTANCE MEASURES; EUROPEAN; EVOLUTIONARY COMPUTATION (EC); HEIDELBERG (CO); ITERATED LOCAL SEARCH (ILS); LOCAL SEARCH (LS) ALGORITHM; MEDIAN PROBLEM; NP HARD PROBLEMS; OPTIMIZ ATION PROBLEMS; PARAMETER SETTINGS; PERTURBATION STRENGTH; PROPOSITIONAL LOGICS; REAL WORLD; SATISFIABILITY (SAT) PROBLEMS; STOCHASTIC LOCAL SEARCH (SLS); STOCHASTIC LOCAL SEARCH ALGORITHMS; TABU LIST;

TABU SEARCH;

EID: 47249129518     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78604-7_23     Document Type: Conference Paper

References (20)

1. Moret, B., Tang, J., Warnow, T.: Reconstructing phylogenies from gene content and gene-order data. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny, pp. 321-352. Oxford Univ. Press, Oxford
2. Bernt, M., Merkle, D., Middendorf, M.: Using median sets for inferring phylogenetic trees. Bioinformatics 23, e129-e135 (2007)
3. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46(1), 1-27 (1999)
4. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. bioinformatics 21(16), 3340-3346 (2005)
5. Caprara, A.: The reversal median problem. INFORMS Journal on Computing 15, 93-113 (2003)
6. Moret, B., Siepel, A., Tang, J., Liu, T.: Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data (2002)
7. Arndt, W., Tang, J.: Improving inversion median computation using commuting reversals and cycle information. In: Tesler, G., Durand, D. (eds.) RECMOB-CG 2007. LNCS (LNBI), vol. 4751, pp. 30-44. Springer, Heidelberg (2007)
8. Bourque, G., Pevzner, P.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res. 12(1), 26-36 (2002)
9. Interian, Y., Durrett, R.: Genomic midpoints: Computation and evolutionary implications (Submitted, 2007)
10. Glover, F., Laguna, F.: Tabu Search. Kluwer Academic Publishers, Norwell, MA, USA (1997)
11. Stutzle, T.: Iterated local search for the quadratic assignment problem (1999)
12. Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163-173. Springer, Heidelberg (2006)
13. Alekseyev, M.A., Pevzner, P.A.: Multi-break rearrangements and chromosomal evolution. Theoretical Computer Science (to appear, 2007)
14. Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the 12th National Conference on Artificial Intelligence, pp. 337-343. AAAI Press / The MIT Press, Menlo Park, CA, USA (1994)
15. van Hemert, J., Bäck, T.: Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández- Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 23-32. Springer, Heidelberg (2002)
16. Birattari, M.: race: Racing methods for the selection of the best. R package version 0.1.56 (2005)
17. Birattari, M.: The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective. PhD thesis, Université Libre de Bruxelles, Brussels, Belgium (2004)
18. Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610-637 (2001)
19. Eriksen, N.: Reversal and transposition medians. Theoretical Computer Science 374(1-3) (2007)
20. Lenne, R., Solnon, C., Sttzle, T., Tannier, E., Birattari, M.: Effective Stochastic Local Search Algorithms for the Genomic Median Problem. In: Doctoral Symposium on Engineering Stochastic Local Search Algorithms (SLS-DS). IRIDIA Technical Report Series, pp. 1-5 (2007)