Conference Paper

An efficient SAT encoding of circuit codes

Comput. Syst. Inst., ETH Zurich, Zurich
DOI: 10.1109/ISITA.2008.4895595 Conference: Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Source: IEEE Xplore


Circuit codes in hypercubes are generalized snake-in-the-box codes and are used in analog-to-digital conversion devices. The construction of the longest known circuit codes is based on either an exhaustive search or an algorithm that restricts the search to the codes with periodic coordinate sequences. In this paper, we describe an efficient SAT encoding of circuit codes, which enabled us to obtain new circuit codes.

Full-text preview

Available from:
  • Source
    • "by eliminating half of its clauses, using an argument presented in [32]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Glass models are frequently used to model gene regulatory networks. A distinct feature of the Glass model is that its dynamics can be formalized as paths through multi-dimensional binary hypercubes. In this paper, we report a broad range of results about Glass models that have been obtained by computing the binary codes that correspond to the hypercube paths. Specifically, we propose algorithmic methods for the synthesis of specific Glass networks based on these codes. In contrast to existing work, bi-periodic networks and networks possessing both stable equilibria and periodic trajectories are considered. The robustness of the attractor is also addressed, which gives rise to hypercube paths with nondominated nodes and double coils. These paths correspond to novel combinatorial problems, for which initial experimental results are presented. Finally, a classification of Glass networks with respect to their corresponding gene interaction graphs for three genes is presented.
    Full-text · Article · Mar 2010 · IEEE Transactions on Information Theory
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 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 per- form a complete search. In this paper, we propose an approach to find- ing 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 num- ber 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.
    Full-text · Conference Paper · Jan 2009
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Two new constructions are presented for coils and snakes in the hypercube. Improvements are made on the best known results for snake-in-the-box coils of dimensions 9, 10 and 11, and for some other circuit codes of dimensions between 8 and 13. In the first construction, circuit codes are generated from permuted copies of an initial transition sequence; the multiple copies constrain the search, so that long codes can be found relatively efficiently. In the second construction, two lower-dimensional paths are joined together with only one or two changes in the highest dimension; this requires a search for a permutation of the second sequence to fit around the first. It is possible to investigate sequences of vertices of the hypercube, including circuit codes, by connecting the corresponding vertices in an extended graph related to the hypercube. As an example of this, invertible circuit codes are briefly discussed.
    Preview · Article · Jan 2012
Show more