In recent years, the role of dietary phenolic compounds in the regulation of cellular metabolism in normal and pathological conditions has become increasingly important in cancer research. In most cases, the molecular...In recent years, the role of dietary phenolic compounds in the regulation of cellular metabolism in normal and pathological conditions has become increasingly important in cancer research. In most cases, the molecular mechanism of action related to the anticarcinogenic effect of phenolic compounds has been studied in vitro and in animal models, but these studies are still not complete. It is precisely here where in silico approaches can be an invaluable tool for complementing in vitro and in vivo research. In this paper, we adopt a tuple space-based modeling and simulation approach, and show how it can be applied to the simulation of complex interaction patterns of intracellular signaling pathways. Specifically, we are working to explore and to understand the molecular mechanism of action of dietary phenolic compounds on the inhibition of the PI3K/AKT anti-apoptotic pathway. As a first approximation, using the tuple spaces- based in silico approach, we model and simulate the anti-apoptotic PI3K/AKT pathway in the absence and presence of phenolic compounds, in order to determine the effectiveness of our platform, to employ it in future prediction of experimentally non visualized interactions between the pathway components and phenolic compounds.展开更多
Given a vertex v of a graph G the second order degree of v denoted as d2（v） is defined as the number of vertices at distance 2 from v. In this paper we address the following question： What axe the sufficient condit...Given a vertex v of a graph G the second order degree of v denoted as d2（v） is defined as the number of vertices at distance 2 from v. In this paper we address the following question： What axe the sufficient conditions for a graph to have a vertex v such that d2（v） ≥ d（v）, where d（v） denotes the degree of v？ Among other results, every graph of minimum degree exactly 2, except four graphs, is shown to have a vertex of second order degree as large as its own degree. Moreover, every K4^--free graph or every maximal planar graph is shown to have a vertex v such that d2（v） ≥ d（v）. Other sufficient conditions on graphs for guaranteeing this property axe also proved.展开更多
文摘In recent years, the role of dietary phenolic compounds in the regulation of cellular metabolism in normal and pathological conditions has become increasingly important in cancer research. In most cases, the molecular mechanism of action related to the anticarcinogenic effect of phenolic compounds has been studied in vitro and in animal models, but these studies are still not complete. It is precisely here where in silico approaches can be an invaluable tool for complementing in vitro and in vivo research. In this paper, we adopt a tuple space-based modeling and simulation approach, and show how it can be applied to the simulation of complex interaction patterns of intracellular signaling pathways. Specifically, we are working to explore and to understand the molecular mechanism of action of dietary phenolic compounds on the inhibition of the PI3K/AKT anti-apoptotic pathway. As a first approximation, using the tuple spaces- based in silico approach, we model and simulate the anti-apoptotic PI3K/AKT pathway in the absence and presence of phenolic compounds, in order to determine the effectiveness of our platform, to employ it in future prediction of experimentally non visualized interactions between the pathway components and phenolic compounds.
基金Supported by the Ministry of Education and Science,Spainthe European Regional Development Fund (ERDF)under project MTM2008-06620-C03-02+2 种基金the Catalan Government under project 2009 SGR 1298CONACyTMxico under project 57371PAPIIT-UNAM IN104609-3
文摘Given a vertex v of a graph G the second order degree of v denoted as d2（v） is defined as the number of vertices at distance 2 from v. In this paper we address the following question： What axe the sufficient conditions for a graph to have a vertex v such that d2（v） ≥ d（v）, where d（v） denotes the degree of v？ Among other results, every graph of minimum degree exactly 2, except four graphs, is shown to have a vertex of second order degree as large as its own degree. Moreover, every K4^--free graph or every maximal planar graph is shown to have a vertex v such that d2（v） ≥ d（v）. Other sufficient conditions on graphs for guaranteeing this property axe also proved.
