We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of ...
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...
A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1, . . . , k − 1} under cyclic rotation. In this paper we define an ordering on t...
We examine the qualitative dynamics of a catalytic self-organizing reaction system of binary strings that is inspired by the chemical information processing metaphor. A string is ...
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...