A biological algorithm to solve the assignment problem based on DNA molecules computation (Q278315): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: DNA ternary addition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the minimum bisection problem using a biologically inspired computational model / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving traveling salesman problem in the Adleman-Lipton model / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial-time DNA computing solution for the bin-packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4136915 / rank | |||
Normal rank | |||
Latest revision as of 22:26, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A biological algorithm to solve the assignment problem based on DNA molecules computation |
scientific article |
Statements
A biological algorithm to solve the assignment problem based on DNA molecules computation (English)
0 references
2 May 2016
0 references
DNA computation
0 references
the assignment problem
0 references
Adleman-Lipton model
0 references
NP-complete problem
0 references
0 references
