Pages that link to "Item:Q1276167"
From MaRDI portal
The following pages link to DNA models and algorithms for NP-complete problems (Q1276167):
Displaying 20 items.
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- Spatial cluster analysis by the Adleman-Lipton DNA computing model and flexible grids (Q444308) (← links)
- On the power of DNA-computing (Q675064) (← links)
- New algorithms for some NP-optimization problems by DNA computing (Q815653) (← links)
- Solving the minimum bisection problem using a biologically inspired computational model (Q847667) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- Is DNA computing viable for 3-SAT problems? (Q1401219) (← links)
- Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127) (← links)
- Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. (Q1853479) (← links)
- DNA and quantum based algorithms for VLSI circuits testing (Q2575322) (← links)
- Solving the maximal matching problem with DNA molecules in Adleman-Lipton model (Q2788698) (← links)
- A ``DNA origami''-based approach to the solution of graph coloring problem (Q2984480) (← links)
- (Q3605737) (← links)
- (Q3641015) (← links)
- (Q4267819) (← links)
- (Q4437082) (← links)
- DNA2DNA computations: A potential “killer app”? (Q4571939) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
- A molecular beacon computing model of maximum matching problem (Q4980914) (← links)
- On the computational power of DNA (Q5961619) (← links)