7 resultados para Destrezas integradas
em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Biological processes are complex and possess emergent properties that can not be explained or predict by reductionism methods. To overcome the limitations of reductionism, researchers have been used a group of methods known as systems biology, a new interdisciplinary eld of study aiming to understand the non-linear interactions among components embedded in biological processes. These interactions can be represented by a mathematical object called graph or network, where the elements are represented by nodes and the interactions by edges that link pair of nodes. The networks can be classi- ed according to their topologies: if node degrees follow a Poisson distribution in a given network, i.e. most nodes have approximately the same number of links, this is a random network; if node degrees follow a power-law distribution in a given network, i.e. small number of high-degree nodes and high number of low-degree nodes, this is a scale-free network. Moreover, networks can be classi ed as hierarchical or non-hierarchical. In this study, we analised Escherichia coli and Saccharomyces cerevisiae integrated molecular networks, which have protein-protein interaction, metabolic and transcriptional regulation interactions. By using computational methods, such as MathematicaR , and data collected from public databases, we calculated four topological parameters: the degree distribution P(k), the clustering coe cient C(k), the closeness centrality CC(k) and the betweenness centrality CB(k). P(k) is a function that calculates the total number of nodes with k degree connection and is used to classify the network as random or scale-free. C(k) shows if a network is hierarchical, i.e. if the clusterization coe cient depends on node degree. CC(k) is an indicator of how much a node it is in the lesse way among others some nodes of the network and the CB(k) is a pointer of how a particular node is among several ...(Complete abstract click electronic access below)
Resumo:
The reducionism method has helped in the clari cation of functioning of many biological process. However, such process are extremely complex and have emergent properties that can not be explained or even predicted by reducionism methods. To overcome these limits, researchers have been used a set of methods known as systems biology, a new area of biology aiming to understand the interactions between the multiple components of biological processes. These interactions can be represented by a mathematical object called graph or network, where the interacting elements are represented by a vertex and the interactions by edges that connect a pair of vertexes. Into graphs it is possible to nd subgraphs, occurring in complex networks at numbers that are signi cantly higher than those in randomized networks, they are de ned as motifs. As motifs in biological networks may represent the structural units of biological processess, their detection is important. Therefore, the aim of this present work was detect, count and classify motifs present in biological integrated networks of bacteria Escherichia coli and yeast Saccharomyces cere- visiae. For this purpose, we implemented codes in MathematicaR and Python environments for detecting, counting and classifying motifs in these networks. The composition and types of motifs detected in these integrated networks indicate that such networks are organized in three main bridged modules composed by motifs in which edges are all the same type. The connecting bridges are composed by motifs in which the types of edges are diferent
Resumo:
To understand how biological phenomena emerge, the nonlinear interactions among the components envolved in these and the correspondent connected elements, like genes, proteins, etc., can be represented by a mathematical object called graph or network, where interacting elements are represented by edges connecting pairs of nodes. The analysis of various graph-related properties of biological networks has revealed many clues about biological processes. Among these properties, the community structure, i.e. groups of nodes densely connected among themselves, but sparsely connected to other groups, are important for identifying separable functional modules within biological systems for the comprehension of the high-level organization of the cell. Communities' detection can be performed by many algorithms, but most of them are based on the density of interactions among nodes of the same community. So far, the detection and analysis of network communities in biological networks have only been pursued for networks composed by one type of interaction (e.g. protein-protein interactions or metabolic interactions). Since a real biological network is simultaneously composed by protein-protein, metabolic and transcriptional regulatory interactions, it would be interesting to investigate how communities are organized in this type of network. For this purpose, we detected the communities in an integrated biological network of the Escherichia coli and Saccharomyces cerevisiae by using the Clique Percolation Method and we veri ed, by calculating the frequency of each type of interaction and its related entropy, if components of communities... (Complete abstract click electronic access below)
Resumo:
Pós-graduação em Odontologia Preventiva e Social - FOA
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)