Pages that link to "Item:Q2378959"
From MaRDI portal
The following pages link to A DNA-based graph encoding scheme with its applications to graph isomorphism problems (Q2378959):
Displaying 9 items.
- A computational DNA solution approach for the quadratic Diophantine equation (Q275220) (← links)
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits (Q545998) (← links)
- Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing (Q553930) (← links)
- The domination numbers of cylindrical grid graphs (Q627140) (← links)
- A polynomial-time DNA computing solution for the bin-packing problem (Q1039671) (← links)
- A new graphical coding of DNA sequence and its similarity calculation (Q1673222) (← links)
- Comparing large-scale graphs based on quantum probability theory (Q2279341) (← links)
- Edge-outer graph embedding and the complexity of the DNA reporter strand problem (Q2315018) (← links)
- A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers (Q2479238) (← links)