MHMahnaz Habibi

Mahnaz Habibi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Mahnaz Habibi has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Topological network based drug repurposing for coronavirus 2019

    by Mahnaz Habibi, Golnaz Taheri

    The COVID-19 pandemic caused by the Severe Acute Respiratory Syndrome Coronavirus 2 (SARS-CoV-2) has become the current health concern and threat to the entire world. Thus, the world needs the fast recognition of appropriate drugs to restrict the spread of this disease. The global effort started to identify the best drug compounds to treat COVID-19, but going through a series of clinical trials and our lack of information about the details of the virus’s performance has slowed down the time to reach this goal. In this work, we try to select the subset of human proteins as candidate sets that can bind to approved drugs. Our method is based on the information on human-virus protein interaction and their effect on the biological processes of the host cells. We also define some informative topological and statistical features for proteins in the protein-protein interaction network. We evaluate our selected sets with two groups of drugs. The first group contains the experimental unapproved treatments for COVID-19, and we show that from 17 drugs in this group, 15 drugs are approved by our selected sets. The second group contains the external clinical trials for COVID-19, and we show that 85% of drugs in this group, target at least one protein of our selected sets. We also study COVID-19 associated protein sets and identify proteins that are essential to disease pathology. For this analysis, we use DAVID tools to show and compare disease-associated genes that are contributed between the COVID-19 comorbidities. Our results for shared genes show significant enrichment for cardiovascular-related, hypertension, diabetes type 2, kidney-related and lung-related diseases. In the last part of this work, we recommend 56 potential effective drugs for further research and investigation for COVID-19 treatment. Materials and implementations are available at: https://github.com/MahnazHabibi/Drug-repurposing.


  • Open Access

    A SARS-CoV-2 (COVID-19) biological network to find targets for drug repurposing

    by Mahnaz Habibi, Golnaz Taheri, Rosa Aghdam

    The Coronavirus disease 2019 (COVID-19) caused by the SARS-CoV-2 virus needs a fast recognition of effective drugs to save lives. In the COVID-19 situation, finding targets for drug repurposing can be an effective way to present new fast treatments. We have designed a two-step solution to address this approach. In the first step, we identify essential proteins from virus targets or their associated modules in human cells as possible drug target candidates. For this purpose, we apply two different algorithms to detect some candidate sets of proteins with a minimum size that drive a significant disruption in the COVID-19 related biological networks. We evaluate the resulted candidate proteins sets with three groups of drugs namely Covid-Drug, Clinical-Drug, and All-Drug. The obtained candidate proteins sets approve 16 drugs out of 18 in the Covid-Drug, 273 drugs out of 328 in the Clinical-Drug, and a large number of drugs in the All-Drug. In the second step, we study COVID-19 associated proteins sets and recognize proteins that are essential to disease pathology. This analysis is performed using DAVID to show and compare essential proteins that are contributed between the COVID-19 comorbidities. Our results for shared proteins show significant enrichment for cardiovascular-related, hypertension, diabetes type 2, kidney-related and lung-related diseases.


  • DISRUPTION OF PROTEIN COMPLEXES

    by Golnaz Taheri, Mahnaz Habibi, Limsoon Wong, Changiz Eslahchi

    Protein complexes are a cornerstone of many biological processes and, together, they form various types of molecular machinery that perform a vast array of biological functions. Different complexes perform different functions and, the same complex can perform very different functions that depend on a variety of factors. Thus disruption of protein complexes can be lethal to an organism. It is interesting to identify a minimal set of proteins whose removal would lead to a massive disruption of protein complexes and, to understand the biological properties of these proteins. A method is presented for identifying a minimum number of proteins from a given set of complexes so that a maximum number of these complexes are disrupted when these proteins are removed. The method is based on spectral bipartitioning. This method is applied to yeast protein complexes. The identified proteins participate in a large number of biological processes and functional modules. A large proportion of them are essential proteins. Moreover, removing these identified proteins causes a large number of the yeast protein complexes to break into two fragments of nearly equal size, which minimizes the chance of either fragment being functional. The method is also superior in these aspects to alternative methods based on proteins with high connection degree, proteins whose neighbors have high average degree, and proteins that connect to lots of proteins of high connection degree. Our spectral bipartitioning method is able to efficiently identify a biologically meaningful minimal set of proteins whose removal causes a massive disruption of protein complexes in an organism.


  • Constructing circular phylogenetic networks from weighted quartets using simulated annealing

    by Changiz Eslahchi, Reza Hassanzadeh, Ehsan Mottaghi, Mahnaz Habibi, Hamid Pezeshk, Mehdi Sadeghi


  • Open Access

    Protein complex prediction based on k-connected subgraphs in protein interaction network

    by Mahnaz Habibi, Changiz Eslahchi, Limsoon Wong

    Background: Protein complexes play an important role in cellular mechanisms. Recently, several methods have been presented to predict protein complexes in a protein interaction network. In these methods, a protein complex is predicted as a dense subgraph of protein interactions. However, interactions data are incomplete and a protein complex does not have to be a complete or dense subgraph. Results: We propose a more appropriate protein complex prediction method, CFA, that is based on connectivity number on subgraphs. We evaluate CFA using several protein interaction networks on reference protein complexes in two benchmark data sets (MIPS and Aloy), containing 1142 and 61 known complexes respectively. We compare CFA to some existing protein complex prediction methods (CMC, MCL, PCP and RNSC) in terms of recall and precision. We show that CFA predicts more complexes correctly at a competitive level of precision. Conclusions: Many real complexes with different connectivity level in protein interaction network can be predicted based on connectivity number. Our CFA program and results are freely available from http://www.bioinf.cs.ipm.ir/softwares/cfa/CFA.rar.


  • Open Access

    MC-Net: a method for the construction of phylogenetic networks based on the Monte-Carlo method

    by Changiz Eslahchi, Mahnaz Habibi, Reza Hassanzadeh, Ehsan Mottaghi

    A phylogenetic network is a generalization of phylogenetic trees that allows the representation of conflicting signals or alternative evolutionary histories in a single diagram. There are several methods for constructing these networks. Some of these methods are based on distances among taxa. In practice, the methods which are based on distance perform faster in comparison with other methods. The Neighbor-Net (N-Net) is a distance-based method. The N-Net produces a circular ordering from a distance matrix, then constructs a collection of weighted splits using circular ordering. The SplitsTree which is a program using these weighted splits makes a phylogenetic network. In general, finding an optimal circular ordering is an NP-hard problem. The N-Net is a heuristic algorithm to find the optimal circular ordering which is based on neighbor-joining algorithm.