Skip Navigation


Bioinformatics Advance Access originally published online on June 19, 2009
Bioinformatics 2009 25(17):2229-2235; doi:10.1093/bioinformatics/btp375
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow Supplementary Data
Right arrow All Versions of this Article:
25/17/2229    most recent
btp375v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kaderali, L.
Right arrow Articles by Bartenschlager, R.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Kaderali, L.
Right arrow Articles by Bartenschlager, R.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Reconstructing signaling pathways from RNAi data using probabilistic Boolean threshold networks

Lars Kaderali 1,*, Eva Dazert 2, Ulf Zeuge 2, Michael Frese 2,{dagger} and Ralf Bartenschlager 2

1 Viroquant Research Group Modeling, University of Heidelberg, Bioquant BQ26, Im Neuenheimer Feld 267 and 2 Medical Faculty, Department of Molecular Virology, University of Heidelberg, Im Neuenheimer Feld 345, 69120 Heidelberg, Germany

* To whom correspondence should be addressed.


   Abstract

Motivation: The reconstruction of signaling pathways from gene knockdown data is a novel research field enabled by developments in RNAi screening technology. However, while RNA interference is a powerful technique to identify genes related to a phenotype of interest, their placement in the corresponding pathways remains a challenging problem. Difficulties are aggravated if not all pathway components can be observed after each knockdown, but readouts are only available for a small subset. We are then facing the problem of reconstructing a network from incomplete data.

Results: We infer pathway topologies from gene knockdown data using Bayesian networks with probabilistic Boolean threshold functions. To deal with the problem of underdetermined network parameters, we employ a Bayesian learning approach, in which we can integrate arbitrary prior information on the network under consideration. Missing observations are integrated out. We compute the exact likelihood function for smaller networks, and use an approximation to evaluate the likelihood for larger networks. The posterior distribution is evaluated using mode hopping Markov chain Monte Carlo. Distributions over topologies and parameters can then be used to design additional experiments. We evaluate our approach on a small artificial dataset, and present inference results on RNAi data from the Jak/Stat pathway in a human hepatoma cell line.

Availability: Software is available on request.

Contact: lars.kaderali{at}bioquant.uni-heidelberg.de

Supplementary information: Supplementary data are available at Bioinformatics online.

{dagger}Present address: Faculty of Applied Science University of Canberra, Canberra, ACT, Australia.

Associate Editor: Trey Ideker


Received on January 29, 2009; revised on May 6, 2009; accepted on June 9, 2009

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.