Dipole codes attractively encode glue functions
From MaRDI portal
Abstract: Dipole words are sequences of magnetic dipoles, in which alike elements repel and opposite elements attract. Magnetic dipoles contrast with more general sets of bonding types, called glues, in which pairwise bonding strength is specified by a glue function. We prove that every glue function has a set of dipole words, called a dipole code, that attractively encodes : the pairwise attractions (positive or non-positive bond strength) between the words are identical to those of . Moreover, we give such word sets of asymptotically optimal length. Similar results are obtained for a commonly used subclass of glue functions.
Recommendations
Cites work
- Bounds for DNA codes with constant GC-content
- Coding and Cryptography
- Complexities for Generalized Models of Self-Assembly
- Complexity of graph self-assembly in accretive systems and self-destructible systems
- DNA Computing
- DNA Computing
- DNA codeword design: theory and applications
- Exact shapes and Turing universality at temperature 1 with a single negative glue
- Fuel Efficient Computation in Passive Self-Assembly
- Linear constructions for DNA codes
- Strand design for biomolecular computation.
This page was built for publication: Dipole codes attractively encode glue functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529021)