Demo Data from EDBT 2026 / reviewers in the wild / expert
Anand Sastry 0002
dblp:05/1012-2 · also Anand V. Sastry
· DBLP profile ↗
6ranked-venue papers
3as first author
3since 2021 · last 2024
0000-0002-8293-3909ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 6 · 3 first-author · 3 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › protein analysis › protein bioinformatics
protein expression prediction |
0.3 | 1 | 2017 | Machine learning in computational biology to accelerate high-throughput protein expression · Bioinform. 2017 |
Bioinformatics and computational biology › molecular property prediction › protein property prediction
protein solubility prediction |
0.3 | 1 | 2017 | Machine learning in computational biology to accelerate high-throughput protein expression · Bioinform. 2017 |
Bioinformatics and computational biology
protein structure analysis |
0.1 | 1 | 2018 | ssbio: a Python framework for structural systems biology · Bioinform. 2018 |
Bioinformatics and computational biology
proteomics |
0.1 | 1 | 2017 | Machine learning in computational biology to accelerate high-throughput protein expression · Bioinform. 2017 |
Methods — techniques the papers use, named apart from their topics
third-party program wrapping · 0.3automated pipeline construction · 0.3random forest · 0.3machine learning · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | iModulonMiner and PyModulon: Software for unsupervised mining of gene expression compendiaabstractPublic gene expression databases are a rapidly expanding resource of organism responses to diverse perturbations, presenting both an opportunity and a challenge for bioinformatics workflows to extract actionable knowledge of transcription regulatory network function. Here, we introduce a five-step computational pipeline, called iModulonMiner, to compile, process, curate, analyze, and characterize the totality of RNA-seq data for a given organism or cell type. This workflow is centered around the data-driven computation of co-regulated gene sets using Independent Component Analysis, called iModulons, which have been shown to have broad applications. As a demonstration, we applied this workflow to generate the iModulon structure of Bacillus subtilis using all high-quality, publicly-available RNA-seq data. Using this structure, we predicted regulatory interactions for multiple transcription factors, identified groups of co-expressed genes that are putatively regulated by undiscovered transcription factors, and predicted properties of a recently discovered single-subunit phage RNA polymerase. We also present a Python package, PyModulon, with functions to characterize, visualize, and explore computed iModulons. The pipeline, available at https://github.com/SBRG/iModulonMiner, can be readily applied to diverse organisms to gain a rapid understanding of their transcriptional regulatory network structure and condition-specific activity. Anand Sastry 0002, Saugat Poudel, Kevin Rychel, Reo Yoo, Cameron R. Lamoureux, Gaoyuan Li, Joshua T. Burrows, Siddharth Chauhan, Zachary B. Haiman, Tahani Al Bulushi, Yara Seif, Bernhard O. Palsson, Daniel C. Zielinski |
PLoS Comput. Biol. | 1 |
| 2021 | Optimal dimensionality selection for independent component analysis of transcriptomic dataabstractBACKGROUND: Independent component analysis is an unsupervised machine learning algorithm that separates a set of mixed signals into a set of statistically independent source signals. Applied to high-quality gene expression datasets, independent component analysis effectively reveals both the source signals of the transcriptome as co-regulated gene sets, and the activity levels of the underlying regulators across diverse experimental conditions. Two major variables that affect the final gene sets are the diversity of the expression profiles contained in the underlying data, and the user-defined number of independent components, or dimensionality, to compute. Availability of high-quality transcriptomic datasets has grown exponentially as high-throughput technologies have advanced; however, optimal dimensionality selection remains an open question. METHODS: We computed independent components across a range of dimensionalities for four gene expression datasets with varying dimensions (both in terms of number of genes and number of samples). We computed the correlation between independent components across different dimensionalities to understand how the overall structure evolves as the number of user-defined components increases. We then measured how well the resulting gene clusters reflected known regulatory mechanisms, and developed a set of metrics to assess the accuracy of the decomposition at a given dimension. RESULTS: We found that over-decomposition results in many independent components dominated by a single gene, whereas under-decomposition results in independent components that poorly capture the known regulatory structure. From these results, we developed a new method, called OptICA, for finding the optimal dimensionality that controls for both over- and under-decomposition. Specifically, OptICA selects the highest dimension that produces a low number of components that are dominated by a single gene. We show that OptICA outperforms two previously proposed methods for selecting the number of independent components across four transcriptomic databases of varying sizes. CONCLUSIONS: OptICA avoids both over-decomposition and under-decomposition of transcriptomic datasets resulting in the best representation of the organism's underlying transcriptional regulatory network. John Luke McConn, Cameron R. Lamoureux, Saugat Poudel, Bernhard O. Palsson, Anand Sastry 0002 |
BMC Bioinform. | 5 |
| 2021 | Independent component analysis recovers consistent regulatory signals from disparate datasetsabstractThe availability of bacterial transcriptomes has dramatically increased in recent years. This data deluge could result in detailed inference of underlying regulatory networks, but the diversity of experimental platforms and protocols introduces critical biases that could hinder scalable analysis of existing data. Here, we show that the underlying structure of the E. coli transcriptome, as determined by Independent Component Analysis (ICA), is conserved across multiple independent datasets, including both RNA-seq and microarray datasets. We subsequently combined five transcriptomics datasets into a large compendium containing over 800 expression profiles and discovered that its underlying ICA-based structure was still comparable to that of the individual datasets. With this understanding, we expanded our analysis to over 3,000 E. coli expression profiles and predicted three high-impact regulons that respond to oxidative stress, anaerobiosis, and antibiotic treatment. ICA thus enables deep analysis of disparate data to uncover new insights that were not visible in the individual datasets. Anand Sastry 0002, Alyssa Hu, David Heckmann, Saugat Poudel, Erol S. Kavvas, Bernhard O. Palsson |
PLoS Comput. Biol. | 1 |
| 2019 | BOFdat: Generating biomass objective functions for genome-scale metabolic models from experimental dataabstractGenome-scale metabolic models (GEMs) are mathematically structured knowledge bases of metabolism that provide phenotypic predictions from genomic information. GEM-guided predictions of growth phenotypes rely on the accurate definition of a biomass objective function (BOF) that is designed to include key cellular biomass components such as the major macromolecules (DNA, RNA, proteins), lipids, coenzymes, inorganic ions and species-specific components. Despite its importance, no standardized computational platform is currently available to generate species-specific biomass objective functions in a data-driven, unbiased fashion. To fill this gap in the metabolic modeling software ecosystem, we implemented BOFdat, a Python package for the definition of a Biomass Objective Function from experimental data. BOFdat has a modular implementation that divides the BOF definition process into three independent modules defined here as steps: 1) the coefficients for major macromolecules are calculated, 2) coenzymes and inorganic ions are identified and their stoichiometric coefficients estimated, 3) the remaining species-specific metabolic biomass precursors are algorithmically extracted in an unbiased way from experimental data. We used BOFdat to reconstruct the BOF of the Escherichia coli model iML1515, a gold standard in the field. The BOF generated by BOFdat resulted in the most concordant biomass composition, growth rate, and gene essentiality prediction accuracy when compared to other methods. Installation instructions for BOFdat are available in the documentation and the source code is available on GitHub (https://github.com/jclachance/BOFdat). Jean-Christophe Lachance, Colton J. Lloyd, Jonathan Monk, Laurence Yang 0001, Anand Sastry 0002, Yara Seif, Bernhard O. Palsson, Sébastien Rodrigue, Adam M. Feist, Zachary A. King, Pierre-Étienne Jacques |
PLoS Comput. Biol. | 5 |
| 2018 | ssbio: a Python framework for structural systems biologyabstractSummary: Working with protein structures at the genome-scale has been challenging in a variety of ways. Here, we present ssbio, a Python package that provides a framework to easily work with structural information in the context of genome-scale network reconstructions, which can contain thousands of individual proteins. The ssbio package provides an automated pipeline to construct high quality genome-scale models with protein structures (GEM-PROs), wrappers to popular third-party programs to compute associated protein properties, and methods to visualize and annotate structures directly in Jupyter notebooks, thus lowering the barrier of linking 3D structural data with established systems workflows. Availability and implementation: ssbio is implemented in Python and available to download under the MIT license at http://github.com/SBRG/ssbio. Documentation and Jupyter notebook tutorials are available at http://ssbio.readthedocs.io/en/latest/. Interactive notebooks can be launched using Binder at https://mybinder.org/v2/gh/SBRG/ssbio/master?filepath=Binder.ipynb. Supplementary information: Supplementary data are available at Bioinformatics online. Nathan Mih, Elizabeth Brunk, Edward Catoiu, Anand Sastry 0002, Erol S. Kavvas, Jonathan Monk, Bernhard O. Palsson |
Bioinform. | 5 |
| 2017 | Machine learning in computational biology to accelerate high-throughput protein expressionabstractMOTIVATION: The Human Protein Atlas (HPA) enables the simultaneous characterization of thousands of proteins across various tissues to pinpoint their spatial location in the human body. This has been achieved through transcriptomics and high-throughput immunohistochemistry-based approaches, where over 40 000 unique human protein fragments have been expressed in E. coli. These datasets enable quantitative tracking of entire cellular proteomes and present new avenues for understanding molecular-level properties influencing expression and solubility. RESULTS: Combining computational biology and machine learning identifies protein properties that hinder the HPA high-throughput antibody production pipeline. We predict protein expression and solubility with accuracies of 70% and 80%, respectively, based on a subset of key properties (aromaticity, hydropathy and isoelectric point). We guide the selection of protein fragments based on these characteristics to optimize high-throughput experimentation. AVAILABILITY AND IMPLEMENTATION: We present the machine learning workflow as a series of IPython notebooks hosted on GitHub (https://github.com/SBRG/Protein_ML). The workflow can be used as a template for analysis of further expression and solubility datasets. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Anand Sastry 0002, Jonathan Monk, Hanna Tegel, Mathias Uhlen, Bernhard O. Palsson, Johan Rockberg, Elizabeth Brunk |
Bioinform. | 1 |