scientific article; zbMATH DE number 2087007

MaRDI QIDQ4737635zbMATH OpenFDO

Authors Salah Hussini, Lila Kari, Stavros Konstantinidis

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2340/23400057.htm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Recommendations

• Coding properties of DNA languages.
• On properties of bond-free DNA languages
• Sticky-free and overhang-free DNA languages
• DNA Computing
• DNA Computing

Cited in

(18)

• Coding properties of DNA languages.
• Language-theoretic aspects of DNA complementarity
• On properties of bond-free DNA languages
• Sticky-free and overhang-free DNA languages
• On decidability and closure properties of language classes with respect to bio-operations
• Bond-free DNA language classes
• Generating DNA code words using forbidding and enforcing systems
• Further remarks on DNA overlap assembly
• Disjunctivity and other properties of sets of pseudo-bordered words
• Language Forbidding-Enforcing Systems Defining DNA Codewords
• k-involution codes and related sets
• DNA Computing
• Algorithmic applications of XPCR
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• DNA Computing
• State complexity of overlap assembly
• Aspects of Molecular Computing
• Testing DNA code words properties of regular languages

This page was built for publication:

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