SSSudip Sharma

Sudip Sharma

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Sudip Sharma has a total of 105 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Correction: A collaborative genomics platform for type 1 diabetes in Eastern and Central Europe

    by Khrystyna Shchubelka, Walter W. Wolfsberger, Karolina Kulis, Obed A. Garcia, Sudip Sharma, Yaroslava Hasynets, Oleksandr Dubiv, Oleksii Kurutsa, Nadiia Shylova, Alina Huklyvska, et al.

  • Open Access

    A collaborative genomics platform for type 1 diabetes in Eastern and Central Europe

    by Khrystyna Shchubelka, Walter W. Wolfsberger, Karolina Kulis, Obed A. Garcia, Sudip Sharma, Yaroslava Hasynets, Oleksandr Dubiv, Oleksii Kurutsa, Nadiia Shylova, Alina Huklyvska, et al.

  • Open Access

    Phylogenomic subsampling and upsampling for efficient evolutionary analyses of big data

    by Sudhir Kumar, Koichiro Tamura, Sudip Sharma

    Long runtimes, high memory demands, and reliance on high-performance computing impede phylogenomic analyses. We review a scalable phylogenomic subsampling with upsampling (PSU) framework to address this challenge, which reduces runtime and memory requirements by orders of magnitude. In PSU, small subsamples of sites from a concatenated alignment are analyzed, which are expanded by upsampling before inference, and the resulting inferences are aggregated to obtain evolutionary estimates. PSU harnesses the fact that the computational cost of maximum likelihood analysis is strongly influenced by the number of distinct site patterns in the concatenated alignment, whereas statistical power depends primarily on the amount of evolutionary information represented by the total number of sites and substitutions. By reducing the former while restoring the latter through upsampling, PSU can approximate many full-alignment analyses at substantially lower computational cost. Analysis of simulated and empirical datasets shows that PSU can accurately estimate bootstrap support values, select the optimal substitution model, test evolutionary hypotheses, and infer branch lengths, divergence times, and associated uncertainty measures. PSU also provides distributions of inferred clade support across independent subsamples, enabling detection of conflicting phylogenetic signals that may remain hidden in conventional bootstrap analysis of concatenated alignments. Automated tuning of subsample size, the number of subsamples, and the number of upsampling replicates make PSU practical. We suggest that PSU is a general approach for scalable phylogenomic inference using a broad range of statistical methods. By enabling analyses of genome-scale alignments on commodity hardware, PSU broadens research access and reduces environmental and infrastructural costs of big-data phylogenomics.

  • Open Access

    Robust and Efficient Confidence Limits for Phylogenomic Inference of Organismal Relationships

    by Sudip Sharma, Sudhir Kumar

    Phylogenomic data are indispensable for establishing reliable relationships needed to build a robust Tree of Life. The superalignment approach concatenates hundreds or thousands of genomic segments, providing a straightforward, computationally efficient, and effective means of inferring phylogenies. However, the standard bootstrap method can produce overly confident support for incorrect inferences based on superalignments. It fails to account for the heterogeneity in phylogenetic signals across the data, which is caused by incomplete lineage sorting (ILS), data errors, and other biological processes. To detect such erroneous inferences, researchers need to produce and deliberate on the concordance of inferences derived from many complex and computationally demanding analyses that require knowledge of data partitions. This study demonstrates that analyzing phylogenomic subsamples with bootstrap upsampling overcomes the overconfidence drawback of the superalignment approach. We found that bootstrapping multiple small, randomly selected site subsets can detect the presence of phylogeny variation signals across the dataset, similar to that detected using data partitions. We present the Net Bootstrap Support (NBS) approach that accounts for this phylogenetic variation in the estimates of bootstrap confidence. NBS values showed comparable performance to multispecies coalescent analyses in the presence of ILS and surpassed it for datasets simulated with gene tree estimation errors. NBS analyses of phylogenomic data from rodents, fungi, and carnivorous plants corroborated the performance observed in simulated datasets and even mitigated overconfidence resulting from some data errors. NBS calculations are computationally efficient, with low memory consumption and high computational time savings, making the NBS approach well suited for big data molecular phylogenetics on both desktops and high-performance computing systems.


  • Open Access

    MyESL: A software for evolutionary sparse learning in molecular phylogenetics and genomics

    by Maxwell Sanderford, Sudip Sharma, Glen Stecher, Michael Suleski, Jun Liu, Jieping Ye, Sudhir Kumar

    Evolutionary sparse learning (ESL) uses supervised machine learning to build evolutionary models where genomic sites and loci are parameters. It uses the Least Absolute Shrinkage and Selection Operator (LASSO) with bi-level sparsity to connect a specific phylogenetic hypothesis with sequence variation across genomic loci. The MyESL software addresses the need for open-source tools to perform ESL analyses, offering features to pre-process input phylogenomic alignments, post-process output models to generate molecular evolutionary metrics, and make LASSO regression adaptable and efficient for phylogenetic trees and alignments. The core of MyESL, which constructs models with logistic regressions using bi-level sparsity, is written in C++. Its input data pre-processing and result post-processing tools are developed in Python. Compared to other tools, MyESL is more computationally efficient and provides evolution-friendly input and output options. These features have already enabled the use of MyESL in two phylogenomic applications, one to identify outlier sequences and fragile clades in inferred phylogenies and another to build a genetic model of convergent traits. In addition to the use in a Python environment, MyESL is available as a standalone executable compatible across multiple platforms and can be directly integrated into scripts and third-party software. The source code, executable, and documentation for MyESL are openly accessible at https://github.com/kumarlabgit/MyESL.


  • Open Access

    Evolutionary sparse learning reveals the shared genetic basis of convergent traits

    by John B. Allard, Sudip Sharma, Ravi Patel, Maxwell Sanderford, Koichiro Tamura, Slobodan Vucetic, Glenn S. Gerhard, Sudhir Kumar

    Cases abound in which nearly identical traits have appeared in distant species facing similar environments. These unmistakable examples of adaptive evolution offer opportunities to gain insight into their genetic origins and mechanisms through comparative analyses. Here, we present an approach to build genetic models that underlie the independent origins of convergent traits using evolutionary sparse learning with paired species contrast (ESL-PSC). We tested the hypothesis that common genes and sites are involved in the convergent evolution of two key traits: C4 photosynthesis in grasses and echolocation in mammals. Genetic models were highly predictive of independent cases of convergent evolution of C4 photosynthesis. Genes contributing to genetic models for echolocation were highly enriched for functional categories related to hearing, sound perception, and deafness, a pattern that has eluded previous efforts applying standard molecular evolutionary approaches. These results support the involvement of sequence substitutions at common genetic loci in the evolution of convergent traits. Benchmarking on empirical and simulated datasets showed that ESL-PSC could be more sensitive in proteome-scale analyses to detect genes with convergent molecular evolution associated with the acquisition of convergent traits. We conclude that phylogeny-informed machine learning naturally excludes apparent molecular convergences due to shared species history, enhances the signal-to-noise ratio for detecting molecular convergence, and empowers the discovery of common genetic bases of trait convergences.


  • Top Cited Papers
    Open Access

    MEGA12: Molecular Evolutionary Genetic Analysis Version 12 for Adaptive and Green Computing

    by Sudhir Kumar, Glen Stecher, Michael Suleski, Maxwell Sanderford, Sudip Sharma, Koichiro Tamura

    We introduce the 12th version of the Molecular Evolutionary Genetics Analysis (MEGA) software. This latest version brings many significant improvements by reducing the computational time needed for selecting optimal substitution models and conducting bootstrap tests on phylogenies using maximum likelihood (ML) methods. These improvements are achieved by implementing heuristics that minimize likely unnecessary computations. Analyses of empirical and simulated datasets show substantial time savings by using these heuristics without compromising the accuracy of results. MEGA12 also implements an evolutionary sparse learning approach to identify fragile clades and associated sequences in evolutionary trees inferred through phylogenomic analyses. In addition, this version includes fine-grained parallelization for ML analyses, support for high-resolution monitors, and an enhanced Tree Explorer. MEGA12 can be downloaded from https://www.megasoftware.net.


  • Fast and accurate bootstrap confidence limits on genome-scale phylogenies using little bootstraps

    by Sudip Sharma, Sudhir Kumar

    Felsenstein’s bootstrap approach is widely used to assess confidence in species relationships inferred from multiple sequence alignments. It resamples sites randomly with replacement to build alignment replicates of the same size as the original alignment and infers a phylogeny from each replicate dataset. The proportion of phylogenies recovering the same grouping of species is its bootstrap confidence limit. However, standard bootstrap imposes a high computational burden in applications involving long sequence alignments. Here, we introduce the bag of little bootstraps approach to phylogenetics, bootstrapping only a few little samples, each containing a small subset of sites. We report that the median-bagging of bootstrap confidence limits from little samples produces confidence in inferred species relationships similar to standard bootstrap but in a fraction of the computational time and memory. Therefore, the little bootstraps approach can potentially enhance the rigor, efficiency and parallelization of big data phylogenomic analyses.