The following pages link to (Q4263670):
Displaying 11 items.
- Molecular computers for molecular robots as hybrid systems (Q288808) (← links)
- On iterated hairpin completion (Q551189) (← links)
- The emerging discipline of biomolecular computation in the US (Q698876) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Experimental validation and optimization of signal dependent operation in whiplash PCR (Q968393) (← links)
- Isothermal reactivating whiplash PCR for locally programmable molecular computation (Q968404) (← links)
- Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. (Q1853479) (← links)
- Iterated Hairpin Completions of Non-crossing Words (Q2891380) (← links)
- (Q5061526) (← links)
- Probabilistic Reasoning with an Enzyme-Driven DNA Device (Q5168507) (← links)
- Programmable single-stranded architectures for computing (Q6535757) (← links)