Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 3 de 3
Filtrar
Mais filtros










Base de dados
Intervalo de ano de publicação
1.
Methods Mol Biol ; 673: 297-321, 2010.
Artigo em Inglês | MEDLINE | ID: mdl-20835807

RESUMO

A genetic algorithm (GA) is a procedure that mimics processes occurring in Darwinian evolution to solve computational problems. A GA introduces variation through "mutation" and "recombination" in a "population" of possible solutions to a problem, encoded as strings of characters in "genomes," and allows this population to evolve, using selection procedures that favor the gradual enrichment of the gene pool with the genomes of the "fitter" individuals. GAs are particularly suitable for optimization problems in which an effective system design or set of parameter values is sought.In nature, genetic regulatory networks (GRNs) form the basic control layer in the regulation of gene expression levels. GRNs are composed of regulatory interactions between genes and their gene products, and are, inter alia, at the basis of the development of single fertilized cells into fully grown organisms. This paper describes how GAs may be applied to find functional regulatory schemes and parameter values for models that capture the fundamental GRN characteristics. The central ideas behind evolutionary computation and GRN modeling, and the considerations in GA design and use are discussed, and illustrated with an extended example. In this example, a GRN-like controller is sought for a developmental system based on Lewis Wolpert's French flag model for positional specification, in which cells in a growing embryo secrete and detect morphogens to attain a specific spatial pattern of cellular differentiation.


Assuntos
Algoritmos , Biologia Computacional/métodos , Evolução Molecular , Redes Reguladoras de Genes/genética , Aptidão Genética , Variação Genética , Genoma/genética , Genótipo , Fenótipo , Seleção Genética
2.
Biosystems ; 94(1-2): 68-74, 2008.
Artigo em Inglês | MEDLINE | ID: mdl-18611431

RESUMO

Methods that analyse the topological structure of networks have recently become quite popular. Whether motifs (subgraph patterns that occur more often than in randomized networks) have specific functions as elementary computational circuits has been cause for debate. As the question is difficult to resolve with currently available biological data, we approach the issue using networks that abstractly model natural genetic regulatory networks (GRNs) which are evolved to show dynamical behaviors. Specifically one group of networks was evolved to be capable of exhibiting two different behaviors ("differentiation") in contrast to a group with a single target behavior. In both groups we find motif distribution differences within the groups to be larger than differences between them, indicating that evolutionary niches (target functions) do not necessarily mold network structure uniquely. These results show that variability operators can have a stronger influence on network topologies than selection pressures, especially when many topologies can create similar dynamics. Moreover, analysis of motif functional relevance by lesioning did not suggest that motifs were of greater importance to the functioning of the network than arbitrary subgraph patterns. Only when drastically restricting network size, so that one motif corresponds to a whole functionally evolved network, was preference for particular connection patterns found. This suggests that in non-restricted, bigger networks, entanglement with the rest of the network hinders topological subgraph analysis.


Assuntos
Algoritmos , Evolução Biológica , Redes Reguladoras de Genes , Modelos Genéticos , Biologia Computacional , Meio Ambiente , Seleção Genética
3.
Artif Life ; 14(1): 135-48, 2008.
Artigo em Inglês | MEDLINE | ID: mdl-18171136

RESUMO

We study the evolvability and dynamics of artificial genetic regulatory networks (GRNs), as active control systems, realizing simple models of biological clocks that have evolved to respond to periodic environmental stimuli of various kinds with appropriate periodic behaviors. GRN models may differ in the evolvability of expressive regulatory dynamics. A new class of artificial GRNs with an evolvable number of complex cis-regulatory control sites--each involving a finite number of inhibitory and activatory binding factors--is introduced, allowing realization of complex regulatory logic. Previous work on biological clocks in nature has noted the capacity of clocks to oscillate in the absence of environmental stimuli, putting forth several candidate explanations for their observed behavior, related to anticipation of environmental conditions, compartmentation of activities in time, and robustness to perturbations of various kinds or to unselected accidents of neutral selection. Several of these hypotheses are explored by evolving GRNs with and without (Gaussian) noise and blackout periods for environmental stimulation. Robustness to certain types of perturbation appears to account for some, but not all, dynamical properties of the evolved networks. Unselected abilities, also observed for biological clocks, include the capacity to adapt to change in wavelength of environmental stimulus and to clock resetting.


Assuntos
Relógios Biológicos/genética , Evolução Biológica , Simulação por Computador , Redes Reguladoras de Genes/fisiologia , Modelos Biológicos , Relógios Biológicos/fisiologia , Regulação da Expressão Gênica
SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA
...