SGSama Goliaei

Sama Goliaei

*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


Sama Goliaei has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • 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.


  • Embedding ranking-oriented recommender system graphs

    by Taher Hekmatfar, Saman Haratizadeh, Sama Goliaei


  • Open Access

    A Game-Theoretical Network Formation Model for C. elegans Neural Network

    by Mohamad Khajezade, Sama Goliaei, Hadi Veisi

    Studying and understanding human brain structures and functions have become one of the most challenging issues in neuroscience today. However, the mammalian nervous system is made up of hundreds of millions of neurons and billions of synapses. This complexity made it impossible to reconstruct such a huge nervous system in the laboratory. So, most researchers focus on C. elegans neural network. The C. elegans neural network is the only biological neural network that is fully mapped. This nervous system is the simplest neural network that exists. However, many fundamental behaviors like movement emerge from this basic network. These features made C. elegans a convenient case to study the nervous systems. Many studies try to propose a network formation model for C. elegans neural network. However, these studies could not meet all characteristics of C. elegans neural network, such as significant factors that play a role in the formation of C. elegans neural network. Thus, new models are needed to be proposed in order to explain all aspects of C. elegans neural network. In this paper, a new model based on game theory is proposed in order to understand the factors affecting the formation of nervous systems, which meet the C. elegans frontal neural network characteristics. In this model, neurons are considered to be agents. The strategy for each neuron includes either making or removing links to other neurons. After choosing the basic network, the utility function is built using structural and functional factors. In order to find the coefficients for each of these factors, linear programming is used. Finally, the output network is compared with C. elegans frontal neural network and previous models. The results implicate that the game-theoretical model proposed in this paper can better predict the influencing factors in the formation of C. elegans neural network compared to previous models.


  • 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/.


  • Open Access

    Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines

    by Florent Becker, Tom Besson, Jérôme Durand-Lose, Aurélien Emmanuel, Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Shahrzad Heydarshahi

    Signal machines form an abstract and idealised model of collision computing. Based on dimensionless signals moving on the real line, they model particle/signal dynamics in Cellular Automata. Each particle, or signal, moves at constant speed in continuous time and space. When signals meet, they get replaced by other signals. A signal machine defines the types of available signals, their speeds and the rules for replacement in collision. A signal machine A simulates another one B if all the space-time diagrams of B can be generated from space-time diagrams of A by removing some signals and renaming other signals according to local information. Given any finite set of speeds S, we construct a signal machine that is able to simulate any signal machine whose speeds belong to S. Each signal is simulated by a macro-signal, a ray of parallel signals. Each macro-signal has a main signal located exactly where the simulated signal would be, as well as auxiliary signals which encode its id and the collision rules of the simulated machine. The simulation of a collision, a macro-collision, consists of two phases. In the first phase, macro-signals are shrunk, then the macro-signals involved in the collision are identified and it is ensured that no other macro-signal comes too close. If some do, the process is aborted and the macro-signals are shrunk, so that the correct macro-collision will eventually be restarted and successfully initiated. Otherwise, the second phase starts: the appropriate collision rule is found and new macro-signals are generated accordingly. Considering all finite set of speeds S and their corresponding simulators provides an intrinsically universal family of signal machines.

  • Open Access

    CAMIRADA: Cancer microRNA association discovery algorithm, a case study on breast cancer

    by Sepideh Shamsizadeh, Sama Goliaei, Zahra Razaghi Moghadam

    In recent studies, non-coding protein RNAs have been identified as microRNA that can be used as biomarkers for early diagnosis and treatment of cancer, that decrease mortality in cancer. A microRNA may target hundreds or thousands of genes and a gene may regulate several microRNAs, so determining which microRNA is associated with which cancer is a big challenge. Many computational methods have been performed to detect micoRNAs association with cancer, but more effort is needed with higher accuracy. Increasing research has shown that relationship between microRNAs and TFs play a significant role in the diagnosis of cancer. Therefore, we developed a new computational framework (CAMIRADA) to identify cancer-related microRNAs based on the relationship between microRNAs and disease genes (DG) in the protein network, the functional relationships between microRNAs and Transcription Factors (TF) on the co-expression network, and the relationship between microRNAs and the Differential Expression Gene (DEG) on co-expression network. The CAMIRADA was applied to assess breast cancer data from two HMDD and miR2Disease databases. In this study, the AUC for the 65 microRNAs of the top of the list was 0.95, which was more accurate than the similar methods used to detect microRNAs associated with the cancer artery.

  • Open Access

    CAMIRADA: Cancer microRNA association discovery algorithm, a case study on breast cancer

    by Sepideh Shamsizadeha, Sama Goliaea, Zahra Razaghi Moghadamb

    In recent studies, non-coding protein RNAs have been identified as microRNA that can be used as biomarkers for early diagnosis and treatment of cancer, that decrease mortality in cancer. A microRNA may target hundreds or thousands of genes and a gene may regulate several microRNAs, so determining which microRNA is associated with which cancer is a big challenge. Many computational methods have been performed to detect micoRNAs association with cancer, but more effort is needed with higher accuracy. Increasing research has shown that relationship between microRNAs and TFs play a significant role in the diagnosis of cancer. Therefore, we developed a new computational framework (CAMIRADA) to identify cancer-related microRNA based on the relationship between microRNAs and disease genes (DG) in the protein network, the functional relationships between microRNAs and Transcription Factors (TF) on the co-expression network, and the relationship between microRNAs and the Differential Expression Gene (DEG) on co-expression network. The CAMIRADA was applied to assess breast cancer data from two HMDD and miR2Disease databases. In this study, the AUC for the 65 microRNA of the top of the list was 0.95, which was more accurate than the similar methods used to detect microRNA associated with the cancer artery.

  • Open Access

    An algorithm to simulate alternating Turing machine in signal machine

    by Dawood Hasanzadeh, Sama Goliaei

    Geometrical Computation as a new model of computation is the counterpart of Cellular Automata that has Turing computing ability. In this paper we provide an algorithm to simulate Alternating Turing Machine in the context of Signal Machine using techniques adopted from the features of Signal Machine to set up and manage the copies/branches of Alternating Turing Machine. We show that our algorithm can simulate Alternating Turing Machine in Signal Machine as same functionality as classic family of Turing Machines. Time complexity of the algorithm is linear as ordinary simulated Turing Machines. Depending on the computation tree space complexity is exponential order of d, where d is the depth of the computation tree.