995 resultados para Inf-convolution
Resumo:
Hepatitis C virus (HCV) infection frequently persists despite substantial virus-specific immune responses and the combination of pegylated interferon (INF)-alpha and ribavirin therapy. Major histocompatibility complex class I restricted CD8+ T cells are responsible for the control of viraemia in HCV infection, and several studies suggest protection against viral infection associated with specific HLAs. The reason for low rates of sustained viral response (SVR) in HCV patients remains unknown. Escape mutations in response to cytotoxic T lymphocyte are widely described; however, its influence in the treatment outcome is ill understood. Here, we investigate the differences in CD8 epitopes frequencies from the Los Alamos database between groups of patients that showed distinct response to pegylated alpha-INF with ribavirin therapy and test evidence of natural selection on the virus in those who failed treatment, using five maximum likelihood evolutionary models from PAML package. The group of sustained virological responders showed three epitopes with frequencies higher than Non-responders group, all had statistical support, and we observed evidence of selection pressure in the last group. No escape mutation was observed. Interestingly, the epitope VLSDFKTWL was 100% conserved in SVR group. These results suggest that the response to treatment can be explained by the increase in immune pressure, induced by interferon therapy, and the presence of those epitopes may represent an important factor in determining the outcome of therapy.
Resumo:
A high-energy efficient method is developed for the synthesis of LiFePO
Resumo:
Abstract The decomposition sequence of the supersaturated solid solution leading to the formation of the equilibrium S (Al
Resumo:
The stability of encapsulated planar-structured CH
Resumo:
LiFe
Resumo:
Abstract Mg
Resumo:
Porous Mn
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
A hepatite B crônica apresenta amplo espectro de manifestações clínicas, resultante de diversos fatores, tais como o padrão de secreção e polimorfismo nos genes de citocinas. Este trabalho objetiva correlacionar os polimorfismos TNF-α -308G/A, INF-γ +874A/T, TGF-β1 -509C/T e IL-10 -1081A/G e os níveis séricos destas citocinas com a apresentação clínica da hepatite B. Foram selecionados 53 casos consecutivos de hepatite B, sendo divididos em grupo A (portador inativo= 30) e B (hepatite crônica/cirrose= 23). Como grupo controle, selecionaram-se 100 indivíduos com anti-HBc e anti-HBs positivos. Os níveis séricos das citocinas foram determinados por ensaios imunoenzimáticos, tipo ELISA (eBiosceince, Inc. Califórnia, San Diego, USA). A amplificação gênica das citocinas se realizou pela PCR e a análise histopatológica obedeceu à classificação METAVIR. Identificou-se maior prevalência do genótipo TNF-α -308AG (43,3% vs. 14,4%) no grupo B do que nos controles e a presença do alelo A se correlacionou com risco de infecção crônica pelo VHB (OR= 2,6). Os níveis séricos de INF-γ e de IL-10 foram maiores (p< 0,001) nos controles do que os demais grupos e, inversamente, as concentrações plasmáticas de TGF-β1 foram menores no grupo controle (p< 0,01). Observou-se, na histopatologia hepática, que atividade inflamatória > 2 se correlacionou com maiores níveis de TNF-α e de INF-γ (p< 0,05), assim como a fibrose > 2 com maiores níveis de INF-γ (p< 0,01). Na população pesquisada, menores níveis séricos de INF-γ e de IL-10 e maiores de TGF-β1 estiveram associados com a hepatite B crônica, bem como a presença do alelo A no gene TNF-α - 308 aumentou em 2,6 o risco de cronificação.
Resumo:
A resposta imune na malária é complexa, e os mecanismos de ativação e regulação de linfócitos T efetores e de memória ainda são pouco compreendidos. No presente estudo, determinamos a concentração das citocinas Interferon-γ (IFN-γ), Interleucina-10 (IL-10), Interleucina-4 (IL-4) e Interleucina-12 (IL-12) no soro de indivíduos infectados por Plasmodium vivax, investigamos os polimorfismos no gene do IFN-γ (IFNG+874) e da IL-10 (IL10-1082) e analisamos a associação destes polimorfismos com a concentração das citocinas e com a densidade parasitária. A concentração das citocinas foi determinada por ELISA, e a genotipagem dos polimorfismos IFNG+874 e IL10-1082 foi realizada pelas técnicas de ASO-PCR e PCR-RFLP, respectivamente. Os indivíduos infectados apresentaram níveis séricos de IFN-γ e IL-10 aumentados. A produção de IFN-γ foi maior nos indivíduos primoinfectados, porém não foi associada com a redução da parasitemia. A produção de IL-10 foi alta e associada com altas parasitemias. As citocinas IL-4 e IL-12 não foram detectadas. As freqüências dos genótipos homozigoto mutante AA, heterozigoto AT e selvagem TT do gene do IFN-γ foram 0,51, 0,39 e 0,10, respectivamente. As freqüências dos genótipos homozigoto mutante AA, heterozigoto AG e selvagem GG para IL10 foram 0,49, 0,43 e 0,08, respectivamente. Apenas o polimorfismo do IFN-γ foi associado com níveis reduzidos desta citocina. Na malária causada por P. vivax, houve produção de citocina que caracteriza o perfil Th1 (IFN-γ), com possível participação da IL-10 na imunorregulação.
Resumo:
Financial Support FAPESP, CNPq, CTC/FUNDHERP and INCTC.
Resumo:
Machine learning comprises a series of techniques for automatic extraction of meaningful information from large collections of noisy data. In many real world applications, data is naturally represented in structured form. Since traditional methods in machine learning deal with vectorial information, they require an a priori form of preprocessing. Among all the learning techniques for dealing with structured data, kernel methods are recognized to have a strong theoretical background and to be effective approaches. They do not require an explicit vectorial representation of the data in terms of features, but rely on a measure of similarity between any pair of objects of a domain, the kernel function. Designing fast and good kernel functions is a challenging problem. In the case of tree structured data two issues become relevant: kernel for trees should not be sparse and should be fast to compute. The sparsity problem arises when, given a dataset and a kernel function, most structures of the dataset are completely dissimilar to one another. In those cases the classifier has too few information for making correct predictions on unseen data. In fact, it tends to produce a discriminating function behaving as the nearest neighbour rule. Sparsity is likely to arise for some standard tree kernel functions, such as the subtree and subset tree kernel, when they are applied to datasets with node labels belonging to a large domain. A second drawback of using tree kernels is the time complexity required both in learning and classification phases. Such a complexity can sometimes prevents the kernel application in scenarios involving large amount of data. This thesis proposes three contributions for resolving the above issues of kernel for trees. A first contribution aims at creating kernel functions which adapt to the statistical properties of the dataset, thus reducing its sparsity with respect to traditional tree kernel functions. Specifically, we propose to encode the input trees by an algorithm able to project the data onto a lower dimensional space with the property that similar structures are mapped similarly. By building kernel functions on the lower dimensional representation, we are able to perform inexact matchings between different inputs in the original space. A second contribution is the proposal of a novel kernel function based on the convolution kernel framework. Convolution kernel measures the similarity of two objects in terms of the similarities of their subparts. Most convolution kernels are based on counting the number of shared substructures, partially discarding information about their position in the original structure. The kernel function we propose is, instead, especially focused on this aspect. A third contribution is devoted at reducing the computational burden related to the calculation of a kernel function between a tree and a forest of trees, which is a typical operation in the classification phase and, for some algorithms, also in the learning phase. We propose a general methodology applicable to convolution kernels. Moreover, we show an instantiation of our technique when kernels such as the subtree and subset tree kernels are employed. In those cases, Direct Acyclic Graphs can be used to compactly represent shared substructures in different trees, thus reducing the computational burden and storage requirements.