A DNA-based graph encoding scheme with its applications to graph isomorphism problems (Q2378959): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4529973 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using sticker to solve the 3-dimensional matching problem in molecular supercomputers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4223673 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4224876 / rank | |||
Normal rank | |||
Latest revision as of 22:58, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A DNA-based graph encoding scheme with its applications to graph isomorphism problems |
scientific article |
Statements
A DNA-based graph encoding scheme with its applications to graph isomorphism problems (English)
0 references
14 January 2009
0 references
DNA-based computing
0 references
DNA-based algorithms
0 references
molecular computing
0 references
the subgraph isomorphism problem
0 references
the maximum common subgraph problem
0 references
biological operations
0 references
NP-complete
0 references
