Solving the minimum bisection problem using a biologically inspired computational model

DOI10.1016/j.tcs.2009.07.031zbMath1191.68321OpenAlexW2067350694MaRDI QIDQ847667

Xingchang Liu, Yong Ding, Xiaofan Yang, Sheng-Lin Li

Publication date: 19 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.031

zbMATH Keywords

Adleman-Lipton-Sticker modelDNA algorithmminimum bisection problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

A biological algorithm to solve the assignment problem based on DNA molecules computation ⋮ Solving the maximum weighted clique problem based on parallel biological computing model ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm

Cites Work

• DNA models and algorithms for NP-complete problems
• Strand design for biomolecular computation.
• A Polylogarithmic Approximation of the Minimum Bisection
• DNA Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the minimum bisection problem using a biologically inspired computational model