Background: Discovering the molecular targets of compounds or the cause of physiological conditions, among the multitude of known genes, is one of the major challenges of bioinformatics. One of the most common approaches to this problem is finding sets of differentially expressed, and more recently differentially co-expressed, genes. Other approaches require libraries of genetic mutants or require to perform a large number of assays. Another elegant approach is the filtering of mRNA expression profiles using reverse-engineered gene network models of the target cell. This approach has the advantage of not needing control samples, libraries or numerous assays. Nevertheless, the impementations of this strategy proposed so far are computationally demanding. Moreover the user has to arbitrarily choose a threshold on the number of potentially relevant genes from the algorithm output. Results: Our solution, while performing comparably to state of the art algorithms in terms of discovered targets, is more efficient in terms of memory and time consumption. The proposed algorithm computes the likelihood associated to each gene and outputs to the user only the list of likely perturbed genes. Conclusions: The proposed algorithm is a valid alternative to existing algorithms and is particularly suited to contemporary gene expression microarrays, given the number of probe sets in each chip, also when executed on common desktop computers.
|Titolo:||Scalable high-throughput identification of genetic targets by network filtering|
|Data di pubblicazione:||2013|
|Digital Object Identifier (DOI):||10.1186/1471-2105-14-S8-S5|
|Appare nelle tipologie:||1.1 Articolo in rivista|