๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient generation of the binary reflected gray code and its applications

โœ Scribed by Bitner, James R.; Ehrlich, Gideon; Reingold, Edward M.


Book ID
118124593
Publisher
Association for Computing Machinery
Year
1976
Tongue
English
Weight
470 KB
Volume
19
Category
Article
ISSN
0001-0782

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Explicit definition of the binary reflec
โœ Marston Conder ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB

It is shown that for 1 <~j<~n and 1 ~<k ~<2", the jth letter of the kth word of the binary reflected Gray code of length n is equal to the parity of the binomial coefficient 2"-2" ~ iC[2, 2,-~-~-~/21 modulo 2. Also it is shown how this observation and the usual iterative definition of the binary ref

A binary coding method of RNA secondary
โœ Bo Liao; Weiyang Chen; Xingming Sun; Wen Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 362 KB ๐Ÿ‘ 1 views

## Abstract According to the three classifications of nucleotides, we introduce a sort of binary coding method of RNA secondary structures. On the basis of this representation, we can reduce a RNA secondary structure into three binary digit sequences. We also propose coding rules based on the exclu