Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient DNA sticker algorithms for NP-complete graph problems |
scientific article; zbMATH DE number 1766496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient DNA sticker algorithms for NP-complete graph problems |
scientific article; zbMATH DE number 1766496 |
Statements
Efficient DNA sticker algorithms for NP-complete graph problems (English)
0 references
11 July 2002
0 references
Hamiltonian directed path problem
0 references
DNA algorithm
0 references
biomolecular computing
0 references
0 references
