Sciweavers

140 search results - page 3 / 28
» String Quartets In Binary
Sort
View
ARSCOM
2005
92views more  ARSCOM 2005»
13 years 5 months ago
Binary Strings Without Odd Runs of Zeros
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 ...
Ralph Grimaldi, Silvia Heubach
AB
2007
Springer
13 years 9 months ago
Prefix Reversals on Binary and Ternary Strings
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...
COMBINATORICS
2007
70views more  COMBINATORICS 2007»
13 years 5 months ago
Gray-ordered Binary Necklaces
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...
Christopher Degni, Arthur A. Drisko
ALIFE
1998
13 years 5 months ago
Self-Evolution in a Constructive Binary String System
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 ...
Peter Dittrich, Wolfgang Banzhaf
CPM
2009
Springer
207views Combinatorics» more  CPM 2009»
13 years 9 months ago
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
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...
Simone Faro, Thierry Lecroq