"
Team:Warsaw/Software
From 2011.igem.org
| (2 intermediate revisions not shown) | |||
| Line 24: | Line 24: | ||
<div class="note">How it works</div> | <div class="note">How it works</div> | ||
| - | <div> | + | <div align="justify"> |
The algorithm itself is described <a href="https://2011.igem.org/Team:Warsaw/ExpressionAdaptors/Solution">here</a>. Its implemented in <i>dataStructures.Generation class</i>. </div> | The algorithm itself is described <a href="https://2011.igem.org/Team:Warsaw/ExpressionAdaptors/Solution">here</a>. Its implemented in <i>dataStructures.Generation class</i>. </div> | ||
| - | <p> | + | <p align="justify"> |
The most important thing about implementation is fact that it's recursive. Calling copy constructor dataStructures.Generation(Generation prevGen) causes automaticaly random recombination of adaptors, their mutation and calculation of expression srtength for all proteins defined in proteins array of particular Generation class instance. This simplifies rest of the code because recursive calling of Generation copy constructor is all you need to do for basic implementation of this algorithm. This functionality is illustrated in <i>ExpressionAdaptorsGenerator.java</i>. | The most important thing about implementation is fact that it's recursive. Calling copy constructor dataStructures.Generation(Generation prevGen) causes automaticaly random recombination of adaptors, their mutation and calculation of expression srtength for all proteins defined in proteins array of particular Generation class instance. This simplifies rest of the code because recursive calling of Generation copy constructor is all you need to do for basic implementation of this algorithm. This functionality is illustrated in <i>ExpressionAdaptorsGenerator.java</i>. | ||
</p> | </p> | ||
| - | <p> | + | <p align="justify"> |
Additionally </i>ExpressionAdaptorsGenerator</i> saves each generation of adaptors to separate file generationXXX.sav in save directory. This provides resume point i case of abnormal termination of the program and also serves as a data source for the second program - <i>GenerationToFasta</i>. It serves as data anlysis tool that picks best hits from all generations and produces file in FASTA format. | Additionally </i>ExpressionAdaptorsGenerator</i> saves each generation of adaptors to separate file generationXXX.sav in save directory. This provides resume point i case of abnormal termination of the program and also serves as a data source for the second program - <i>GenerationToFasta</i>. It serves as data anlysis tool that picks best hits from all generations and produces file in FASTA format. | ||
</p> | </p> | ||
Latest revision as of 20:18, 21 September 2011
The most important thing about implementation is fact that it's recursive. Calling copy constructor dataStructures.Generation(Generation prevGen) causes automaticaly random recombination of adaptors, their mutation and calculation of expression srtength for all proteins defined in proteins array of particular Generation class instance. This simplifies rest of the code because recursive calling of Generation copy constructor is all you need to do for basic implementation of this algorithm. This functionality is illustrated in ExpressionAdaptorsGenerator.java.
Additionally ExpressionAdaptorsGenerator saves each generation of adaptors to separate file generationXXX.sav in save directory. This provides resume point i case of abnormal termination of the program and also serves as a data source for the second program - GenerationToFasta. It serves as data anlysis tool that picks best hits from all generations and produces file in FASTA format.
