Solving necklace constraint problems
Journal of Algorithms
Solving Necklace Constraint Problems
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Boltzmann samplers for v-balanced cycles
Theoretical Computer Science
Hi-index | 0.00 |
Based on a unified approach via the classical Burnside Lemma in combinatorics, we deal with some problems arising from symbolic dynamics and biology. The MSS sequences play an important role in symbolic dynamics, and they are in one-to-one correspondence with necklaces of beads with two colors. This necklace problem was studied by Fine, Gilbert, and Riordan in the 1950s and 1960s. Recently, a problem on the classification of the DNA sequence arose in biology and was studied by Bell, Torney, and others. In this paper, we present a further treatment of the necklace problem which shows a closer connection with MSS sequences and brings more combinatorial insight into the properties of symbolic dynamics. We also give a clear derivation of the formula for the classification of DNA sequences. The techniques used in this paper originate principally from properties of cycle structures, which are related to the fixed points of then-cube recently studied by Chen and Stanley.