2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) 2010
DOI: 10.1109/bicta.2010.5645331
|View full text |Cite
|
Sign up to set email alerts
|

DNA based algorithms for solving both MAX-SAT and MAX-W-SAT problems

Abstract: In this paper, we propose three DNA algorithms for the weighted maximum satisfiability problem (MAX-W-SAT for short). The first one is an extension of Lipton's algorithm for SAT. The space solution is represented by a graph and the weights are encoded in form of pieces which are appended to the double strands representing the solutions. The second algorithm proposes a different encoding of information (clauses and weights) aiming at reducing the quantity of DNA required, and the last one proposes to represent … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 14 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?