Splicing schemes and DNA

MaRDI QIDQ4036781zbMATH OpenFDO

Authors Tom Head

Publication date 18 May 1993

zbMATH Keywords

automataDNAformal language theorygenetic algorithmsregular languagessplicing systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Recommendations

• scientific article; zbMATH DE number 1948488
• On the splicing operation
• Algorithms for Splicing Systems
• scientific article; zbMATH DE number 1241363
• New Computational Paradigms

Cited in

(23)

• A characterization of regular circular languages generated by marked splicing systems
• Splicing representations of stricly locally testable languages
• Computing by splicing
• Simple splicing systems
• Splicing in abstract families of languages
• On the universality of Post and splicing systems
• Separating some splicing models.
• On the splicing operation
• Regularity of splicing languages
• Hybrid and generalized marked systems
• On the power of circular splicing
• Recognizing DNA Splicing
• Algorithms for Splicing Systems
• Splicing systems and the Chomsky hierarchy
• scientific article; zbMATH DE number 1948488 (Why is no real title available?)
• The Signature of a Splice
• Matrix splicing system
• Logical string rewriting
• Biomolecular realizations of a parallel architecture for solving combinatorial problems
• On the regularity of circular splicing languages: a survey and new developments
• A characterization of (regular) circular languages generated by monotone complete splicing systems
• The emerging discipline of biomolecular computation in the US
• Unavoidable sets and circular splicing languages

This page was built for publication: Splicing schemes and DNA

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