The following pages link to (Q4223673):
Displaying 50 items.
- Graph-theoretic formalization of hybridization in DNA sticker complexes (Q256713) (← links)
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- A DNA algorithm for the maximal matching problem (Q268662) (← links)
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems (Q285429) (← links)
- Enumeration approach to computing chemical equilibria (Q391182) (← links)
- Splicing systems and the Chomsky hierarchy (Q428896) (← links)
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- A DNA sticker algorithm for bit-substitution in a block cipher (Q436877) (← links)
- Bio-inspired optimization of sustainable energy systems: a review (Q460491) (← links)
- On aggregation in multiset-based self-assembly of graphs (Q537813) (← links)
- Morphic characterizations of languages in Chomsky hierarchy with insertion and locality (Q553307) (← links)
- Algorithmic applications of XPCR (Q553918) (← links)
- Computational power of insertion-deletion (P) systems with rules of size two (Q553921) (← links)
- Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing (Q553930) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- The emerging discipline of biomolecular computation in the US (Q698876) (← links)
- Models of molecular computing based on molecular reactions (Q698877) (← links)
- Communication P systems on simplicial complexes with applications in cluster analysis (Q714250) (← links)
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
- Matrix insertion-deletion systems (Q714867) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- DNA splicing: Computing by observing (Q835999) (← links)
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages (Q847663) (← links)
- DNA ternary addition (Q858742) (← links)
- A DNA procedure for solving the shortest path problem (Q864742) (← links)
- Languages generated by iterated idempotency (Q868949) (← links)
- Quorum sensing P systems (Q870251) (← links)
- Recognizing splicing languages: syntactic monoids and simultaneous pumping (Q881578) (← links)
- On periodic properties of circular words (Q897316) (← links)
- On the weight of universal insertion grammars (Q924156) (← links)
- Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity (Q926525) (← links)
- On length-separating test tube systems (Q934977) (← links)
- Equivalence in template-guided recombination (Q941686) (← links)
- Accepting splicing systems (Q974105) (← links)
- Computational expressiveness of genetic systems (Q1004070) (← links)
- Pictures worth a thousand tiles, a geometrical programming language for self-assembly (Q1013126) (← links)
- Parallel DNA arithmetic operation based on \(n\)-moduli set (Q1026280) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Sticker systems (Q1275468) (← links)
- Watson-Crick D0L systems: The power of one transition (Q1399987) (← links)
- Coding properties of DNA languages. (Q1401178) (← links)
- Gemmating P systems: Collapsing hierarchies. (Q1401271) (← links)
- Direct constructions of universal extended H systems. (Q1401272) (← links)
- Decidability results for Watson-Crick D0L systems with nonregular triggers. (Q1401343) (← links)
- Watson-Crick D0L systems: Generative power and undecidable problems. (Q1426440) (← links)
- A metric space to study differences between polynucleotides (Q1433211) (← links)
- Aqueous computing: A survey with an invitation to participate. (Q1433943) (← links)
- On strongly context-free languages (Q1570831) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
