MFMohammad-Hadi Foroughmand-Araabi

Mohammad-Hadi Foroughmand-Araabi

*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


Mohammad-Hadi Foroughmand-Araabi has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Weighted Centroid Trees: A general approach for summarizing phylogenies in tumor mutation tree inference

    by Hamed Vasei, Mohammad Hadi Foroughmand Araabi, Amir Daneshgar

    Tumor mutation trees are the primary tools to model the evolution of cancer. Not only some tumor phylogeny inference methods may produce a set of trees having potential and parallel evolutionary histories, but also mutation trees from different patients may also exhibit similar evolutionary processes. When a set of correlated mutation trees is available, compressing the data into a single best-fit tree, exhibiting the shared evolutionary processes, is definitely of great importance and can be beneficial in many applications. In this study, we present a general setup to study and analyse the problem of finding a best-fit (centroid) tree to a given set of trees and we use our general setup to analyse mutation trees as our main motivation. For this let ε : ???? n → ℝ n × n be an embedding of labeled rooted trees into the space of real square matrices and also let L be a norm on this space. We introduce the nearest mapped tree problem as the problem of finding a closest tree to a given matrix A with respect to ε and L , i.e., a tree T * ( A ) for which L ( ε ( T * ( A )) − A ) is minimized. Within this setup, our potential candidates for the embedding are adjacency, ancestry , and distance matrices of trees, where we consider the cases of L 1 and L 2 norms in our analysis. We show that the function d( T 1 , T 2 ) = L ( ε ( T 1 ) − ε ( T 2 )) defines a family of dissimilarity measures, covering previously studied parent-child and ancestor-descendent metrics. Also, we show that the nearest mapped tree problem is polynomial-time solvable for the adjacency matrix embedding and is ???????? -hard for the ancestry and the distance embeddings. The weighted centroid tree problem for a given set of trees of size k is naturally defined as a nearest mapped tree solution to a weighted sum of the corresponding matrix set. In this article we consider uniform weighted-sums for which all weights are equal, where in particular, the (classical) centroid tree is defined to be a solution when all weights are chosen to be equal to 1 /k (i.e., the mean case). Similarly, the ω -weighted centroid tree is a solution when all weights are equal to ω/k . To show the generality of our setup, we prove that the solution-set of the centroid tree problem for the adjacency and the ancestry matrices are identical to the solution-set of the consensus tree problem for parent-child and ancestor-descendent distances already handled by the algorithms GraPhyC(2018) and TuELiP(2023), respectively. Next, to tackle this problem for some new cases, we provide integer linear programs to handle the nearest mapped tree problem for the ancestry and the distance embeddings, giving rise to solutions of the weighted centroid tree problem in these cases. To show the effectiveness of this approach, we provide an algorithm, WAncILP 2 , to solvethe 2-weighted centroid tree problem for the case of the ancestry matrix and we justify the importance of the weighted setup by showing the pioneering performance of WAncILP 2 both in a comprehensive simulation analysis as well as on a real breast cancer dataset, in which, by finding the centroids as representatives of data clusters, we provide supporting evidence for the fact that some common aspects of these centroids can be considered as suitable candidates for reliable evolutionary information in relation to the original data. metrics.

  • Open Access

    Distinct Dynamics of Migratory Response to PD-1 and CTLA-4 Blockade Reveals New Mechanistic Insights for Potential T-Cell Reinvigoration following Immune Checkpoint Blockade

    by Fateme Safaeifard, Bahram Goliaei, Amir R. Aref, Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Jochen Lorch, Russell W. Jenkins, David A. Barbie, Seyed Peyman Shariatpanahi, Curzio Rüegg

    Cytotoxic T-lymphocyte-associated antigen 4 (CTLA-4) and programmed cell death protein 1 (PD-1), two clinically relevant targets for the immunotherapy of cancer, are negative regulators of T-cell activation and migration. Optimizing the therapeutic response to CTLA-4 and PD-1 blockade calls for a more comprehensive insight into the coordinated function of these immune regulators. Mathematical modeling can be used to elucidate nonlinear tumor–immune interactions and highlight the underlying mechanisms to tackle the problem. Here, we investigated and statistically characterized the dynamics of T-cell migration as a measure of the functional response to these pathways. We used a previously developed three-dimensional organotypic culture of patient-derived tumor spheroids treated with anti-CTLA-4 and anti-PD-1 antibodies for this purpose. Experiment-based dynamical modeling revealed the delayed kinetics of PD-1 activation, which originates from the distinct characteristics of PD-1 and CTLA-4 regulation, and followed through with the modification of their contributions to immune modulation. The simulation results show good agreement with the tumor cell reduction and active immune cell count in each experiment. Our findings demonstrate that while PD-1 activation provokes a more exhaustive intracellular cascade within a mature tumor environment, the time-delayed kinetics of PD-1 activation outweighs its preeminence at the individual cell level and consequently confers a functional dominance to the CTLA-4 checkpoint. The proposed model explains the distinct immunostimulatory pattern of PD-1 and CTLA-4 blockade based on mechanisms involved in the regulation of their expression and may be useful for planning effective treatment schemes targeting PD-1 and CTLA-4 functions.


  • Open Access

    Scelestial: Fast and accurate single-cell lineage tree inference based on a Steiner tree approximation algorithm

    by Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Alice C. McHardy

    Single-cell genome sequencing provides a highly granular view of biological systems but is affected by high error rates, allelic amplification bias, and uneven genome coverage. This creates a need for data-specific computational methods, for purposes such as for cell lineage tree inference. The objective of cell lineage tree reconstruction is to infer the evolutionary process that generated a set of observed cell genomes. Lineage trees may enable a better understanding of tumor formation and growth, as well as of organ development for healthy body cells. We describe a method, Scelestial, for lineage tree reconstruction from single-cell data, which is based on an approximation algorithm for the Steiner tree problem and is a generalization of the neighbor-joining method. We adapt the algorithm to efficiently select a limited subset of potential sequences as internal nodes, in the presence of missing values, and to minimize cost by lineage tree-based missing value imputation. In a comparison against seven state-of-the-art single-cell lineage tree reconstruction algorithms—BitPhylogeny, OncoNEM, SCITE, SiFit, SASC, SCIPhI, and SiCloneFit—on simulated and real single-cell tumor samples, Scelestial performed best at reconstructing trees in terms of accuracy and run time. Scelestial has been implemented in C++. It is also available as an R package named RScelestial.


  • Open Access

    Mean Isoperimetry with Control on Outliers: Exact and Approximation Algorithms

    by Morteza Alimi, Amir Daneshgar, Mohammad-Hadi Foroughmand-Araabi

    Given a weighted graph $G=(V,E)$ with weight functions $c:E\to \mathbb{R}_+$ and $\pi:V\to \mathbb{R}_+$, and a subset $U\subseteq V$, the normalized cut value for $U$ is defined as the sum of the weights of edges exiting $U$ divided by the weight of vertices in $U$. The {\it mean isoperimetry problem}, $\mathsf{ISO}^1(G,k)$, for a weighted graph $G$ is a generalization of the classical uniform sparsest cut problem in which, given a parameter $k$, the objective is to find $k$ disjoint nonempty subsets of $V$ minimizing the average normalized cut value of the parts. The robust version of the problem seeks an optimizer where the number of vertices that fall out of the subpartition is bounded by some given integer $0 \leq \rho \leq |V|$. Our main result states that $\mathsf{ISO}^1(G,k)$, as well as its robust version, $\mathsf{CRISO}^1(G,k,\rho)$, subjected to the condition that each part of the subpartition induces a connected subgraph, are solvable in time $O(k^2 \rho^2\ \pi(V(T)^3)$ on any weighted tree $T$, in which $\pi(V(T))$ is the sum of the vertex-weights. This result implies that $\mathsf{ISO}^1(G,k)$ is strongly polynomial-time solvable on weighted trees when the vertex-weights are polynomially bounded and may be compared to the fact that the problem is NP-Hard for weighted trees in general. Also, using this, we show that both mentioned problems, $\mathsf{ISO}^1(G,k)$ and $\mathsf{CRISO}^1(G,k,\rho)$ as well as the ordinary robust mean isoperimetry problem $\mathsf{RISO}^1(G,k,\rho)$, admit polynomial-time $O(\log^{1.5}|V| \log\log |V|)$-approximation algorithms for weighted graphs with polynomially bounded weights, using the R{\"a}cke-Shah tree cut sparsifier.

  • A novel pattern matching algorithm for genomic patterns related to protein motifs

    by Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Bahram Goliaei

    Background: Patterns on proteins and genomic sequences are vastly analyzed, extracted and collected in databases. Although protein patterns originate from genomic coding regions, very few works have directly or indirectly dealt with coding region patterns induced from protein patterns. Results: In this paper, we have defined a new genomic pattern structure suitable for representing induced patterns from proteins. The provided pattern structure, which is called “Consecutive Positions Scoring Matrix (CPSSM)”, is a replacement for protein patterns and profiles in the genomic context. CPSSMs can be identified, discovered, and searched in genomes. Then, we have presented a novel pattern matching algorithm between the defined genomic pattern and genomic sequences based on dynamic programming. In addition, we have modified the provided algorithm to support intronic gaps and huge sequences. We have implemented and tested the provided algorithm on real data. The results on Saccharomyces cerevisiae’s genome show 132% more true positives and no false negatives and the results on human genome show no false negatives and 10 times as many true positives as those in previous works. Conclusion: CPSSM and provided methods could be used for open reading frame detection and gene finding. The application is available with source codes to run and download at http://app.foroughmand.ir/cpssm/ .

  • Open Access

    A Boolean network control algorithm guided by forward dynamic programming

    by Mohammad Moradi, Sama Goliaei, Mohammad-Hadi Foroughmand-Araabi

    Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state. Boolean networks are utilized as a mathematical model for gene regulatory networks. This paper provides an algorithm to solve the control problem in Boolean networks. The proposed algorithm is implemented and applied on two biological systems: T-cell receptor network and Drosophila melanogaster network. Results show that the proposed algorithm works faster in solving the control problem over these networks, while having similar accuracy, in comparison to previous exact methods. Source code and a simple web service of the proposed algorithm is available at http://goliaei.ir/net-control/www/.