Pages that link to "Item:Q1130166"
From MaRDI portal
The following pages link to DNA computing, sticker systems, and universality (Q1130166):
Displayed 12 items.
- Computing with viruses (Q264553) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- The emerging discipline of biomolecular computation in the US (Q698876) (← links)
- Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity (Q926525) (← links)
- Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127) (← links)
- Making all spanning tree problem based on sticker model (Q1997053) (← links)
- String assembling systems: comparison to sticker systems and decidability (Q2152089) (← links)
- Theory of tailor automata (Q2315015) (← links)
- A CONSTANT TIME ALGORITHM FOR DNA ADD (Q3636161) (← links)
- Some Remarks on Superposition Based on Watson-Crick-Like Complementarity (Q3637240) (← links)
- Watson–Crick Jumping Finite Automata (Q5859652) (← links)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm (Q6095483) (← links)