Team:USTC Software/WhatOverview
From 2009.igem.org
Line 28: | Line 28: | ||
===Particle Swarm Optimization Algorithm=== | ===Particle Swarm Optimization Algorithm=== | ||
- | The particle swarm optimization algorithm (PSO) is employed to optimized the parameters in a fixed mathematic model.In past several years, PSO has been successfully applied in optimizing the parameters for | + | The particle swarm optimization algorithm (PSO) is employed to optimized the parameters in a fixed mathematic model. In past several years, PSO has been successfully applied in optimizing the parameters for nonlinear system. It is demonstrated that PSO gets better results in a faster, cheaper way compared with other methods. The most important reason we choose to implement this algorithm into our software is that it is easy to realize parallelization. Since the most time-consuming part in our scheme is the optimization of parameters for a given topological structure. If we cannot find a efficient optimizer, it is impossible to deal with systems contains more than five or six nodes. Parallelization of the optimization process will be implemented in our next version. |
===Genetic Algorithm=== | ===Genetic Algorithm=== | ||
- | Genetic Algorithm (GA) is employed to search the best | + | Genetic Algorithm (GA) is employed to search the best topologies and the best interaction forms. It is a powerful method for complex optimization problems. It realizes an essential evolution process in a computer. Under a fitness function, the members of the population will be improved from generation to generation. And the population will fit the pressure much better by the intraspecific competition. It is suitable for our problems; because it can be converged in a moderate generations and can give a population of best topologies, not only one by other algorithms. |
==Future== | ==Future== | ||
- | It is just the first step. We still have a lot | + | It is just the first step. We still have a lot to do to achieve the final goal. First, the link should be established between the interaction forms and the real particles, as the promoters, the proteins, the ligands and so on. We are trying to build a database to construct the links, but the experiments data now are far than enough. And there are still some problems in the measurement of the parameters. Second, the optimization space is too large for us to search. Our program should run for a long time to finish the whole job. The parallel computation is favorable here. So we will use the parallel computation to do the optimization in the next version. Third, the on-line version is also required as it will be more convenient to the users. |
|} | |} | ||
Revision as of 19:16, 21 October 2009
About | Team and People | Project | Standard | Notebook | Demo | Safety | External Links |
---|
|
Project Overview
|
|