Citation

Klemm K, Mehta A, Stadler PF. PLoS One 2012; 7(4): e34780.

Affiliation

Bioinformatics Group, Department of Computer Science, and Interdisciplinary Center for Bioinformatics, University of Leipzig, Leipzig, Germany.

Copyright

(Copyright © 2012, Public Library of Science)

DOI

10.1371/journal.pone.0034780

PMID

22496860

PMCID

PMC3322142

Abstract

Hard combinatorial optimization problems deal with the search for the minimum cost solutions (ground states) of discrete systems under strong constraints. A transformation of state variables may enhance computational tractability. It has been argued that these state encodings are to be chosen invertible to retain the original size of the state space. Here we show how redundant non-invertible encodings enhance optimization by enriching the density of low-energy states. In addition, smooth landscapes may be established on encoded state spaces to guide local search dynamics towards the ground state.

Language: en