"
Team:CSIA SouthKorea/results
From 2012hs.igem.org
(Difference between revisions)
Eugeniestar (Talk | contribs) (→Results & Conclusion) |
Eugeniestar (Talk | contribs) (→Simulation Results) |
||
| Line 1: | Line 1: | ||
==Simulation Results== | ==Simulation Results== | ||
| + | |||
| + | : Before doing the wet lab, our team did [[Team:CSIA_SouthKorea/simulation | simulation]]. However, the results of our simulation turned out to be somewhat unexpected. Therefore, we tried to find the problem in our simulation code. | ||
| + | |||
| + | : public static boolean finish (Double[] in, int[] areas, Double err, int count){ | ||
| + | Double [] imp = new Double[count]; | ||
| + | for (int i=0; i<count; i++){ | ||
| + | |||
| + | imp[i] = in[areas[i]]; | ||
| + | |||
| + | } | ||
| + | if (equal(imp,err,count)) | ||
| + | return false; | ||
| + | return true; | ||
| + | } | ||
| + | |||
| + | : This part of the code indicates to print the time when the values of the function of selected cells are equal to each other. However, what we wanted to do was printing the time when the values of the function of selected cells are all similar to 1, inside the acceptable error bound. Some parts of the code that misleads the result of the simulation, like the part indicated above, should be debugged for improvement, which we are planning to complete soon. | ||
| + | |||
| + | : Furthermore, in order to simplify the problem, we simplified the oscillation of GFP expression into a sine function; however, actually, the oscillation does not follow such simple function, but rather follows a more complex differential equation function. To represent the problem more accurately, we will try to fix those parts as well soon. | ||
==Experiment Results== | ==Experiment Results== | ||
Revision as of 02:38, 17 June 2012
Simulation Results
- Before doing the wet lab, our team did simulation. However, the results of our simulation turned out to be somewhat unexpected. Therefore, we tried to find the problem in our simulation code.
- public static boolean finish (Double[] in, int[] areas, Double err, int count){
Double [] imp = new Double[count]; for (int i=0; i<count; i++){
imp[i] = in[areas[i]];
} if (equal(imp,err,count)) return false; return true; }
- This part of the code indicates to print the time when the values of the function of selected cells are equal to each other. However, what we wanted to do was printing the time when the values of the function of selected cells are all similar to 1, inside the acceptable error bound. Some parts of the code that misleads the result of the simulation, like the part indicated above, should be debugged for improvement, which we are planning to complete soon.
- Furthermore, in order to simplify the problem, we simplified the oscillation of GFP expression into a sine function; however, actually, the oscillation does not follow such simple function, but rather follows a more complex differential equation function. To represent the problem more accurately, we will try to fix those parts as well soon.
