As pathogens evolve effective schemes to overcome the effect of antibiotics, the prevalent "one drug and one drug target" approach is falling behind. We propose novel strategies for identifying potential multiple-drug targets in pathogenic protein-protein interaction (PPI) networks with the goal of disrupting known pathways/complexes. Given a set S of pathogenic pathways/complexes, we first consider computing the minimum number of proteins (with no human orthologs) whose removal from the PPI network disrupts all pathways/complexes. Unfortunately, even the best approximation algorithms for this (NP-hard) problem return too many targets to be practical. Thus, we focus on computing the optimal tradeoff (i.e., maximum ratio) between the number of disrupted essential pathways/complexes and the protein targets. For this "sparsest cut" problem, we describe two polynomial time algorithms with respective approximation factors of |S| and (n: number of nodes). On the Escherichia coli PPI network with nine essential (signaling) paths from the KEGG database, our algorithms show how to disrupt three of them by targeting only three proteins (two of them essential proteins). We also consider the case where there are no available essential pathways/complexes to guide us. In order to maximize the number of disrupted "potential" pathways/complexes, we show how to compute the smallest set of proteins whose removal partitions the PPI network into two almost-equal sized subnetworks so as to maximize the number of potential pathways/complexes disrupted. This approach yields 28 potential targets (four of them known drug targets) on the E. coli PPI network whose removal partitions it to two subnetworks with relative sizes of 1-5.
- Biochemical networks
- Computational molecular biology
ASJC Scopus subject areas
- Modeling and Simulation
- Molecular Biology
- Computational Mathematics
- Computational Theory and Mathematics