16 January 2024 in IEEE Journal of Biomedical and Health Informatics
A Synthetic Lethal (SL) interaction is a functional relationship between two genes or functional entities where the loss of either entity is viable but the loss of both is lethal. Such pairs can be used to develop targeted anticancer therapies with fewer side effects and reduced overtreatment. However, finding clinically relevant SL interactions remains challenging. Leveraging unified gene expression data of both disease-free and cancerous samples, we design a new technique based on statistical hypothesis testing, called ASTER, to identify SL pairs. We empirically find that the patterns of mutually exclusivity ASTER finds using genomic and transcriptomic data provides a strong signal of synthetic lethality. For large-scale multiple hypothesis testing, we develop an extension called ASTER++ that can utilize additional input gene features within the hypothesis testing framework. Our computational and functional experiments demonstrate the efficacy of ASTER in identifying SL pairs with potential therapeutic benefits.
28 December 2017 in BMC Bioinformatics
Differential co-expression (DCX) signifies change in degree of co-expression of a set of genes among different biological conditions. It has been used to identify differential co-expression networks or interactomes. Many algorithms have been developed for single-factor differential co-expression analysis and applied in a variety of studies. However, in many studies, the samples are characterized by multiple factors such as genetic markers, clinical variables and treatments. No algorithm or methodology is available for multi-factor analysis of differential co-expression. We developed a novel formulation and a computationally efficient greedy search algorithm called MultiDCoX to perform multi-factor differential co-expression analysis. Simulated data analysis demonstrates that the algorithm can effectively elicit differentially co-expressed (DCX) gene sets and quantify the influence of each factor on co-expression. MultiDCoX analysis of a breast cancer dataset identified interesting biologically meaningful differentially co-expressed (DCX) gene sets along with genetic and clinical factors that influenced the respective differential co-expression. MultiDCoX is a space and time efficient procedure to identify differentially co-expressed gene sets and successfully identify influence of individual factors on differential co-expression.
28 October 2020 in bioRxiv
A Synthetic Lethal (SL) interaction is a functional relationship between two genes or functional entities where the loss of either entity is viable but the loss of both is lethal. Such pairs can be used to develop targeted anticancer therapies with fewer side effects and reduced overtreatment. However, finding clinically actionable SL interactions remains challenging. Leveraging unified gene expression data of both disease-free and cancerous samples, we design a new technique based on statistical hypothesis testing, called ASTER, to identify SL pairs. We empirically find that the patterns of mutually exclusivity ASTER finds using genomic and transcriptomic data provides a strong signal of SL. For large-scale multiple hypothesis testing, we develop an extension called ASTER++ that can utilize additional input gene features within the hypothesis testing framework. Our extensive experiments demonstrate the efficacy of ASTER in identifying SL pairs with potential therapeutic benefits. CCS CONCEPTS: • Applied computing → Computational genomics ; Health informatics ; • Mathematics of computing → Hypothesis testing and confidence interval computation . ACM Reference Format: Herty Liany, Anand Jeyasekharan, and Vaibhav Rajan. 2021. ASTER: A Method to Predict Clinically Actionable Synthetic Lethal Genetic Interactions. In Proceedings of ACM Conference . ACM, New York, NY, USA, 10 pages. https://doi.org/10.1145/nnnnnnn.nnnnnnn
6 January 2022 in IEEE Journal of Biomedical and Health Informatics
Study of pairwise genetic interactions, such as mutually exclusive mutations, has led to understanding of underlying mechanisms in cancer. Investigation of various combinatorial motifs within networks of such interactions can lead to deeper insights into its mutational landscape and inform therapy development. One such motif called the Between-Pathway Model (BPM) represents redundant or compensatory pathways that can be therapeutically exploited. Finding such BPM motifs is challenging since most formulations require solving variants of the NP-complete maximum weight bipartite subgraph problem. In this paper we design an algorithm based on Integer Linear Programming (ILP) to solve this problem. In our experiments, our approach outperforms the best previous method to mine BPM motifs. Further, our ILP-based approach allows us to easily model additional application-specific constraints. We illustrate this advantage through a new application of BPM motifs that can potentially aid in finding combination therapies to combat cancer.
20 February 2020 in bioRxiv
Study of pairwise genetic interactions such as mutual exclusivity or synthetic lethality has led to the development of targeted anticancer therapies, and mining the network of such interactions is a common approach used to obtain deeper insights into the mechanism of cancer. A number of useful graph clustering-based tools exist to mine interaction networks. These tools find subgraphs or groups of genes wherein each gene belongs to a single subgraph. However, a gene may be present in multiple groups – for instance, a gene can be involved in multiple signalling pathways. We develop a new network mining algorithm, that does not impose this constraint and can provide a novel pathway-centric view. Our approach is based on finding edge-disjoint bipartite subgraphs of highest weights in an input network of genes, where edge weights indicate the significance of the interaction and each set of nodes in every bipartite subgraph is constrained to belong to a single pathway. This problem is NP-hard and we develop an Integer Linear Program to solve this problem. We evaluate our algorithm on breast and stomach cancer data. Our algorithm mines dense between-pathway interactions that are known to play important roles in cancer and are therapeutically actionable. Our algorithm complements existing network mining tools and can be useful to study the mutational landscape of cancer and inform therapy development.