70 likes | 164 Views
Tragedy of Theorem Proving. 2002. 07. 12. In Linear Implementation. Non-empty clause can be amplified!. GACT TGCA ACGT. GAGT CAAT CTGA. ¬ Q. ¬ P. R. ¬ S. ¬ T. Q. ACGT. TGAC. P. ¬ R. GACT TGCA ACGT. ¬ P. R. GAGT CAAT CTGA. ¬ S. ¬ T. Q. ACGT. TGAC. P. ¬ R. GACT TGCA ACGT.
E N D
Tragedy of Theorem Proving 2002. 07. 12
In Linear Implementation • Non-empty clause can be amplified!
GACT TGCA ACGT GAGT CAAT CTGA ¬Q ¬P R ¬S ¬T Q ACGT TGAC P ¬R GACT TGCA ACGT ¬P R GAGT CAAT CTGA ¬S ¬T Q ACGT TGAC P ¬R GACT TGCA ACGT GAGT CAAT CTGA ACGT TGAC ¬S ¬T Q P ¬R Example Can be amplified with primer S and R
In Hairpin Implementation • If goal literal is used more than once
Example ¬Q Q ¬P ¬S S R ¬R R R R ¬R ¬P Q S ¬S ¬P ¬Q ¬S S ¬R ¬R R R
Possible Solution • Both implementation have the same problem • Remove partial double strands • Use beads for each literal…(-_-) • 2v bead separations (v: number of variables) • 수율 문제 • Protein that binds to only single strand • Exists?