Artificial Intelligence in Medicine
Volume 35, Issue 1 , Pages 61-73, September 2005

Efficient RNAi-based gene family knockdown via set cover optimization

University of New Mexico, Department of Computer Science, Albuquerque, NM 87131-0001, USA

Received 12 November 2004; received in revised form 6 January 2005; accepted 12 January 2005.

Summary 

Objective:

We address the problem of selecting an efficient set of initiator molecules (siRNAs) for RNA interference (RNAi)-based gene family knockdown experiments. Our goal is to select a minimal set of siRNAs that (a) cover a targeted gene family or a specified subset of it, (b) do not cover any untargeted genes, and (c) are individually highly effective at inducing knockdown.

Methods and material:

We give two formalizations of the gene family knockdown problem. First, we show that the problem, minimizing the number of siRNAs required to knock down a family of genes, is NP-Hard via a reduction to the set cover problem. Second, we generalize the basic problem to incorporate additional biological constraints and optimality criteria. To solve the resulting set-cover variants, we modify the classical branch-and-bound algorithm to include some of these biological criteria. We find that in many typical cases these constraints reduce the search space enough that we are able to compute exact minimal siRNA covers within reasonable time. For larger cases, we propose a probabilistic greedy algorithm for finding minimal siRNA covers efficiently. We apply our methods to two different gene families, the FREP genes from Biomphalaria glabrata and the olfactory genes from Caenorhabditis elegans.

Results and conclusion:

Our computational results on real biological data show that the probabilistic greedy algorithm produces siRNA covers as good as the branch-and-bound algorithm in most cases. Both algorithms return minimal siRNA covers with high predicted probability that the selected siRNAs will be effective at inducing knockdown. We also examine the role of “off-target” interactions: the constraint of avoiding covering untargeted genes can, in some cases, substantially increase the complexity of the resulting solution. Overall, we find that in many common cases our approach significantly reduces the number of siRNAs required in gene family knockdown experiments, as compared to knocking down genes independently.

Keywords: Gene family knockdown, siRNA design, RNA interference, Minimal siRNA cover, Set cover

To access this article, please choose from the options below

Login to an existing account or Register a new account.

  • Purchase this article for 31.50 USD (You must login/register to purchase this article)

    Online access for 24 hours. The PDF version can be downloaded as your permanent record.

  • Subscribe to this title

    Get unlimited online access to this article and all other articles in this title 24/7 for one year.

  • Claim access now

    For current subscribers with Society Membership or Account Number.

  • Visit SciVerse ScienceDirect to see if you have access via your institution.
 

PII: S0933-3657(05)00059-X

doi:10.1016/j.artmed.2005.01.009

Artificial Intelligence in Medicine
Volume 35, Issue 1 , Pages 61-73, September 2005