In the last years, systems and computational biology focused their efforts in uncovering the causal relationships among the observable perturbations of gene regulatory networks and human diseases. This problem becomes even more challenging when network models and algorithms have to take into account slightly significant effects, caused by often peripheral or unknown genes that cooperatively cause the observed diseased phenotype. Many solutions, from community and pathway analysis to information flow simulation, have been proposed, with the aim of reproducing biological regulatory networks and cascades, directly from empirical data as gene expression microarray data. In this contribute, we propose a methodology to evaluate the most important shortest paths between differentially expressed genes in biological interaction networks, with absolutely no need of user-defined parameters or heuristic rules, enabling a free-of-bias discovery and overcoming common issues affecting the most recent network-based algorithms.
Sem best shortest paths for the characterization of differentially expressed genes
PEPE, DANIELE;GRASSI, MARIO
2015-01-01
Abstract
In the last years, systems and computational biology focused their efforts in uncovering the causal relationships among the observable perturbations of gene regulatory networks and human diseases. This problem becomes even more challenging when network models and algorithms have to take into account slightly significant effects, caused by often peripheral or unknown genes that cooperatively cause the observed diseased phenotype. Many solutions, from community and pathway analysis to information flow simulation, have been proposed, with the aim of reproducing biological regulatory networks and cascades, directly from empirical data as gene expression microarray data. In this contribute, we propose a methodology to evaluate the most important shortest paths between differentially expressed genes in biological interaction networks, with absolutely no need of user-defined parameters or heuristic rules, enabling a free-of-bias discovery and overcoming common issues affecting the most recent network-based algorithms.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.