完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Ho, SY | en_US |
dc.contributor.author | Hsieh, CH | en_US |
dc.contributor.author | Yu, FC | en_US |
dc.contributor.author | Huang, HL | en_US |
dc.date.accessioned | 2014-12-08T15:25:20Z | - |
dc.date.available | 2014-12-08T15:25:20Z | - |
dc.date.issued | 2005 | en_US |
dc.identifier.isbn | 0-7803-9363-5 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/17726 | - |
dc.description.abstract | This paper proposes an efficient evolutionary divide-and-conquer approach (EDACA) to inferring S-system models of genetic networks from time-series data of gene expression. Inference of an S-system model has 2N(N+l) parameters to be optimized where N is the number of genes in a genetic network. To cope with higher dimensionality, the proposed approach consists of two stages where each uses a divide-and-conquer strategy. The optimization problem is first decomposed into N subproblems having 2(N+1) parameters each. At the first stage, each subproblem is solved using a novel intelligent genetic algorithm (IGA) with intelligent crossover based on orthogonal experimental design (OED). The intelligent crossover divides two parents into n pairs of parameter groups, economically identifies the potentially better one of two groups of each pair, and systematically obtains a potentially good approximation to the best one of all 2(n) combinations using at most 2n function evaluations. At the second stage, the obtained N solutions to the N subproblems are combined and refined using an OED-based simulated annealing algorithm (OSA) for handling noisy gene expression data. The effectiveness of EDACA is evaluated using simulated expression patterns with/without noise running on a single-CPU PC. It is shown that: 1) IGA is efficient enough to solve subproblems; 2) IGA is significantly superior to. the existing method of using GA with simplex crossover; and 3) EDACA performs well in inferring S-system models of genetic networks from small-noise gene expression data. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Evolutionary divide-and-conquer approach to inferring S-system models of genetic networks | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | 2005 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS | en_US |
dc.citation.spage | 691 | en_US |
dc.citation.epage | 698 | en_US |
dc.contributor.department | 生物科技學系 | zh_TW |
dc.contributor.department | Department of Biological Science and Technology | en_US |
dc.identifier.wosnumber | WOS:000232173100091 | - |
顯示於類別: | 會議論文 |