Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mehdi Mirzaie

dblp:125/1785 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0003-4434-5118ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 6 · 1 first-authorArtificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › network bioinformatics › biological network analysis
network analysis
0.412019
CINNA: an R/CRAN package to decipher Central Informative Nodes in Network Analysis · Bioinform. 2019
Bioinformatics and computational biology › network bioinformatics › biological network analysis › network analysis
network centrality
0.412019
CINNA: an R/CRAN package to decipher Central Informative Nodes in Network Analysis · Bioinform. 2019

Methods — techniques the papers use, named apart from their topics

dimensional reduction · 0.4centrality measures · 0.4
YearPublicationVenuePosition
2019 Integrated use of bioinformatic resources reveals that co-targeting of histone deacetylases, IKBK and SRC inhibits epithelial-mesenchymal transition in cancer
abstract
With the advent of high-throughput technologies leading to big data generation, increasing number of gene signatures are being published to predict various features of diseases such as prognosis and patient survival. However, to use these signatures for identifying therapeutic targets, use of additional bioinformatic tools is indispensible part of research. Here, we have generated a pipeline comprised of nearly 15 bioinformatic tools and enrichment statistical methods to propose and validate a drug combination strategy from already approved drugs and present our approach using published pan-cancer epithelial-mesenchymal transition (EMT) signatures as a case study. We observed that histone deacetylases were critical targets to tune expression of multiple epithelial versus mesenchymal genes. Moreover, SRC and IKBK were the principal intracellular kinases regulating multiple signaling pathways. To confirm the anti-EMT efficacy of the proposed target combination in silico, we validated expression of targets in mesenchymal versus epithelial subtypes of ovarian cancer. Additionally, we inhibited the pinpointed proteins in vitro using an invasive lung cancer cell line. We found that whereas low-dose mono-therapy failed to limit cell dispersion from collagen spheroids in a microfluidic device as a metric of EMT, the combination fully inhibited dissociation and invasion of cancer cells toward cocultured endothelial cells. Given the approval status and safety profiles of the suggested drugs, the proposed combination set can be considered in clinical trials.
Farnaz Barneh, Mehdi Mirzaie, Payman Nickchi, Tuan Zea Tan, Jean-Paul Thiery, Mehran Piran, Mona Salimi, Fatemeh Goshadrou, Amir R. Aref, Mohieddin Jafari
Briefings Bioinform.2
2019 CINNA: an R/CRAN package to decipher Central Informative Nodes in Network Analysis
abstract
MOTIVATION: Centrality analysis involves a series of ambiguities in that there are numerous well-known centrality measures with differing algorithms for establishing which nodes in a network are essential. There is no clearly preferred measure or means of deciding which measure is most germane to a given network with respect to node essentiality vis-à-vis topological features. Our aim here was to develop an instrument that enables comparisons among potentially appropriate centrality measures to be made with respect to network structure and thereby to support the identification of the most informative measure according to dimensional reduction methods. METHODS: The Central Informative Nodes in Network Analysis (CINNA) package introduced herein gathers all required functions for centrality analysis in weighted/unweighted and directed/undirected networks. Then, it compares, assorts and visualizes centrality measures to select which best describes the node importance. AVAILABILITY AND IMPLEMENTATION: CINNA is available in CRAN, including a tutorial. URL: https://cran.r-project.org/web/packages/CINNA/index.html.
Minoo Ashtiani, Mehdi Mirzaie, Mohieddin Jafari
Bioinform.2
2019 IMMAN: an R/Bioconductor package for Interolog protein network reconstruction, mapping and mining analysis
abstract
BACKGROUND: Reconstruction of protein-protein interaction networks (PPIN) has been riddled with controversy for decades. Particularly, false-negative and -positive interactions make this progress even more complicated. Also, lack of a standard PPIN limits us in the comparison studies and results in the incompatible outcomes. Using an evolution-based concept, i.e. interolog which refers to interacting orthologous protein sets, pave the way toward an optimal benchmark. RESULTS: Here, we provide an R package, IMMAN, as a tool for reconstructing Interolog Protein Network (IPN) by integrating several Protein-protein Interaction Networks (PPINs). Users can unify different PPINs to mine conserved common networks among species. IMMAN is designed to retrieve IPNs with different degrees of conservation to engage prediction analysis of protein functions according to their networks. CONCLUSIONS: IPN consists of evolutionarily conserved nodes and their related edges regarding low false positive rates, which can be considered as a gold standard network in the contexts of biological network analysis regarding to those PPINs which is derived from.
Minoo Ashtiani, Payman Nickchi, Soheil Jahangiri-Tazehkand, Abdollah Safari, Mehdi Mirzaie, Mohieddin Jafari
BMC Bioinform.5
2019 Identification of native protein structures captured by principal interactions
abstract
BACKGROUND: Evaluation of protein structure is based on trustworthy potential function. The total potential of a protein structure is approximated as the summation of all pair-wise interaction potentials. Knowledge-based potentials (KBP) are one type of potential functions derived by known experimentally determined protein structures. Although several KBP functions with different methods have been introduced, the key interactions that capture the total potential have not studied yet. RESULTS: In this study, we seek the interaction types that preserve as much of the total potential as possible. We employ a procedure based on the principal component analysis (PCA) to extract the significant and key interactions in native protein structures. We call these interactions as principal interactions and show that the results of the model that considers only these interactions are very close to the full interaction model that considers all interactions in protein fold recognition. In fact, the principal interactions maintain the discriminative power of the full interaction model. This method was evaluated on 3 KBPs with different contact definitions and thresholds of distance and revealed that their corresponding principal interactions are very similar and have a lot in common. Additionally, the principal interactions consisted of 20 % of the full interactions on average, and they are between residues, which are considered important in protein folding. CONCLUSIONS: This work shows that all interaction types are not equally important in discrimination of native structure. The results of the reduced model based on principal interactions that were very close to the full interaction model suggest that a new strategy is needed to capture the role of remaining interactions (non-principal interactions) to improve the power of knowledge-based potential functions.
Mehdi Mirzaie
BMC Bioinform.1
2016 Updates on drug-target network; facilitating polypharmacology and data integration by growth of DrugBank database
abstract
Network pharmacology elucidates the relationship between drugs and targets. As the identified targets for each drug increases, the corresponding drug-target network (DTN) evolves from solely reflection of the pharmaceutical industry trend to a portrait of polypharmacology. The aim of this study was to evaluate the potentials of DrugBank database in advancing systems pharmacology. We constructed and analyzed DTN from drugs and targets associations in the DrugBank 4.0 database. Our results showed that in bipartite DTN, increased ratio of identified targets for drugs augmented density and connectivity of drugs and targets and decreased modular structure. To clear up the details in the network structure, the DTNs were projected into two networks namely, drug similarity network (DSN) and target similarity network (TSN). In DSN, various classes of Food and Drug Administration-approved drugs with distinct therapeutic categories were linked together based on shared targets. Projected TSN also showed complexity because of promiscuity of the drugs. By including investigational drugs that are currently being tested in clinical trials, the networks manifested more connectivity and pictured the upcoming pharmacological space in the future years. Diverse biological processes and protein-protein interactions were manipulated by new drugs, which can extend possible target combinations. We conclude that network-based organization of DrugBank 4.0 data not only reveals the potential for repurposing of existing drugs, also allows generating novel predictions about drugs off-targets, drug-drug interactions and their side effects. Our results also encourage further effort for high-throughput identification of targets to build networks that can be integrated into disease networks.
Farnaz Barneh, Mohieddin Jafari, Mehdi Mirzaie
Briefings Bioinform.3
2015 Interlog protein network: an evolutionary benchmark of protein interaction networks for the evaluation of clustering algorithms
abstract
BACKGROUND: In the field of network science, exploring principal and crucial modules or communities is critical in the deduction of relationships and organization of complex networks. This approach expands an arena, and thus allows further study of biological functions in the field of network biology. As the clustering algorithms that are currently employed in finding modules have innate uncertainties, external and internal validations are necessary. METHODS: Sequence and network structure alignment, has been used to define the Interlog Protein Network (IPN). This network is an evolutionarily conserved network with communal nodes and less false-positive links. In the current study, the IPN is employed as an evolution-based benchmark in the validation of the module finding methods. The clustering results of five algorithms; Markov Clustering (MCL), Restricted Neighborhood Search Clustering (RNSC), Cartographic Representation (CR), Laplacian Dynamics (LD) and Genetic Algorithm; to find communities in Protein-Protein Interaction networks (GAPPI) are assessed by IPN in four distinct Protein-Protein Interaction Networks (PPINs). RESULTS: The MCL shows a more accurate algorithm based on this evolutionary benchmarking approach. Also, the biological relevance of proteins in the IPN modules generated by MCL is compatible with biological standard databases such as Gene Ontology, KEGG and Reactome. CONCLUSION: In this study, the IPN shows its potential for validation of clustering algorithms due to its biological logic and straightforward implementation.
Mohieddin Jafari, Mehdi Mirzaie, Mehdi Sadeghi
BMC Bioinform.2
2013 Ranked k-medoids: A fast and accurate rank-based partitioning algorithm for clustering large datasets
Seyed Mohammad RazaviZadegan, Mehdi Mirzaie, Farahnaz Sadoughi
Knowl. Based Syst.2