100 likes | 107 Views
Solutions of Shortest Path Problems by Concentration Control. N. Matsuura et al. DNA7, 2001 Summarized by Shin, Soo-Yong. Concentration control. Solve shortest path problem by concentration control methods. The concentrations of DNA are used as input and output data.
E N D
Solutions of Shortest Path Problems by Concentration Control N. Matsuura et al. DNA7, 2001 Summarized by Shin, Soo-Yong
Concentration control • Solve shortest path problem by concentration control methods. • The concentrations of DNA are used as input and output data. • By local search rather than exhaustive search. • We can reduce the costs of some experimental operations. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Shortest path problems (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Algorithms • Encoding • Construction of random path • Same as Adleman method • Relative concentration • PCR • Determination by SSCP (Single Stranded Conformation Polymorphism). • Or DGGE, TGGE (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Simulation Experiments • Without and with concentration control Solution (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Lab experiments • Similar with Adleman experiments (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Results of Gel Analysis (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Results of Gel Analysis (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Quantification & Identification (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Quantification & Identification (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/