Sina Majidian
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
Research Subjects
Sina Majidian has a total of 259 co-authors. Here are the top co-authors by number of shared publications:
- Christophe Dessimoz
Department of Computational Biology, University of Lausanne, Lausanne, Switzerland
9 shared publications - Fritz Joachim Sedlazeck
Baylor College of Medicine
9 shared publications - Adrian M. Altenhoff
SIB Swiss Institute of Bioinformatics, Lausanne, Switzerland
7 shared publications - Mohammad Hossein Kahaei
School of Electrical Engineering Iran University of Science and Technology Tehran Iran
6 shared publications - Natasha M. Glover
SIB Swiss Institute of Bioinformatics, Lausanne, Switzerland
6 shared publications - Ben Langmead
Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA
5 shared publications
Latest Publications
- Open Access
Metabolic transitions reprogram translation through sequence-dependent regulation
Cells suppress protein synthesis during starvation, but how translation recovers upon nutrient repletion remains poorly understood. To address this gap, we followed translational recovery in budding yeast after repletion of glucose, nitrogen, or phosphate, combining time-resolved metabolomics, structural proteomics, transcriptomics, and spike-in-calibrated ribosome profiling. Nutrient addition rapidly altered ribosome occupancy in distinct, transcript-specific programs. To identify their sequence determinants, we developed RiboNet, a deep learning framework that predicts ribosome load and positions along transcripts from mRNA sequence. RiboNet-guided in silico mutagenesis revealed reduced pausing at serine codons upon glucose repletion and transiently increased pausing at leucine codons following nitrogen repletion. These responses coincided with altered cognate tRNA charging and metabolite-associated structural changes in aminoacyl-tRNA synthetases. RiboNet also identified a conserved 5′ UTR motif, GAUY, that increased reporter protein output following glucose repletion. Our findings reveal how metabolic state alters the contributions of mRNA sequence features to translation initiation and elongation.
Open AccessMetabolic transitions reprogram translation through sequence-dependent regulation
Cells suppress protein synthesis during starvation, but how translation recovers upon nutrient repletion remains poorly understood. To address this gap, we followed translational recovery in budding yeast after repletion of glucose, nitrogen, or phosphate, combining time-resolved metabolomics, structural proteomics, transcriptomics, and spike-in-calibrated ribosome profiling. Nutrient addition rapidly altered ribosome occupancy in distinct, transcript-specific programs. To identify their sequence determinants, we developed RiboNet, a deep learning framework that predicts ribosome load and positions along transcripts from mRNA sequence. RiboNet-guided in silico mutagenesis revealed reduced pausing at serine codons upon glucose repletion and transiently increased pausing at leucine codons following nitrogen repletion. These responses coincided with altered cognate tRNA charging and metabolite-associated structural changes in aminoacyl-tRNA synthetases. RiboNet also identified a conserved 5′ UTR motif, GAUY, that increased reporter protein output following glucose repletion. Our findings reveal how metabolic state alters the contributions of mRNA sequence features to translation initiation and elongation.
- Open Access
Rapid phylogenomic analysis for viral surveillance and metagenomic profiling with Omni2Tree
Phylogenomic surveillance is limited not by sequencing throughput, but by the difficulty of converting heterogeneous raw data into reliable evolutionary inference, particularly for low-titer and contaminated viral field samples. Here we present Omni2Tree, an assembly-free framework that reconstructs viral phylogenies directly from raw sequencing reads and generates easily shareable interactive reports and genome-wide entropy profiles to identify diversification. In H5N1 benchmark analyses, Omni2Tree maintained accurate placement and topological stability even under low coverage, unlike assembly or reference based methods. Omni2Tree generated an annotated phylogeny for 64-sample H5N1 field surveillance dataset from the eastern USA in under 3 hours. Omni2Tree recovered known phylogenetic structure and key variability insights across 1,328 hepatitis C virus and 707 human cytomegalovirus datasets, and resolved co-infecting respiratory viruses in clinical metagenomic samples. By enabling direct analysis from raw reads, Omni2Tree supports faster, more portable, and more decentralized phylogenomic surveillance across outbreak, clinical, and resource-limited settings.
Open AccessRapid phylogenomic analysis for viral surveillance and metagenomic profiling with Omni2Tree
Phylogenomic surveillance is limited not by sequencing throughput, but by the difficulty of converting heterogeneous raw data into reliable evolutionary inference, particularly for low-titer and contaminated viral field samples. Here we present Omni2Tree, an assembly-free framework that reconstructs viral phylogenies directly from raw sequencing reads and generates easily shareable interactive reports and genome-wide entropy profiles to identify diversification. In H5N1 benchmark analyses, Omni2Tree maintained accurate placement and topological stability even under low coverage, unlike assembly or reference based methods. Omni2Tree generated an annotated phylogeny for 64-sample H5N1 field surveillance dataset from the eastern USA in under 3 hours. Omni2Tree recovered known phylogenetic structure and key variability insights across 1,328 hepatitis C virus and 707 human cytomegalovirus datasets, and resolved co-infecting respiratory viruses in clinical metagenomic samples. By enabling direct analysis from raw reads, Omni2Tree supports faster, more portable, and more decentralized phylogenomic surveillance across outbreak, clinical, and resource-limited settings.
- Open Access
- 5 March 2026
- Published by Cold Spring Harbor Laboratory in Genome Research
- Vol. 36 (4) , 740-753
Minimizing reference bias with an imputed personalized reference
Pangenome indexes reduce reference bias in sequencing data analysis. However, bias can be reduced further by using a personalized reference, for example, a diploid human reference constructed to match a donor individual's alleles. Here, we present a new impute-first alignment framework that combines elements of genotype imputation and read alignment. We first genotype the individual using a subsample of the input reads. Using a reference panel and an efficient imputation algorithm, we impute a personalized diploid reference. Finally, we index the personalized reference and apply a read aligner (either linear or graph) to align the full read set to the personalized reference. On the HG002 sample, this framework achieves a higher variant-calling F1-score (99.77%) compared with the traditional linear aligner (99.62%), graph pangenome aligner (99.72%), and graph personalized-pangenome aligner (99.75%), with substantial reduction in the number of errors (38.73% vs. a linear aligner, 14.97% vs. a graph aligner, and 6.05% vs. a personalized graph). An imputed reference can have comparable efficiency to a pangenome reference, making it an overall advantageous choice for whole-genome DNA sequencing experiments. Advantages of our impute-first approach include that (1) it fully considers linkage disequilibrium and produces a phased diploid reference as an output; (2) it produces accurate personalized references even from low-coverage data; and (3) it is compatible with both graph and linear reference representations, achieving its highest variant-calling F1 accuracy using a standard linear aligner (BWA-MEM).
- 5 March 2026
- Published by Cold Spring Harbor Laboratory in Genome Research
- Vol. 36 (4) , 740-753
Open AccessMinimizing reference bias with an imputed personalized reference
Pangenome indexes reduce reference bias in sequencing data analysis. However, bias can be reduced further by using a personalized reference, for example, a diploid human reference constructed to match a donor individual's alleles. Here, we present a new impute-first alignment framework that combines elements of genotype imputation and read alignment. We first genotype the individual using a subsample of the input reads. Using a reference panel and an efficient imputation algorithm, we impute a personalized diploid reference. Finally, we index the personalized reference and apply a read aligner (either linear or graph) to align the full read set to the personalized reference. On the HG002 sample, this framework achieves a higher variant-calling F1-score (99.77%) compared with the traditional linear aligner (99.62%), graph pangenome aligner (99.72%), and graph personalized-pangenome aligner (99.75%), with substantial reduction in the number of errors (38.73% vs. a linear aligner, 14.97% vs. a graph aligner, and 6.05% vs. a personalized graph). An imputed reference can have comparable efficiency to a pangenome reference, making it an overall advantageous choice for whole-genome DNA sequencing experiments. Advantages of our impute-first approach include that (1) it fully considers linkage disequilibrium and produces a phased diploid reference as an output; (2) it produces accurate personalized references even from low-coverage data; and (3) it is compatible with both graph and linear reference representations, achieving its highest variant-calling F1 accuracy using a standard linear aligner (BWA-MEM).
- Open Access
- 27 December 2025
- Published by Springer Nature in Journal of Molecular Evolution
- Vol. 94 (1) , 275-278
Correction: Reconstructing Evolutionary Histories with Hierarchical Orthologous Groups
- 27 December 2025
- Published by Springer Nature in Journal of Molecular Evolution
- Vol. 94 (1) , 275-278
Open AccessCorrection: Reconstructing Evolutionary Histories with Hierarchical Orthologous Groups
- Open Access
- 21 November 2025
- Published by Springer Nature in Journal of Molecular Evolution
- Vol. 93 (6) , 740-764
Reconstructing Evolutionary Histories with Hierarchical Orthologous Groups
With the rapid advancement of large-scale sequencing initiatives, the need for efficient and accurate methods for inferring orthologous and paralogous relationships has never been more critical. Hierarchical orthologous groups (HOGs) provide a powerful solution to this challenge, offering a precise, scalable framework to study gene families and their evolutionary histories across diverse species. In this review, we introduce the concept of HOGs and explore their advantages over traditional methods. Next, we highlight key applications of HOGs, including their use in representing gene families, inferring ancestral genomes, tracking gene gain and loss events, functional annotation, and phylogenetic profiling. We overview the process of constructing HOGs and discuss the challenges and limitations of HOG inference. The HOG framework provides a clear and structured approach to organizing homologous genes, making it possible to gain deeper insights into gene family and species evolution.
- 21 November 2025
- Published by Springer Nature in Journal of Molecular Evolution
- Vol. 93 (6) , 740-764
Open AccessReconstructing Evolutionary Histories with Hierarchical Orthologous Groups
With the rapid advancement of large-scale sequencing initiatives, the need for efficient and accurate methods for inferring orthologous and paralogous relationships has never been more critical. Hierarchical orthologous groups (HOGs) provide a powerful solution to this challenge, offering a precise, scalable framework to study gene families and their evolutionary histories across diverse species. In this review, we introduce the concept of HOGs and explore their advantages over traditional methods. Next, we highlight key applications of HOGs, including their use in representing gene families, inferring ancestral genomes, tracking gene gain and loss events, functional annotation, and phylogenetic profiling. We overview the process of constructing HOGs and discuss the challenges and limitations of HOG inference. The HOG framework provides a clear and structured approach to organizing homologous genes, making it possible to gain deeper insights into gene family and species evolution.
- Open Access
- 7 November 2025
- Published by F1000 Research Ltd in F1000Research
- Vol. 14, 1231
Sixth Annual BCM Hackathon on Structural Variation and Pangenomics
Background Structural variants (SVs) and metagenomics remain challenging areas in genomics, requiring new tools and collaborative solutions. Hackathons provide a rapid, team-based approach to prototyping and innovation. Methods In August 2024, 48 scientists from six continents convened at Baylor College of Medicine for the Sixth Structural Variant Codeathon. Participants worked in interdisciplinary teams over three days, using public datasets and cloud-based infrastructure to design and implement computational tools. Results Eight projects were developed, addressing topics such as tandem repeat annotation, structural variant discovery, benchmarking, pangenome visualization, and machine learning applications. Each project produced open-source software, with repositories openly available on GitHub and archived on Zenodo. Conclusions The hackathon fostered global collaboration and generated reproducible, community-driven tools. These outputs provide new resources for structural variation and metagenomics research and demonstrate the effectiveness of hackathons in advancing genomic science.
- 7 November 2025
- Published by F1000 Research Ltd in F1000Research
- Vol. 14, 1231
Open AccessSixth Annual BCM Hackathon on Structural Variation and Pangenomics
Background Structural variants (SVs) and metagenomics remain challenging areas in genomics, requiring new tools and collaborative solutions. Hackathons provide a rapid, team-based approach to prototyping and innovation. Methods In August 2024, 48 scientists from six continents convened at Baylor College of Medicine for the Sixth Structural Variant Codeathon. Participants worked in interdisciplinary teams over three days, using public datasets and cloud-based infrastructure to design and implement computational tools. Results Eight projects were developed, addressing topics such as tandem repeat annotation, structural variant discovery, benchmarking, pangenome visualization, and machine learning applications. Each project produced open-source software, with repositories openly available on GitHub and archived on Zenodo. Conclusions The hackathon fostered global collaboration and generated reproducible, community-driven tools. These outputs provide new resources for structural variation and metagenomics research and demonstrate the effectiveness of hackathons in advancing genomic science.
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- Vol. 2025, 1-10
Movi Color: fast and accurate taxonomic classification with the move structure
The number of reference genomes is rapidly increasing, thanks to advances in long-read sequencing and assembly. While these collections can improve the sensitivity and specificity of classification methods, they require highly efficient compressed indexes. K-mer-based approaches like Kraken 2 are efficient but limit the analysis to a fixed k-mer length. This is hard for the user to set ahead of time, and suboptimal settings can harm sensitivity and specificity. Methods that use compressed full-text indexes like SPUMONI2 and Cliffy lift this constraint, but are less efficient than k-mer-based tools. Further, these methods either cannot report a full listing of genomes where a match occurs, or cannot scale to large reference databases.
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- Vol. 2025, 1-10
Open AccessMovi Color: fast and accurate taxonomic classification with the move structure
The number of reference genomes is rapidly increasing, thanks to advances in long-read sequencing and assembly. While these collections can improve the sensitivity and specificity of classification methods, they require highly efficient compressed indexes. K-mer-based approaches like Kraken 2 are efficient but limit the analysis to a fixed k-mer length. This is hard for the user to set ahead of time, and suboptimal settings can harm sensitivity and specificity. Methods that use compressed full-text indexes like SPUMONI2 and Cliffy lift this constraint, but are less efficient than k-mer-based tools. Further, these methods either cannot report a full listing of genomes where a match occurs, or cannot scale to large reference databases.
- 26 September 2025
- Published by Springer Nature in Journal of Molecular Evolution
- Vol. 93 (6) , 800-805
OrthoXML-Tools: A Toolkit for Manipulating OrthoXML Files for Orthology Data
The OrthoXML file is a standard file format for orthology data. It provides a standardized structure for describing orthologous and paralogous relationships while allowing the user to store custom and database-specific data in the same format. Although many orthology databases use it as a way to export data, there is no comprehensive toolkit for working with this format. Here, we introduce the OrthoXML-tools (https://github.com/DessimozLab/orthoxml-tools), a comprehensive toolkit for loading, manipulating, and exporting the OrthoXML files to other formats. We show its capabilities and performance on our benchmarks.
- 26 September 2025
- Published by Springer Nature in Journal of Molecular Evolution
- Vol. 93 (6) , 800-805
OrthoXML-Tools: A Toolkit for Manipulating OrthoXML Files for Orthology Data
The OrthoXML file is a standard file format for orthology data. It provides a standardized structure for describing orthologous and paralogous relationships while allowing the user to store custom and database-specific data in the same format. Although many orthology databases use it as a way to export data, there is no comprehensive toolkit for working with this format. Here, we introduce the OrthoXML-tools (https://github.com/DessimozLab/orthoxml-tools), a comprehensive toolkit for loading, manipulating, and exporting the OrthoXML files to other formats. We show its capabilities and performance on our benchmarks.
- Open Access
Movi Color: fast and accurate long-read classification with the move structure
The number of reference genomes is rapidly increasing, thanks to advances in long-read sequencing and assembly. While these collections can improve the sensitivity and specificity of classification methods, this requires highly efficient compressed indexes. K-mer-based approaches like Kraken 2 are efficient but limit the analysis to a fixed k-mer length. This is hard for the user to set ahead of time, and suboptimal settings can harm sensitivity and specificity. Methods that use compressed full-text indexes like SPUMONI2 and Cliffy lift this constraint, but are less efficient than k-mer-based tools. Further, these methods either cannot report a full listing of genomes where a match occurs, or cannot scale to large reference databases. We propose new methods and algorithms that use compressed full-text indexes to enable multi-class and taxonomic classification. Unlike past compressed-indexing methods for classification, ours uses the move structure, which is extremely fast thanks to its locality of reference. Our method, called Movi Color, augments the main table of the Movi index. Specifically, Movi Color assigns a “color” to each run of the Burrows-Wheeler Transform according to the subset of genomes from which the run suffixes originated. When the reference is highly repetitive – as is typical when indexing pangenomes or reference databases – only certain colors occur, creating opportunities to compress the index. For species-level classification, Movi Color achieves over 1.6 × higher precision and 2 × higher recall than Kraken 2 and Metabuli. At the genus level, it achieves 70% higher precision and 80% higher recall. Movi Color’s read processing time is 7-20× faster than Metabuli and is a comparable to Kraken 2. Although Movi Color uses more memory than both Kraken 2 and Metabuli, its speed-accuracy trade-off makes it well-suited for real-time or high-throughput scenarios.
Open AccessMovi Color: fast and accurate long-read classification with the move structure
The number of reference genomes is rapidly increasing, thanks to advances in long-read sequencing and assembly. While these collections can improve the sensitivity and specificity of classification methods, this requires highly efficient compressed indexes. K-mer-based approaches like Kraken 2 are efficient but limit the analysis to a fixed k-mer length. This is hard for the user to set ahead of time, and suboptimal settings can harm sensitivity and specificity. Methods that use compressed full-text indexes like SPUMONI2 and Cliffy lift this constraint, but are less efficient than k-mer-based tools. Further, these methods either cannot report a full listing of genomes where a match occurs, or cannot scale to large reference databases. We propose new methods and algorithms that use compressed full-text indexes to enable multi-class and taxonomic classification. Unlike past compressed-indexing methods for classification, ours uses the move structure, which is extremely fast thanks to its locality of reference. Our method, called Movi Color, augments the main table of the Movi index. Specifically, Movi Color assigns a “color” to each run of the Burrows-Wheeler Transform according to the subset of genomes from which the run suffixes originated. When the reference is highly repetitive – as is typical when indexing pangenomes or reference databases – only certain colors occur, creating opportunities to compress the index. For species-level classification, Movi Color achieves over 1.6 × higher precision and 2 × higher recall than Kraken 2 and Metabuli. At the genus level, it achieves 70% higher precision and 80% higher recall. Movi Color’s read processing time is 7-20× faster than Metabuli and is a comparable to Kraken 2. Although Movi Color uses more memory than both Kraken 2 and Metabuli, its speed-accuracy trade-off makes it well-suited for real-time or high-throughput scenarios.
- Open Access
- 1 May 2025
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (3)
EvANI benchmarking workflow for evolutionary distance estimation
Advances in long-read sequencing technology have led to a rapid increase in high-quality genome assemblies. These make it possible to compare genome sequences across the Tree of Life, deepening our understanding of evolutionary relationships. Average nucleotide identity (ANI) is a metric for estimating the genetic similarity between two genomes, usually calculated as the mean identity of their shared genomic regions. These regions are typically found with genome aligners like Basic Local Alignment Search Tool BLAST or MUMmer. ANI has been applied to species delineation, building guide trees, and searching large sequence databases. Since computing ANI via genome alignment is computationally expensive, the field has increasingly turned to sketch-based approaches that use assumptions and heuristics to speed this up. We propose a suite of simulated and real benchmark datasets, together with a rank-correlation-based metric, to study how these assumptions and heuristics impact distance estimates. We call this evaluation framework EvANI. With EvANI, we show that ANIb is the ANI estimation algorithm that best captures tree distance, though it is also the least efficient. We show that k-mer-based approaches are extremely efficient and have consistently strong accuracy. We also show that some clades have inter-sequence distances that are best computed using multiple values of $k$, e.g. $k=10$ and $k=19$ for Chlamydiales. Finally, we highlight that approaches based on maximal exact matches may represent an advantageous compromise, achieving an intermediate level of computational efficiency while avoiding over-reliance on a single fixed k-mer length.- 1 May 2025
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (3)
Open AccessEvANI benchmarking workflow for evolutionary distance estimation
Advances in long-read sequencing technology have led to a rapid increase in high-quality genome assemblies. These make it possible to compare genome sequences across the Tree of Life, deepening our understanding of evolutionary relationships. Average nucleotide identity (ANI) is a metric for estimating the genetic similarity between two genomes, usually calculated as the mean identity of their shared genomic regions. These regions are typically found with genome aligners like Basic Local Alignment Search Tool BLAST or MUMmer. ANI has been applied to species delineation, building guide trees, and searching large sequence databases. Since computing ANI via genome alignment is computationally expensive, the field has increasingly turned to sketch-based approaches that use assumptions and heuristics to speed this up. We propose a suite of simulated and real benchmark datasets, together with a rank-correlation-based metric, to study how these assumptions and heuristics impact distance estimates. We call this evaluation framework EvANI. With EvANI, we show that ANIb is the ANI estimation algorithm that best captures tree distance, though it is also the least efficient. We show that k-mer-based approaches are extremely efficient and have consistently strong accuracy. We also show that some clades have inter-sequence distances that are best computed using multiple values of $k$, e.g. $k=10$ and $k=19$ for Chlamydiales. Finally, we highlight that approaches based on maximal exact matches may represent an advantageous compromise, achieving an intermediate level of computational efficiency while avoiding over-reliance on a single fixed k-mer length.