Molecular solution to the optimal linear arrangement problem based on DNA computation
From MaRDI portal
Recommendations
- A biological algorithm to solve the assignment problem based on DNA molecules computation
- On applying molecular computation to binary linear codes
- Biological computation of the solution to the quadratic assignment problem
- DNA models and algorithms for NP-complete problems
- Molecular solution to the 0-1 knapsack problem based on DNA computing
Cites work
- scientific article; zbMATH DE number 4043771 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1241360 (Why is no real title available?)
- scientific article; zbMATH DE number 1568800 (Why is no real title available?)
- scientific article; zbMATH DE number 871944 (Why is no real title available?)
- A genetic hillclimbing algorithm for the optimal linear arrangement problem
- DNA models and algorithms for NP-complete problems
- Efficient DNA sticker algorithms for NP-complete graph problems
- Linear constructions for DNA codes
- Linear placement algorithms and applications to VLSI design
- Mapping the genome
- On bipartite drawings and the linear arrangement problem
- Optimal Assignments of Numbers to Vertices
- Optimal Linear Ordering
- Strand design for biomolecular computation.
Cited in
(3)
This page was built for publication: Molecular solution to the optimal linear arrangement problem based on DNA computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q937692)