Solving the Set-Splitting Problem in Sticker-Based Model and the Lipton-Adelmann Model
نویسنده
چکیده
!"#$%&'$( KI;"'$()5%*&" &3" +-%8& #$#"% -( 53-:3 -& 5$8 I"'*(8&%$&"I &3$& !UK V!"#$%&'(#)*+,"'+ .+'/W)8&%$(I8 :*2;I X")$##;-"I +*% I"$;-(/ 5-&3 8*;2&-*(8 &* $( -(8&$(:" *+ &3" UYD:*'#;"&" Z$'-;&*(-$( #$&3 #%*X;"' VZYYW@) [-#&*()5%*&" &3" 8":*(I) #$#"% -( 53-:3 -& 5$8 83*5() &3$& &3" KI;"'$( &":3(-\2"8 :*2;I $;8* X" 28"I &* 8*;7-(/ &3") UYD:*'#;"&") 8$&-8+-$X-;-&9 V1K4W) #%*X;"' V&3") +-%8&) UYD :*'#;"&")#%*X;"'W@)KI;"'$()$(I)3-8 :*D$2&3*%8 #%*#*8"I 01'+2"&)+*%)"(3$(:-(/ &3" KI;"'$(D[-#&*() '*I";@ ,( &3" #$#"%0 -& -8 #%*7"I) 3*5 &*) $##;9 8&-:H"% -( &3" 8&-:H"%DX$8"I '*I";) +*%) :*(8&%2:&-(/) 8*;2&-*() 8#$:") *+ !UK +*% &3" 0"1D03,'11'45 3&#(,"6 $(I 3*5 &*)$##;9 !UK *#"%$&-*(8 -()&3" KI;"'$(D[-#&*()'*I"; &* 8*;7" &3$&)#%*X;"')+%*' 8*;2&-*()8#$:")*+)8&-:H"%@
منابع مشابه
Towards solution of the set-splitting problem on gel-based DNA computing
Adleman wrote the first paper that demonstrated that DNA (DeoxyriboNucleic Acid) strands could be applied for dealing with solutions of the NP-complete Hamiltonian path problem (HPP). Lipton wrote the second paper that showed that the Adleman techniques could also be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). Adleman and his co-authors proposed s...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملFast parallel bio-molecular solutions: the set-basis problem
In the paper, it is demonstrated how to apply sticker in the sticker-based model for constructing solution space of DNA for the setbasis problem and how to apply DNA operations in the Adleman-Lipton model to solve that problem from solution space of sticker. Furthermore, this work shows the ability of DNA-based computing for resolving the NP-complete problems.
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کامل