Lean Induced Cycles or Robust Cyclic Attractors

[1]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

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

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

[4]  I. Nengah Suparta,et al.  Counting sequences, Gray codes and lexicodes , 2006 .

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

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

[7]  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.

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

[9]  David Harel,et al.  Computational insights into Caenorhabditis elegans vulval development. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[10]  John P. Robinson,et al.  Counting sequences , 1981, IEEE Transactions on Computers.