Finding Lean Induced Cycles in Binary Hypercubes

Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are, however, unable to perform a complete search. In this paper, we propose an approach to finding a special class of induced cycles we call lean , based on an efficient propositional SAT encoding. Lean induced cycles dominate a minimum number of hypercube nodes. Such cycles have been identified in Systems Biology as candidates for stable trajectories of gene regulatory networks. The encoding enabled us to compute lean induced cycles for hypercubes up to dimension 7. We also classify the induced cycles by the number of nodes they fail to dominate, using a custom-built All-SAT solver. We demonstrate how clause filtering can reduce the number of blocking clauses by two orders of magnitude.

[1]  Daniel Kroening,et al.  An Algebraic Algorithm for the Identification of Glass Networks with Periodic Orbits Along Cyclic Attractors , 2007, AB.

[2]  Richard C. Singleton,et al.  Generalized Snake-in-the-Box Codes , 1966, IEEE Trans. Electron. Comput..

[3]  Quentin F. Stout,et al.  PERFECT DOMINATING SETS , 1990 .

[4]  Amir Pnueli,et al.  Formal Modeling of C. elegans Development: A Scenario-Based Approach , 2003, CMSB.

[5]  Daniel Kroening,et al.  Towards a Classification of Hamiltonian Cycles in the 6-Cube , 2008, Journal on Satisfiability, Boolean Modeling and Computation.

[6]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[7]  Victor W. Marek,et al.  Satisfiability and Computing van der Waerden Numbers , 2003, Electron. J. Comb..

[8]  Leon Glass,et al.  COMBINATORIAL ASPECTS OF DYNAMICS IN BIOLOGICAL SYSTEMS , 1977 .

[9]  Carla Savage,et al.  A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[10]  Xian Liu,et al.  A heuristic approach for constructing symmetric Gray codes , 2004, Appl. Math. Comput..

[11]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[12]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume IV: Fascicle 2: Generating All Tuples and Permutations , 2005 .

[13]  Lars Schewe.  Generation of Oriented Matroids Using Satisfiability Solvers , 2006, ICMS.

[14]  Aletta Nylén,et al.  SAT-Solving the Coverability Problem for Petri Nets , 2004, Formal Methods Syst. Des..

[15]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[16]  Joao Marques-Silva,et al.  Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings , 2007, SAT.

[17]  M. Page,et al.  Search for Steady States of Piecewise-Linear Differential Equation Models of Genetic Regulatory Networks , 2008, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[18]  D. Kroening,et al.  An efficient SAT encoding of circuit codes , 2008, 2008 International Symposium on Information Theory and Its Applications.

[19]  Pedro A. Diaz-Gomez,et al.  Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions , 2006, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06).

[20]  Adnan Darwiche,et al.  A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.

[21]  Andrés Iglesias,et al.  Mathematical Software - ICMS 2006, Second International Congress on Mathematical Software, Castro Urdiales, Spain, September 1-3, 2006, Proceedings , 2006, ICMS.

[22]  Michal Kouril,et al.  Resolution Tunnels for Improved SAT Solver Performance , 2005, SAT.

[23]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[24]  L. Glass,et al.  Symbolic dynamics and computation in model gene networks. , 2001, Chaos.

[25]  Daniel Kroening,et al.  Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers , 2008, IEEE Transactions on Information Theory.