PPGCCM PÓS-GRADUAÇÃO EM CIÊNCIA DA COMPUTAÇÃO FUNDAÇÃO UNIVERSIDADE FEDERAL DO ABC Phone: 11 4996-8337 http://propg.ufabc.edu.br/ppgccm

Banca de DEFESA: CARLOS FERNANDO MONTOYA CUBAS

Uma banca de DEFESA de DOUTORADO foi cadastrada pelo programa.
DISCENTE : CARLOS FERNANDO MONTOYA CUBAS
DATA : 07/12/2020
HORA: 12:30
LOCAL: por participação remota em https://conferenciaweb.rnp.br/webconf/david-41
TÍTULO:

Grouping of instances in equilvalence classes to deal with the curse of dimensionality in gene networks inference


PÁGINAS: 135
GRANDE ÁREA: Ciências Exatas e da Terra
ÁREA: Ciência da Computação
SUBÁREA: Metodologia e Técnicas da Computação
RESUMO:

The inference of gene interaction networks from expression profiles is one of the relevant problems in systems biology, being considered an open problem. Several mathematical, statistical and computational techniques have been developed to model, infer and simulate gene regulation mechanisms, whereas the inference problem is the focus of this work. Our proposal is a continuation of the research conducted during the masters, which involved the study of gene networks inference based on feature selection (selection of the best subset of genes for predicting the behavior of a given target in terms of their temporal mRNA expressions), proposing alternatives to increase the statistical estimation power in typical situations where the set of samples with gene expression profiles is very limited and presents high dimensionality (number of genes). More concretely, during the masters we proposed methods to alleviate the curse of dimensionality in Boolean Networks inference, through Boolean lattice partitions induced by a linear combination of the predictor genes values (predictor instances). Each linear combination value determines an equivalence class between the predictor instances. In this work, the problem of instances grouping was reformulated as a partition lattice search problem, besides idealizing search strategies in this lattice based on prior information (eg. gene networks tend to be mostly composed by linear and canalizing functions) to examine a partition subspace potentially relevant without forgetting computational efficiency. Preliminary results indicate that the developed methods, especially the method which searches for canalizing functions, achieves competitive networks considering both topology and gene expression dynamics generated by the inferred networks. The main advantage of these methods is the superior capacity of generalization to predict the next system state based on randomly chosen initial states which are not in the training set. Besides, we developed a method which transfers the supervised learning achieved from randomly generated (synthetic) networks inference aiming to estimate the correct dimension of the predictor genes set for the corresponding target genes. Such a strategy benefits all gene network inference methods considered, including the original method which does not group instances.


MEMBROS DA BANCA:
Presidente - Interno ao Programa - 1722875 - DAVID CORREA MARTINS JUNIOR
Membro Titular - Examinador(a) Externo ao Programa - 1849928 - CARLOS DA SILVA DOS SANTOS
Membro Titular - Examinador(a) Externo à Instituição - JUNIOR BARRERA - USP
Membro Titular - Examinador(a) Externo à Instituição - RONALDO FUMIO HASHIMOTO - USP
Membro Titular - Examinador(a) Externo à Instituição - ULISSES DE MENDONÇA BRAGA NETO
Membro Suplente - Examinador(a) Interno ao Programa - 1675615 - LUIZ CARLOS DA SILVA ROZANTE
Membro Suplente - Examinador(a) Externo à Instituição - RICARDO DE SOUZA JACOMINI
Notícia cadastrada em: 13/11/2020 18:55
SIGAA | UFABC - Núcleo de Tecnologia da Informação - ||||| | Copyright © 2006-2024 - UFRN - sigaa-2.ufabc.int.br.sigaa-2-prod