DNA sequence design using templates

DOI10.1007/BF03037360MaRDI QIDQ698884zbMATH OpenFDO

Authors Masanori Arita, Satoshi Kobayashi

Publication date 20 October 2003

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

Full work available at URL https://doi.org/10.1007/BF03037360

zbMATH Keywords

DNA computingDNA-based computationerror correcting code

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1953219
• scientific article; zbMATH DE number 2087013
• Strand design for biomolecular computation.
• scientific article; zbMATH DE number 1953222
• Codeword design and information encoding in DNA ensembles

Cites work

• An optimum nonlinear code
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Reversible codes
• Self-synchronizing codes derived from binary cyclic codes

Cited in

(18)

• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• A method for constructing artificial DNA libraries based on generalized de Bruijn sequences
• Linear constructions for DNA codes
• On properties of bond-free DNA languages
• A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing
• Computing maximal Kleene closures that are embeddable in a given subword-closed language
• Iterated hairpin completions of non-crossing words
• DNA codeword design: theory and applications
• Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences
• On the scalability of biocomputing algorithms: the case of the maximum clique problem
• scientific article; zbMATH DE number 1953219 (Why is no real title available?)
• scientific article; zbMATH DE number 2087013 (Why is no real title available?)
• Involutive Fibonacci words
• OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• On codeword design in metric DNA spaces
• Binary templates for comma-free DNA codes
• Construction of DNA codes by using algebraic number theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698884)