Team:Warsaw/Software
From 2011.igem.org
(Created page with "<html> <script type="text/javascript"> ActiveTab='Software'; </script> </html> {{TemplateTop}} {{UpperTabs}} {{LowerTabsTeam}} <html> <h2>Project description</h2> ...") |
|||
Line 10: | Line 10: | ||
<html> | <html> | ||
- | |||
- | |||
- | |||
- | |||
- | |||
<br> | <br> | ||
- | <div class="note"> | + | <div class="note">Instalation</div> |
- | <div> | + | <div> |
+ | |||
+ | The expression adaptors generator software is written in Java 6 and distributed as <a href="http://eclipse.org">Eclipse</a> project. It depends on RBSCalculator [H.M. Salis, E.A. Mirsky, C.A. Voigt, Nat. Biotech., 2009] which depends on <a href="http://www.nupack.org/">Nupack</a> and VennaRNA software packages. This restricts platform compatibility because Nupack can only run on Linux. After importing project to Eclipse please change <i>executables.ExpressionAdaptorGenerator.ViennaRNAPath</i> to reflect location of NuPack and Vienna executables (usualy /usr/local/bin). </div> | ||
+ | |||
+ | <div class="note">Structure</div> | ||
+ | |||
+ | <div> | ||
+ | Expression Adaptors generator consists of two main programs <i>ExpressionAdaptorsGenerator.java</i> which implements genetic algorithm frontend and <i>GenerationToFasta.java</i> which performs data analysis. | ||
+ | |||
+ | <div class="note">How it works</div> | ||
+ | <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> | ||
+ | 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> | ||
+ | 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> | ||
+ | </div> | ||
+ | </div> | ||
<br> | <br> | ||
Revision as of 19:04, 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.