DNA sequence design using templates

DOI10.1007/BF03037360zbMath1021.68038MaRDI QIDQ698884

Masanori Arita, Satoshi Kobayashi

Publication date: 20 October 2003

Published in: New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

DNA computingerror correcting codeDNA-based computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)

Related Items (15)

Iterated Hairpin Completions of Non-crossing Words ⋮ DNA Codeword Design: Theory and Applications ⋮ A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing ⋮ Binary templates for comma-free DNA codes ⋮ Construction of DNA codes by using algebraic number theory ⋮ On the scalability of biocomputing algorithms: the case of the maximum clique problem ⋮ BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS ⋮ Unnamed Item ⋮ Linear constructions for DNA codes ⋮ On properties of bond-free DNA languages ⋮ On codeword design in metric DNA spaces ⋮ Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences ⋮ OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS ⋮ Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm ⋮ Computing maximal Kleene closures that are embeddable in a given subword-closed language

Cites Work

• Unnamed Item
• Reversible codes
• Self-synchronizing codes derived from binary cyclic codes
• An optimum nonlinear code

This page was built for publication: DNA sequence design using templates