Conjugate word blending: formal model and experimental implementation by XPCR
From MaRDI portal
Publication:6095510
DOI10.1007/s11047-021-09867-xzbMath1530.68077OpenAlexW3196448279MaRDI QIDQ6095510
Silvia Lampis, Lila Kari, Unnamed Author, Francesco Bellamoli, Timothy Ng, Giuditta Franco
Publication date: 8 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-021-09867-x
DNA computingmolecular computinggene assemblyformal language operationsword operationsconjugate word blendingcross-pairing polymerase chain reaction (XPCR)word blending
Formal languages and automata (68Q45) Biochemistry, molecular biology (92C40) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further remarks on DNA overlap assembly
- Algorithmic applications of XPCR
- Recognizing splicing languages: syntactic monoids and simultaneous pumping
- Self-assembly of strings and languages
- Minimality in template-guided recombination
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Splicing in abstract families of languages
- State complexity of overlap assembly
- Theoretical and experimental DNA computation.
- The structure of reflexive regular splicing languages via Schützenberger constants
- On the splicing operation
- On the overlap assembly of strings and languages
- The chop of languages
- Computing by polymerase chain reaction
- State Complexity of Chop Operations on Unary and Finite Languages
- Generalized periodicity and primitivity for words
- DNA Recombination by XPCR
- Word Blending in Formal Languages*
- Chop Operations and Expressions: Descriptional Complexity Considerations
- Theoretical Computer Science
- DNA Computing