Presentation is loading. Please wait.

Presentation is loading. Please wait.

Maximal Clique Problem with Experiment

Published byDražen Jovanović Modified over 5 years ago

Similar presentations

Presentation on theme: "Maximal Clique Problem with Experiment"— Presentation transcript:

1 Maximal Clique Problem with Experiment
Summarized by Tak Min Ho (C) 2004, SNU Biointelligence Lab, 

2 (C) 2004, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Maximal Clique (C) 2004, SNU Biointelligence Lab, 

3 (C) 2004, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Oligo Design (C) 2004, SNU Biointelligence Lab, 

4 (C) 2004, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Our Method Prepare the 0-2 (0x0,0x1,1x0, except 1X1) oligo sequences. Hybridize the oligo sequences by using POA method. Prepare the 1-3 (0x0,0x1,1x0,except 1x1) oligo sequences. Hybridize this oligo sequences by using POA method. Mixing the 0-2 sequences and the 1-3 sequences and then doing the POA method. After POA, the sample will be the 0-3(0xx0,0xx1,1xx0, except 1xx1)sequences. Like above method, we can make 0-5,1-5 sequences (C) 2004, SNU Biointelligence Lab, 

5 Experiment result 1(0x0,1x0,0x1)
It is the sample of the 0-2 (0x0,0x1,1x0)oligo sequences that are hybridized by POA method. Each sample was added by 2ul We expected 110bp,100bp at line 2, but the result is different with expectation. And line3~5 result is different with expecation. (C) 2004, SNU Biointelligence Lab, 

6 Experiment result 2 (0x0,1x0,0x1)
It is the result of the PCR from the POAed 0-2 sequences. Each sample was added by 1ul We expected 110bp,100bp at line 2, but the result was not represented 100bp (C) 2004, SNU Biointelligence Lab, 

7 (C) 2004, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Experiment result 3 (010,000,110,100,011,001) Before experiment(1,2) was hybridized by random method, for example 0x0,0x1,1x0. (‘x’ means ‘0 or 1’) So we was not using the random method for the good resolution.(Experiment 3) But the line 6,7 was different with the expectation. (C) 2004, SNU Biointelligence Lab, 

8 (C) 2004, SNU Biointelligence Lab, http://bi.snu.ac.kr/
Difficulty We couldn’t find the expected band If the nodes are added (bigger than 6 nodes) , the experiment will be very hard working. Because of the complex of the protocol So we have to find another good method for resolving this complex problem. (C) 2004, SNU Biointelligence Lab, 

Download ppt "Maximal Clique Problem with Experiment"

Similar presentations

Diagnosis with PCR This is a preparation of DNA. We zoomed in a portion of a gene. We know that two primers, Forward and Reverse, will hybridize at specific.

Diagnosis with PCR This is a preparation of DNA. We zoomed in a portion of a gene. We know that two primers, Forward and Reverse, will hybridize at specific.
Biointelligence Laboratory, Seoul National University

Biointelligence Laboratory, Seoul National University
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, 2006. Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.

Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
GeneChip Hybridization. The following hybridization mix is prepared for each sample Fragmented cRNA 5ug 10 ul Control B2 Oligo1.7 ul 20x Eukaryotic Control.

GeneChip Hybridization. The following hybridization mix is prepared for each sample Fragmented cRNA 5ug 10 ul Control B2 Oligo1.7 ul 20x Eukaryotic Control.
A mathematical model and a computerized simulation of PCR using complex templates Nucleic Acid Research, 1996, Vol. 24, No. 18, pp. 3538-3545 E. Rubin.

A mathematical model and a computerized simulation of PCR using complex templates Nucleic Acid Research, 1996, Vol. 24, No. 18, pp E. Rubin.
Instance Construction via Likelihood- Based Data Squashing Madigan D., Madigan D., et. al. (Ch 12, Instance selection and Construction for Data Mining.

Instance Construction via Likelihood- Based Data Squashing Madigan D., Madigan D., et. al. (Ch 12, Instance selection and Construction for Data Mining.
Copyright (c) 2002 by SNU CSE Biointelligence Lab 1 Chap. 4 Pairwise alignment using HMMs Biointelligence Laboratory School of Computer Sci. & Eng. Seoul.

Copyright (c) 2002 by SNU CSE Biointelligence Lab 1 Chap. 4 Pairwise alignment using HMMs Biointelligence Laboratory School of Computer Sci. & Eng. Seoul.
Artificial Intelligence Chapter 10 Planning, Acting, and Learning Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.

Artificial Intelligence Chapter 10 Planning, Acting, and Learning Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Artificial Intelligence Project #3 : Diagnosis Using Bayesian Networks May 19, 2005.

Artificial Intelligence Project #3 : Diagnosis Using Bayesian Networks May 19, 2005.
A Chinese Postman Problem Based on DNA Computing Z. Yin, F. Zhang, and J. Xu* J. Chem. Inf. Comput. Sci. 2002, 42, 222-224 Summarized by Shin, Soo-Yong.

A Chinese Postman Problem Based on DNA Computing Z. Yin, F. Zhang, and J. Xu* J. Chem. Inf. Comput. Sci. 2002, 42, Summarized by Shin, Soo-Yong.
200 300 400 500 100 200 300 400 500 100 200 300 400 500 100 200 300 400 500 100 200 300 400 500 100 Adding SubtractingMultiplyingDividingMiscellaneous.

Adding SubtractingMultiplyingDividingMiscellaneous.
Computational and experimental analysis of DNA shuffling : Supporting text N. Maheshri and D. V. Schaffer PNAS, vol. 100, no. 6, 3071-3076 Summarized by.

Computational and experimental analysis of DNA shuffling : Supporting text N. Maheshri and D. V. Schaffer PNAS, vol. 100, no. 6, Summarized by.
The Inference via DNA Computing Piort Wasiewicz et al. Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, pp. 988-993 Cho, Dong-Yeon.

The Inference via DNA Computing Piort Wasiewicz et al. Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, pp Cho, Dong-Yeon.
Detection of the human VNTR using PCR* *A Polymerase Chain Reaction Experiment.

Detection of the human VNTR using PCR* *A Polymerase Chain Reaction Experiment.
Progressive Sampling Instance Selection and Construction for Data Mining Ch 9. F. Provost, D. Jensen, and T. Oates 2001.5.16 신수용.

Progressive Sampling Instance Selection and Construction for Data Mining Ch 9. F. Provost, D. Jensen, and T. Oates 신수용.
Approaches to Selection and their Effect on Fitness Modelling in an Estimation of Distribution Algorithm A. E. I. Brownlee, J. A. McCall, Q. Zhang and.

Approaches to Selection and their Effect on Fitness Modelling in an Estimation of Distribution Algorithm A. E. I. Brownlee, J. A. McCall, Q. Zhang and.
Using Lateral Capillary Forces to Compute by Self-assembly Paul W. K. Rothemund PNAS, Feb. 1, 2000, vol. 97, no. 3, pp.984- 989 Summarized by Lee, In-Hee.

Using Lateral Capillary Forces to Compute by Self-assembly Paul W. K. Rothemund PNAS, Feb. 1, 2000, vol. 97, no. 3, pp Summarized by Lee, In-Hee.
(C) 2002, SNU Biointelligence Lab, Strategies for the development of a peptide computer Hubert Hug and Rainer Schuler Bioinformatics,

(C) 2002, SNU Biointelligence Lab, Strategies for the development of a peptide computer Hubert Hug and Rainer Schuler Bioinformatics,
(C) 2004, SNU Biointelligence Lab, DNA Extraction by Cross Pairing PCR Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, Vincenzo.

(C) 2004, SNU Biointelligence Lab, DNA Extraction by Cross Pairing PCR Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, Vincenzo.
Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability Primer Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability.

Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability Primer Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability.

Similar presentations

Ads by Google