Edo Dotan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Edo Dotan has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
Elya Wygoda
The Shmunis School of Biomedicine and Cancer Research, George S. Wise Faculty of Life Sciences, Tel Aviv University , Tel Aviv 69978
3 shared publicationsNoa Ecker
The Shmunis School of Biomedicine and Cancer Research, George S. Wise Faculty of Life Sciences, Tel Aviv University , Tel Aviv 69978
3 shared publications- Tal Pupko
The Shmunis School of Biomedicine and Cancer Research, George S. Wise Faculty of Life Sciences, Tel Aviv University , Tel Aviv 6997801
3 shared publications - Oren Avram
Department of Computational Medicine, University of California Los Angeles, Los Angeles, CA, USA.
2 shared publications Alla Shnaider
Department of Nephrology, Soroka University Medical Center , Beer-Sheva
1 shared publication- Asaf Vivante
Affiliations Faculty of Medical and Health Sciences, Tel-Aviv University, Tel-Aviv, Israel, Pediatric Department B and Pediatric Nephrology Unit, Talpiot Medical Leadership Program, Edmond and Lily Safra Children’s Hospital, Faculty of Medical and Health Sciences Sheba Medical Center, Ramat Gan, Israel
1 shared publication
Latest Publications
- Open Access
- 29 December 2025
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (1)
Efficient algorithms for simulating sequences along a phylogenetic tree
Motivation: Sequence simulations along phylogenetic trees play an important role in numerous molecular evolution studies such as benchmarking algorithms for ancestral sequence reconstruction, multiple sequence alignment, and phylogeny inference. They are also used in phylogenetic model-selection tasks, including the inference of selective forces. Recently, Approximate Bayesian Computation (ABC)-based approaches have been developed for inferring parameters of complex evolutionary models, which rely on massive generation of simulated data. For all these applications, computationally efficient sequence simulators are essential. Results: In this study, we investigate fast algorithms for simulating sequences along a phylogenetic tree, focusing on accelerating the speed-limiting component of the simulation process: handling insertion and deletion (indel) events. We demonstrate that data structures which efficiently store indel events along a tree can substantially accelerate the simulation process compared to a naive approach. To illustrate the utility of this efficient simulator, we integrated it into an ABC-based algorithm for inferring indel model parameters and applied it to study indel dynamics within Chiroptera. Availability and implementation: The source code for the different simulation algorithms, alongside the data used, is available at: https://github.com/nimrodSerokTAU/evo-sim. The simulator has also been integrated into SpartaABC, a website for the inference of indel parameters, accessible at: https://spartaabc.tau.ac.il/.
- 29 December 2025
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (1)
Open AccessEfficient algorithms for simulating sequences along a phylogenetic tree
Motivation: Sequence simulations along phylogenetic trees play an important role in numerous molecular evolution studies such as benchmarking algorithms for ancestral sequence reconstruction, multiple sequence alignment, and phylogeny inference. They are also used in phylogenetic model-selection tasks, including the inference of selective forces. Recently, Approximate Bayesian Computation (ABC)-based approaches have been developed for inferring parameters of complex evolutionary models, which rely on massive generation of simulated data. For all these applications, computationally efficient sequence simulators are essential. Results: In this study, we investigate fast algorithms for simulating sequences along a phylogenetic tree, focusing on accelerating the speed-limiting component of the simulation process: handling insertion and deletion (indel) events. We demonstrate that data structures which efficiently store indel events along a tree can substantially accelerate the simulation process compared to a naive approach. To illustrate the utility of this efficient simulator, we integrated it into an ABC-based algorithm for inferring indel model parameters and applied it to study indel dynamics within Chiroptera. Availability and implementation: The source code for the different simulation algorithms, alongside the data used, is available at: https://github.com/nimrodSerokTAU/evo-sim. The simulator has also been integrated into SpartaABC, a website for the inference of indel parameters, accessible at: https://spartaabc.tau.ac.il/.
- Open Access
- 14 May 2025
- Published by Oxford University Press (OUP) in Nucleic Acids Research
- Vol. 53 (W1) , W369-W375
M1CR0B1AL1Z3R 2.0: an enhanced web server for comparative analysis of bacterial genomes at scale
Large-scale analyses of bacterial genomic datasets contribute to the comprehensive characterization of complex microbial dynamics among different strains and species. Such analyses often include open reading frame extraction, orthogroup inference, phylogeny reconstruction, and functional annotation of proteins. We have previously developed the M1CR0B1AL1Z3R web server, a “one-stop shop” for conducting comparative analyses of microbial genomes. Here, we present M1CR0B1AL1Z3R 2.0, an enhanced version that includes a new user-friendly web interface and an improved, optimized, and more versatile pipeline. The following features were added: (i) a computationally efficient inference of orthogroups, which allows the analysis of up to 2000 bacterial genomes; (ii) genome completeness analysis; (iii) lists of orphan genes per genome; (iv) genome numeric representation that allows detecting genomic rearrangement events; (v) codon bias analysis; (vi) annotation of orthogroups with KEGG Orthology numbers; and (vii) a map of pairwise average nucleotide identity values. M1CR0B1AL1Z3R 2.0 is freely available at https://microbializer.tau.ac.il/.
- 14 May 2025
- Published by Oxford University Press (OUP) in Nucleic Acids Research
- Vol. 53 (W1) , W369-W375
Open AccessM1CR0B1AL1Z3R 2.0: an enhanced web server for comparative analysis of bacterial genomes at scale
Large-scale analyses of bacterial genomic datasets contribute to the comprehensive characterization of complex microbial dynamics among different strains and species. Such analyses often include open reading frame extraction, orthogroup inference, phylogeny reconstruction, and functional annotation of proteins. We have previously developed the M1CR0B1AL1Z3R web server, a “one-stop shop” for conducting comparative analyses of microbial genomes. Here, we present M1CR0B1AL1Z3R 2.0, an enhanced version that includes a new user-friendly web interface and an improved, optimized, and more versatile pipeline. The following features were added: (i) a computationally efficient inference of orthogroups, which allows the analysis of up to 2000 bacterial genomes; (ii) genome completeness analysis; (iii) lists of orphan genes per genome; (iv) genome numeric representation that allows detecting genomic rearrangement events; (v) codon bias analysis; (vi) annotation of orthogroups with KEGG Orthology numbers; and (vii) a map of pairwise average nucleotide identity values. M1CR0B1AL1Z3R 2.0 is freely available at https://microbializer.tau.ac.il/.
- Open Access
- 26 December 2024
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (1)
BetaAlign: a deep learning approach for multiple sequence alignment
Motivation: Multiple sequence alignments (MSAs) are extensively used in biology, from phylogenetic reconstruction to structure and function prediction. Here, we suggest an out-of-the-box approach for the inference of MSAs, which relies on algorithms developed for processing natural languages. We show that our artificial intelligence (AI)-based methodology can be trained to align sequences by processing alignments that are generated via simulations, and thus different aligners can be easily generated for datasets with specific evolutionary dynamics attributes. We expect that natural language processing (NLP) solutions will replace or augment classic solutions for computing alignments, and more generally, challenging inference tasks in phylogenomics. Results: The MSA problem is a fundamental pillar in bioinformatics, comparative genomics, and phylogenetics. Here, we characterize and improve BetaAlign, the first deep learning aligner, which substantially deviates from conventional algorithms of alignment computation. BetaAlign draws on NLP techniques and trains transformers to map a set of unaligned biological sequences to an MSA. We show that our approach is highly accurate, comparable and sometimes better than state-of-the-art alignment tools. We characterize the performance of BetaAlign and the effect of various aspects on accuracy; for example, the size of the training data, the effect of different transformer architectures, and the effect of learning on a subspace of indel-model parameters (subspace learning). We also introduce a new technique that leads to improved performance compared to our previous approach. Our findings further uncover the potential of NLP-based methods for sequence alignment, highlighting that AI-based algorithms can substantially challenge classic approaches in phylogenomics and bioinformatics. Availability and implementation: Datasets used in this work are available on HuggingFace (Wolf et al. Transformers: state-of-the-art natural language processing. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations. p.38–45. 2020) at: https://huggingface.co/dotan1111. Source code is available at: https://github.com/idotan286/SimulateAlignments.
- 26 December 2024
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (1)
Open AccessBetaAlign: a deep learning approach for multiple sequence alignment
Motivation: Multiple sequence alignments (MSAs) are extensively used in biology, from phylogenetic reconstruction to structure and function prediction. Here, we suggest an out-of-the-box approach for the inference of MSAs, which relies on algorithms developed for processing natural languages. We show that our artificial intelligence (AI)-based methodology can be trained to align sequences by processing alignments that are generated via simulations, and thus different aligners can be easily generated for datasets with specific evolutionary dynamics attributes. We expect that natural language processing (NLP) solutions will replace or augment classic solutions for computing alignments, and more generally, challenging inference tasks in phylogenomics. Results: The MSA problem is a fundamental pillar in bioinformatics, comparative genomics, and phylogenetics. Here, we characterize and improve BetaAlign, the first deep learning aligner, which substantially deviates from conventional algorithms of alignment computation. BetaAlign draws on NLP techniques and trains transformers to map a set of unaligned biological sequences to an MSA. We show that our approach is highly accurate, comparable and sometimes better than state-of-the-art alignment tools. We characterize the performance of BetaAlign and the effect of various aspects on accuracy; for example, the size of the training data, the effect of different transformer architectures, and the effect of learning on a subspace of indel-model parameters (subspace learning). We also introduce a new technique that leads to improved performance compared to our previous approach. Our findings further uncover the potential of NLP-based methods for sequence alignment, highlighting that AI-based algorithms can substantially challenge classic approaches in phylogenomics and bioinformatics. Availability and implementation: Datasets used in this work are available on HuggingFace (Wolf et al. Transformers: state-of-the-art natural language processing. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations. p.38–45. 2020) at: https://huggingface.co/dotan1111. Source code is available at: https://github.com/idotan286/SimulateAlignments.
- Open Access
- 6 December 2024
- Published by Oxford University Press (OUP) in Clinical Kidney Journal
- Vol. 18 (2) , sfae397
Multiethnic prevalence of the APOL1 G1 and G2 variants among the Israeli dialysis population
Background and hypothesis: The two apolipoprotein L1 (APOL1) variants, G1 and G2, are common in populations of sub-Saharan African ancestry. Individuals with two of these alleles (G1 or G2) have an increased risk for a spectrum of non-diabetic chronic kidney diseases. However, these variants are typically not observed outside of populations that self-identify as current continental Africans or having clear recent African ancestry such as, most notably, African Americans, and other large population groups in the Americas and several European countries. We hypothesized that the diverse ethnic groups within the Israeli population may exhibit varying levels of recent African ancestry. Therefore, it is plausible that APOL1 risk alleles might be present even in individuals who do not self-identify as being of sub-Saharan African descent. Methods: We non-selectively screened people with kidney failure across Israel for APOL1 risk variants using restriction fragment length polymorphism. Results: We recruited 1744 individuals from 38 dialysis units in Israel. We identified eight patients of Moroccan Jewish, Bedouin, or Muslim Arab ancestry, who carry at least one G1 or G2 allele. None of the eight patients carried the protective APOL1 p.N264K variant. Furthermore, despite all Bedouin individuals being G2 heterozygous, the G2 minor allele frequency was significantly enriched in kidney failure cases compared to ethnically matched controls (P = .006). Conclusions: These findings show that APOL1 G1 and G2 allelic variants are present in populations previously not appreciated to possess recent sub-Saharan ancestry and suggest that a single G2 risk variant may confer increased risk for chronic kidney disease in certain population contexts.
- 6 December 2024
- Published by Oxford University Press (OUP) in Clinical Kidney Journal
- Vol. 18 (2) , sfae397
Open AccessMultiethnic prevalence of the APOL1 G1 and G2 variants among the Israeli dialysis population
Background and hypothesis: The two apolipoprotein L1 (APOL1) variants, G1 and G2, are common in populations of sub-Saharan African ancestry. Individuals with two of these alleles (G1 or G2) have an increased risk for a spectrum of non-diabetic chronic kidney diseases. However, these variants are typically not observed outside of populations that self-identify as current continental Africans or having clear recent African ancestry such as, most notably, African Americans, and other large population groups in the Americas and several European countries. We hypothesized that the diverse ethnic groups within the Israeli population may exhibit varying levels of recent African ancestry. Therefore, it is plausible that APOL1 risk alleles might be present even in individuals who do not self-identify as being of sub-Saharan African descent. Methods: We non-selectively screened people with kidney failure across Israel for APOL1 risk variants using restriction fragment length polymorphism. Results: We recruited 1744 individuals from 38 dialysis units in Israel. We identified eight patients of Moroccan Jewish, Bedouin, or Muslim Arab ancestry, who carry at least one G1 or G2 allele. None of the eight patients carried the protective APOL1 p.N264K variant. Furthermore, despite all Bedouin individuals being G2 heterozygous, the G2 minor allele frequency was significantly enriched in kidney failure cases compared to ethnically matched controls (P = .006). Conclusions: These findings show that APOL1 G1 and G2 allelic variants are present in populations previously not appreciated to possess recent sub-Saharan ancestry and suggest that a single G2 risk variant may confer increased risk for chronic kidney disease in certain population contexts.