Shahin Mohammadi

Shahin Mohammadi

Auto-generated profile, based on publicly available information

Shahin Mohammadi

MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA 02139, USA; Broad Institute of MIT and Harvard, Cambridge, MA 02142, USA

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 July 2020 in Neuron
Verified
Journal Article
Closed access
HLHyeseung Lee
Hyeseung Lee
RFRobert J. Fenster
Robert J. Fenster
SPS. Sebastian Pineda
S. Sebastian Pineda
WGWhitney S. Gibbs
Whitney S. Gibbs
SMShahin Mohammadi
Shahin Mohammadi
MHMyriam Heiman
Myriam Heiman

4 October 2009 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
ZKZahra Razaghi Moghadam Kashani
Zahra Razaghi Moghadam Kashani
HAHayedeh Ahrabian
Hayedeh Ahrabian
EEElahe Elahi
Elahe Elahi
ANAbbas Nowzari-Dalini
Abbas Nowzari-Dalini
EAElnaz Saberi Ansari
Elnaz Saberi Ansari
AMAli Masoudi-Nejad
Ali Masoudi-Nejad
Background: Complex networks are studied across many fields of science and are particularly important to understand biological processes. Motifs in networks are small connected sub-graphs that occur significantly in higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Existing algorithms for finding network motifs are extremely costly in CPU time and memory consumption and have practically restrictions on the size of motifs. Results: We present a new algorithm (Kavosh), for finding k-size network motifs with less memory and CPU time in comparison to other existing algorithms. Our algorithm is based on counting all k-size sub-graphs of a given graph (directed or undirected). We evaluated our algorithm on biological networks of E. coli and S. cereviciae, and also on non-biological networks: a social and an electronic network. Conclusion: The efficiency of our algorithm is demonstrated by comparing the obtained results with three well-known motif finding tools. For comparison, the CPU time, memory usage and the similarities of obtained motifs are considered. Besides, Kavosh can be employed for finding motifs of size greater than eight, while most of the other algorithms have restriction on motifs with size greater than eight. The Kavosh source code and help files are freely available at: http://Lbb.ut.ac.ir/Download/LBBsoft/Kavosh/.

24 May 2024 in Science
Verified
Journal Article
Closed access
WRW Brad Ruzicka
W Brad Ruzicka
SMShahin Mohammadi
Shahin Mohammadi
JFJohn F Fullard
John F Fullard
JDJose Davila-Velderrain
Jose Davila-Velderrain
SSSivan Subburaju
Sivan Subburaju
PCPsychENCODE Consortium
PsychENCODE Consortium
The complexity and heterogeneity of schizophrenia have hindered mechanistic elucidation and the development of more effective therapies. Here, we performed single-cell dissection of schizophrenia-associated transcriptomic changes in the human prefrontal cortex across 140 individuals in two independent cohorts. Excitatory neurons were the most affected cell group, with transcriptional changes converging on neurodevelopment and synapse-related molecular pathways. Transcriptional alterations included known genetic risk factors, suggesting convergence of rare and common genomic variants on neuronal population-specific alterations in schizophrenia. Based on the magnitude of schizophrenia-associated transcriptional change, we identified two populations of individuals with schizophrenia marked by expression of specific excitatory and inhibitory neuronal cell states. This single-cell atlas links transcriptomic changes to etiological genetic risk factors, contextualizing established knowledge within the human cortical cytoarchitecture and facilitating mechanistic understanding of schizophrenia pathophysiology and heterogeneity.

1 December 2019 in Cell Systems
Verified
Journal Article
Open access
SMShahin Mohammadi
Shahin Mohammadi
JDJose Davila-Velderrain
Jose Davila-Velderrain
MKManolis Kellis
Manolis Kellis
The human interactome is instrumental in the systems-level study of the cell and the contextualization of disease-associated gene perturbations. However, reference organismal interactomes do not capture the cell-type-specific context in which proteins and modules preferentially act. Here, we introduce SCINET, a computational framework that reconstructs an ensemble of cell-type-specific interactomes by integrating a global, context-independent reference interactome with a single-cell gene-expression profile. SCINET addresses technical challenges of single-cell data by robustly imputing, transforming, and normalizing the initially noisy and sparse expression of data. Inferred cell-level gene interaction probabilities and group-level interaction strengths define cell-type-specific interactomes. We use SCINET to reconstruct and analyze interactomes of the major human brain and immune cell types, revealing specificity and modularity of perturbations associated with neurodegenerative, neuropsychiatric, and autoimmune disorders. We report cell-type interactomes for brain and immune cell types, together with the SCINET package.

29 December 2015 in BMC Systems Biology
Verified
Journal Article
Open access
PDF file
SMShahin Mohammadi
Shahin Mohammadi
BSBaharak Saberidokht
Baharak Saberidokht
SSShankar Subramaniam
Shankar Subramaniam
AGAnanth Grama
Ananth Grama
Budding yeast, S. cerevisiae, has been used extensively as a model organism for studying cellular processes in evolutionarily distant species, including humans. However, different human tissues, while inheriting a similar genetic code, exhibit distinct anatomical and physiological properties. Specific biochemical processes and associated biomolecules that differentiate various tissues are not completely understood, neither is the extent to which a unicellular organism, such as yeast, can be used to model these processes within each tissue. We present a novel framework to systematically quantify the suitability of yeast as a model organism for different human tissues. To this end, we develop a computational method for dissecting the global human interactome into tissue-specific cellular networks. By individually aligning these networks with the yeast interactome, we simultaneously partition the functional space of human genes, and their corresponding pathways, based on their conservation both across species and among different tissues. Finally, we couple our framework with a novel statistical model to assess the conservation of tissue-specific pathways and infer the overall similarity of each tissue with yeast. We further study each of these subspaces in detail, and shed light on their unique biological roles in the human tissues. Our framework provides a novel tool that can be used to assess the suitability of the yeast model for studying tissue-specific physiology and pathophysiology in humans. Many complex disorders are driven by a coupling of housekeeping (universally expressed in all tissues) and tissue-selective (expressed only in specific tissues) dysregulated pathways. While tissue-selective genes are significantly associated with the onset and development of a number of tissue-specific pathologies, we show that the human-specific subset has even higher association. Consequently, they provide excellent candidates as drug targets for therapeutic interventions.

4 August 2011 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
GKGiorgos Kollias
Giorgos Kollias
SMShahin Mohammadi
Shahin Mohammadi
AGAnanth Grama
Ananth Grama
As graph-structured data sets become commonplace, there is increasing need for efficient ways of analyzing such data sets. These analyses include conservation, alignment, differentiation, and discrimination, among others. When defined on general graphs, these problems are considerably harder than their well-studied counterparts on sets and sequences. In this paper, we study the problem of global alignment of large sparse graphs. Specifically, we investigate efficient methods for computing approximations to the state-of-the-art IsoRank solution for finding pairwise topological similarity between nodes in two networks (or within the same network). Pairs of nodes with high similarity can be used to seed global alignments. We present a novel approach to this computationally expensive problem based on uncoupling and decomposing ranking calculations associated with the computation of similarity scores. Uncoupling refers to independent preprocessing of each input graph. Decomposition implies that pairwise similarity scores can be explicitly broken down into contributions from different link patterns traced back to a low-rank approximation of the initial conditions for the computation. These two concepts result in significant improvements, in terms of computational cost, interpretability of similarity scores, and nature of supported queries. We show over two orders of magnitude improvement in performance over IsoRank/Random Walk formulations, and over an order of magnitude improvement over constrained matrix-triple-product formulations, in the context of real data sets.