Reza Hassanzadeh
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
Reza Hassanzadeh has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Changiz Eslahchi
School of Biological Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
6 shared publications - Mahnaz Habibi
Department of Mathematics, Qazvin Branch, Islamic Azad University, Qazvin, Iran
2 shared publications - Nika Abdollahi
School of Biological Sciences, Institute for Research in Fundamental Sciences (IPM), No. 70, Lavasani St., Tehran, 19538-33511, Iran
2 shared publications - Sofia Kossida
IMGT®, IGH, Univ Montpellier, CNRS, Montpellier, France
2 shared publications - Wing-Kin Sung
Department of Chemical Pathology, The Chinese University of Hong Kong , Shatin, N.T., Hong Kong SAR
2 shared publications - Araz Siabi-Garjan
Department of Engineering Sciences, Faculty of Advanced Technologies, University of Mohaghegh Ardabili, Namin, Iran
1 shared publication
Latest Publications
- Open Access
Ancestra: A lineage-explicit simulator for benchmarking B-cell receptor repertoire and lineage inference methods
A bstract: High-throughput B-cell receptor sequencing has transformed the analysis of adaptive immunity, but benchmarking clonal grouping and lineage reconstruction methods remains limited by the absence of datasets with known evolutionary histories. Here we present Ancestra, a lineage-explicit simulator of B-cell receptor heavy-chain affinity maturation. Ancestra models stochastic V(D)J recombination, context-dependent somatic hypermutation, affinity-based selection and clonal expansion while recording complete parent-child relationships and mutation events. The framework generates BCR heavy-chain sequence datasets together with their corresponding ground-truth lineage trees, enabling direct benchmarking of lineage-aware analytical methods. Across simulations, Ancestra recapitulates key properties of human repertoires, including complementarity-determining region 3 length distributions, amino-acid usage patterns, junctional mutation patterns consistent with IMGT criteria and heterogeneous branching topologies. Simulated lineages also reveal multi-label lineage trees, in which identical nucleotide sequences can arise independently along distinct evolutionary paths. Ancestra provides a practical foundation for rigorous benchmarking of lineage-aware immune repertoire analysis.
Open AccessAncestra: A lineage-explicit simulator for benchmarking B-cell receptor repertoire and lineage inference methods
A bstract: High-throughput B-cell receptor sequencing has transformed the analysis of adaptive immunity, but benchmarking clonal grouping and lineage reconstruction methods remains limited by the absence of datasets with known evolutionary histories. Here we present Ancestra, a lineage-explicit simulator of B-cell receptor heavy-chain affinity maturation. Ancestra models stochastic V(D)J recombination, context-dependent somatic hypermutation, affinity-based selection and clonal expansion while recording complete parent-child relationships and mutation events. The framework generates BCR heavy-chain sequence datasets together with their corresponding ground-truth lineage trees, enabling direct benchmarking of lineage-aware analytical methods. Across simulations, Ancestra recapitulates key properties of human repertoires, including complementarity-determining region 3 length distributions, amino-acid usage patterns, junctional mutation patterns consistent with IMGT criteria and heterogeneous branching topologies. Simulated lineages also reveal multi-label lineage trees, in which identical nucleotide sequences can arise independently along distinct evolutionary paths. Ancestra provides a practical foundation for rigorous benchmarking of lineage-aware immune repertoire analysis.
- Open Access
UnivAIRRse: A Unified Framework for Organizing and Comparing Adaptive Immune Receptor Repertoire Simulators
Adaptive immune receptor repertoire sequencing (AIRR-seq) enables large-scale profiling of B- and T-cell receptor diversity and has become a cornerstone of modern computational immunology. However, AIRR-seq provides only a partial and lossy molecular snapshot of immune dynamics, lacking explicit ground truth for clonal ancestry, lineage trajectories, antigen specificity, and longitudinal immune evolution. This limitation complicates benchmarking, method validation, and mechanistic interpretation of repertoire analysis pipelines. Here, we introduce UnivAIRRse, a unified hierarchical framework that organizes AIRR simulators within a shared conceptual coordinate system spanning five operational levels, from observed sequence data to the theoretical generative potential of the adaptive immune system. By explicitly distinguishing sequence-, clonal-, specificity-, repertoire-, and generative-level representations, UnivAIRRse enables systematic comparison of simulator assumptions, biological scope, abstraction level, and application focus. To our knowledge, this is the first review to formalize such a unified structure across biological, computational, and functional layers of AIRR simulation. Using this framework, we review how simulation supports benchmarking, strengthens computational inference, and enables multi-scale investigation of immune repertoire formation and evolution. We identify persistent limitations in existing simulators, including incomplete biological context, limited modularity, restricted interoperability, and overreliance on AIRR-seq as a molecular proxy for complex spatiotemporal immune processes. To operationalize this framework, we provide an interactive web-based AIRR Simulation Landscape Explorer (publicly available at https://www.imgt.org/AIRR-Simulator/ ) that enables dynamic filtering and comparison of simulators across biological scope, abstraction level, output fidelity, and application focus. Finally, we outline emerging directions toward digital-twin–ready immune simulation, emphasizing modular architectures, longitudinal multi-omic integration, uncertainty quantification, and dynamic model updating. By providing a coherent conceptual and operational coordinate system, UnivAIRRse establishes a foundation for reproducible, interpretable, and clinically actionable modeling of adaptive immune repertoires, bridging current simulation practices with the next generation of predictive and personalized immunological modeling. Abstract Figure:
Open AccessUnivAIRRse: A Unified Framework for Organizing and Comparing Adaptive Immune Receptor Repertoire Simulators
Adaptive immune receptor repertoire sequencing (AIRR-seq) enables large-scale profiling of B- and T-cell receptor diversity and has become a cornerstone of modern computational immunology. However, AIRR-seq provides only a partial and lossy molecular snapshot of immune dynamics, lacking explicit ground truth for clonal ancestry, lineage trajectories, antigen specificity, and longitudinal immune evolution. This limitation complicates benchmarking, method validation, and mechanistic interpretation of repertoire analysis pipelines. Here, we introduce UnivAIRRse, a unified hierarchical framework that organizes AIRR simulators within a shared conceptual coordinate system spanning five operational levels, from observed sequence data to the theoretical generative potential of the adaptive immune system. By explicitly distinguishing sequence-, clonal-, specificity-, repertoire-, and generative-level representations, UnivAIRRse enables systematic comparison of simulator assumptions, biological scope, abstraction level, and application focus. To our knowledge, this is the first review to formalize such a unified structure across biological, computational, and functional layers of AIRR simulation. Using this framework, we review how simulation supports benchmarking, strengthens computational inference, and enables multi-scale investigation of immune repertoire formation and evolution. We identify persistent limitations in existing simulators, including incomplete biological context, limited modularity, restricted interoperability, and overreliance on AIRR-seq as a molecular proxy for complex spatiotemporal immune processes. To operationalize this framework, we provide an interactive web-based AIRR Simulation Landscape Explorer (publicly available at https://www.imgt.org/AIRR-Simulator/ ) that enables dynamic filtering and comparison of simulators across biological scope, abstraction level, output fidelity, and application focus. Finally, we outline emerging directions toward digital-twin–ready immune simulation, emphasizing modular architectures, longitudinal multi-omic integration, uncertainty quantification, and dynamic model updating. By providing a coherent conceptual and operational coordinate system, UnivAIRRse establishes a foundation for reproducible, interpretable, and clinically actionable modeling of adaptive immune repertoires, bridging current simulation practices with the next generation of predictive and personalized immunological modeling. Abstract Figure:
- 17 October 2018
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 133 (10) , 419
A computational approach for engineering optical properties of multilayer thin films: Particle swarm optimization applied to Bruggeman homogenization formalism
- 17 October 2018
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 133 (10) , 419
A computational approach for engineering optical properties of multilayer thin films: Particle swarm optimization applied to Bruggeman homogenization formalism
- Open Access
- 13 August 2018
- Published by Springer Nature in Scientific Reports
- Vol. 8 (1) , 12006
PMLPR: A novel method for predicting subcellular localization based on recommender systems
The importance of protein subcellular localization problem is due to the importance of protein’s functions in different cell parts. Moreover, prediction of subcellular locations helps to identify the potential molecular targets for drugs and has an important role in genome annotation. Most of the existing prediction methods assign only one location for each protein. But, since some proteins move between different subcellular locations, they can have multiple locations. In recent years, some multiple location predictors have been introduced. However, their performances are not accurate enough and there is much room for improvement. In this paper, we introduced a method, PMLPR, to predict locations for a protein. PMLPR predicts a list of locations for each protein based on recommender systems and it can properly overcome the multiple location prediction problem. For evaluating the performance of PMLPR, we considered six datasets RAT, FLY, HUMAN, Du et al., DBMLoc and Höglund. The performance of this algorithm is compared with six state-of-the-art algorithms, YLoc, WOLF-PSORT, prediction channel, MDLoc, Du et al. and MultiLoc2-HighRes. The results indicate that our proposed method is significantly superior on RAT and Fly proteins, and decent on HUMAN proteins. Moreover, on the datasets introduced by Du et al., DBMLoc and Höglund, PMLPR has comparable results. For the case study, we applied the algorithms on 8 proteins which are important in cancer research. The results of comparison with other methods indicate the efficiency of PMLPR.
- 13 August 2018
- Published by Springer Nature in Scientific Reports
- Vol. 8 (1) , 12006
Open AccessPMLPR: A novel method for predicting subcellular localization based on recommender systems
The importance of protein subcellular localization problem is due to the importance of protein’s functions in different cell parts. Moreover, prediction of subcellular locations helps to identify the potential molecular targets for drugs and has an important role in genome annotation. Most of the existing prediction methods assign only one location for each protein. But, since some proteins move between different subcellular locations, they can have multiple locations. In recent years, some multiple location predictors have been introduced. However, their performances are not accurate enough and there is much room for improvement. In this paper, we introduced a method, PMLPR, to predict locations for a protein. PMLPR predicts a list of locations for each protein based on recommender systems and it can properly overcome the multiple location prediction problem. For evaluating the performance of PMLPR, we considered six datasets RAT, FLY, HUMAN, Du et al., DBMLoc and Höglund. The performance of this algorithm is compared with six state-of-the-art algorithms, YLoc, WOLF-PSORT, prediction channel, MDLoc, Du et al. and MultiLoc2-HighRes. The results indicate that our proposed method is significantly superior on RAT and Fly proteins, and decent on HUMAN proteins. Moreover, on the datasets introduced by Du et al., DBMLoc and Höglund, PMLPR has comparable results. For the case study, we applied the algorithms on 8 proteins which are important in cancer research. The results of comparison with other methods indicate the efficiency of PMLPR.
- Open Access
- 31 July 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (7) , e103622
Do Triplets Have Enough Information to Construct the Multi-Labeled Phylogenetic Tree?
The evolutionary history of certain species such as polyploids are modeled by a generalization of phylogenetic trees called multi-labeled phylogenetic trees, or MUL trees for short. One problem that relates to inferring a MUL tree is how to construct the smallest possible MUL tree that is consistent with a given set of rooted triplets, or SMRT problem for short. This problem is NP-hard. There is one algorithm for the SMRT problem which is exact and runs in time, where is the number of taxa. In this paper, we show that the SMRT does not seem to be an appropriate solution from the biological point of view. Indeed, we present a heuristic algorithm named MTRT for this problem and execute it on some real and simulated datasets. The results of MTRT show that triplets alone cannot provide enough information to infer the true MUL tree. So, it is inappropriate to infer a MUL tree using triplet information alone and considering the minimum number of duplications. Finally, we introduce some new problems which are more suitable from the biological point of view.
- 31 July 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (7) , e103622
Open AccessDo Triplets Have Enough Information to Construct the Multi-Labeled Phylogenetic Tree?
The evolutionary history of certain species such as polyploids are modeled by a generalization of phylogenetic trees called multi-labeled phylogenetic trees, or MUL trees for short. One problem that relates to inferring a MUL tree is how to construct the smallest possible MUL tree that is consistent with a given set of rooted triplets, or SMRT problem for short. This problem is NP-hard. There is one algorithm for the SMRT problem which is exact and runs in time, where is the number of taxa. In this paper, we show that the SMRT does not seem to be an appropriate solution from the biological point of view. Indeed, we present a heuristic algorithm named MTRT for this problem and execute it on some real and simulated datasets. The results of MTRT show that triplets alone cannot provide enough information to infer the true MUL tree. So, it is inappropriate to infer a MUL tree using triplet information alone and considering the minimum number of duplications. Finally, we introduce some new problems which are more suitable from the biological point of view.
- 1 June 2012
- Published by Elsevier in Molecular Phylogenetics and Evolution
- Vol. 63 (3) , 738-744
Constructing phylogenetic supernetworks based on simulated annealing
- 1 June 2012
- Published by Elsevier in Molecular Phylogenetics and Evolution
- Vol. 63 (3) , 738-744
Constructing phylogenetic supernetworks based on simulated annealing
- 1 February 2012
- Published by Elsevier in Mathematical Biosciences
- Vol. 235 (2) , 123-127
Constructing circular phylogenetic networks from weighted quartets using simulated annealing
- 1 February 2012
- Published by Elsevier in Mathematical Biosciences
- Vol. 235 (2) , 123-127
Constructing circular phylogenetic networks from weighted quartets using simulated annealing
- Open Access
- 1 January 2010
- Published by Springer Nature in BMC Ecology and Evolution
- Vol. 10 (1) , 254
MC-Net: a method for the construction of phylogenetic networks based on the Monte-Carlo method
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.
- 1 January 2010
- Published by Springer Nature in BMC Ecology and Evolution
- Vol. 10 (1) , 254
Open AccessMC-Net: a method for the construction of phylogenetic networks based on the Monte-Carlo method
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.