DNA Coding Using the Subword Closure Operation

DOI10.1007/978-3-540-77962-9_30zbMath1137.68382OpenAlexW1711504524MaRDI QIDQ5452702

Bo Cui, Stavros Konstantinidis

Publication date: 4 April 2008

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77962-9_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language ⋮ Computing maximal Kleene closures that are embeddable in a given subword-closed language

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• DNA computing. 8th internatinal workshop on DNA-based computers, DNA8, Sapporo, Japan, June 10--13, 2002. Revised papers
• DNA computing. 7th international workshop on DNA-based computers, DNA7, Tampa, FL, USA, June 10--13, 2001. Revised papers
• DNA computing. 9th international workshop on DNA based computers, DNA9, Madison, WI, USA, June 1--3, 2003. Revised papers.
• DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7--10, 2004. Revised selected papers
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• DNA Computing
• DNA Computing