Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Resultados 1 - 4 de 4
Filtrar
Más filtros

Banco de datos
Tipo del documento
Publication year range
1.
Exp Ther Med ; 16(1): 61-66, 2018 Jul.
Artículo en Inglés | MEDLINE | ID: mdl-29977356

RESUMEN

In the present study, we explored the influence of cigarette smoking and alcohol drinking on gene expression level and related functions and pathways on the development of ischemic stroke (IS) disease. The gene expression profile of E-GEOD-22255 was obtained from 20 IS samples (7 patients without smoking or drinking history and 13 patients with smoking or drinking history) and 20 controls (9 normal controls without smoking or drinking history and 11 controls with smoking or drinking history). The correlation degree between gene expression and grouping were measured by significance analysis of microarray (SAM). Smoking or drinking-related DEGs were screened. GO functional and KEGG pathway enrichment analyses were processed. Based on the KEGG database, a pathway relationship network was constructed. DEGs in significant functions and pathways were inserted and regarded as key DEGs. Gene co-expression network was constructed based on the expression value of key genes. In total, 319 IS-related DEGs, which were induced by smoking and drinking, were screened and enriched in various functions and pathways, including inflammatory response, nuclear factor-κB (NF-κB) signaling pathway and influenza A. Pathway relationship network was constructed with 44 nodes and the hub node was the MAPK signaling pathway. After merging, 87 key DEGs were obtained. The gene co-expression network with 43 node edges was constructed and the hub node was prostaglandin-endoperoxide synthase 2. In IS patients, smoking and drinking may induce different expression of many genes, including PTGS2, TNFAIP3, ZFP36 and NFKBIZ. In addition, these genes participated in various pathways, such as inflammatory response.

2.
Springerplus ; 5(1): 1328, 2016.
Artículo en Inglés | MEDLINE | ID: mdl-27563523

RESUMEN

Let H be a Hilbert space and let C be a closed convex nonempty subset of H and [Formula: see text] a non-self nonexpansive mapping. A map [Formula: see text] defined by [Formula: see text]. Then, for a fixed [Formula: see text] and for [Formula: see text], Krasnoselskii-Mann algorithm is defined by [Formula: see text] where [Formula: see text]. Recently, Colao and Marino (Fixed Point Theory Appl 2015:39, 2015) have proved both weak and strong convergence theorems when C is a strictly convex set and T is an inward mapping. Meanwhile, they proposed a open question for a countable family of non-self nonexpansive mappings. In this article, authors will give an answer and will prove the further generalized results with the examples to support them.

3.
Springerplus ; 5(1): 2009, 2016.
Artículo en Inglés | MEDLINE | ID: mdl-27933265

RESUMEN

In this article, a new multidirectional monotone hybrid iteration algorithm for finding a solution to the split common fixed point problem is presented for two countable families of quasi-nonexpansive mappings in Banach spaces. Strong convergence theorems are proved. The application of the result is to consider the split common null point problem of maximal monotone operators in Banach spaces. Strong convergence theorems for finding a solution of the split common null point problem are derived. This iteration algorithm can accelerate the convergence speed of iterative sequence. The results of this paper improve and extend the recent results of Takahashi and Yao (Fixed Point Theory Appl 2015:87, 2015) and many others .

4.
Springerplus ; 5: 334, 2016.
Artículo en Inglés | MEDLINE | ID: mdl-27066357

RESUMEN

The purpose of this paper is to the best proximity point theorems for the proximal nonexpansive mapping on the starshaped sets by using a clever and simple method. The results improve and extend the recent results of Chen et al. (Fixed Point Theory Appl 2015:19, 2015). It should be noted that, the complex method is used by Jianren Chen et al. can be replaced by the clever and simple method presented in this paper.

SELECCIÓN DE REFERENCIAS
Detalles de la búsqueda