Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bioinformatics”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Predicting variable gene content in Escherichia coli using conserved genes

Having the ability to predict the protein-encoding gene content of an incomplete genome or metagenome-assembled genome is important for a variety of bioinformatic tasks. In this study, as a proof of concept, we built machine learning classifiers for predicting variable gene content in Escherichia coli genomes using only the nucleotide k-mers from a set of 100 conserved genes as features. Protein families were used to define orthologs, and a single classifier was built for predicting the presence or absence of each protein family occurring in 10%–90% of all E. coli genomes. The resulting set of 3,259 extreme gradient boosting classifiers had a per-genome average macro F1 score of 0.944 [0.943–0.945, 95% CI]. We show that the F1 scores are stable across multi-locus sequence types and that the trend can be recapitulated by sampling a smaller number of core genes or diverse input genomes. Surprisingly, the presence or absence of poorly annotated proteins, including “hypothetical proteins” was accurately predicted (F1 = 0.902 [0.898–0.906, 95% CI]). Models for proteins with horizontal gene transfer-related functions had slightly lower F1 scores but were still accurate (F1s = 0.895, 0.872, 0.824, and 0.841 for transposon, phage, plasmid, and antimicrobial resistance-related functions, respectively). Finally, using a holdout set of 419 diverse E. coli genomes that were isolated from freshwater environmental sources, we observed an average per-genome F1 score of 0.880 [0.876–0.883, 95% CI], demonstrating the extensibility of the models. Overall, this study provides a framework for predicting variable gene content using a limited amount of input sequence data.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Predicting Antimicrobial Resistance Using Partial Genome Alignments

Antimicrobial resistance (AMR) is an important global health threat that impacts millions of people worldwide each year. Developing methods that can detect and predict AMR phenotypes can help to mitigate the spread of AMR by informing clinical decision making and appropriate mitigation strategies. Many bioinformatic methods have been developed for predicting AMR phenotypes from whole-genome sequences and AMR genes, but recent studies have indicated that predictions can be made from incomplete genome sequence data. In order to more systematically understand this, we built random forest-based machine learning classifiers for predicting susceptible and resistant phenotypes for Klebsiella pneumoniae (1,640 strains), Mycobacterium tuberculosis (2,497 strains), and Salmonella enterica (1,981 strains). We started by building models from alignments that were based on a reference chromosome for each species. We then subsampled each chromosomal alignment and built models for the resulting subalignments, finding that very small regions, representing approximately 0.1 to 0.2% of the chromosome, are predictive. In K. pneumoniae, M. tuberculosis, and S. enterica, the subalignments are able to predict multiple AMR phenotypes with at least 70% accuracy, even though most do not encode an AMR-related function. We used these models to identify regions of the chromosome with high and low predictive signals. Finally, subalignments that retain high accuracy across larger phylogenetic distances were examined in greater detail, revealing genes and intergenic regions with potential links to AMR, virulence, transport, and survival under stress conditions. IMPORTANCE Antimicrobial resistance causes thousands of deaths annually worldwide. Understanding the regions of the genome that are involved in antimicrobial resistance is important for developing mitigation strategies and preventing transmission. Machine learning models are capable of predicting antimicrobial resistance phenotypes from bacterial genome sequence data by identifying resistance genes, mutations, and other correlated features. They are also capable of implicating regions of the genome that have not been previously characterized as being involved in resistance. In this study, we generated global chromosomal alignments for Klebsiella pneumoniae, Mycobacterium tuberculosis, and Salmonella enterica and systematically searched them for small conserved regions of the genome that enable the prediction of antimicrobial resistance phenotypes. In addition to known antimicrobial resistance genes, this analysis identified genes involved in virulence and transport functions, as well as many genes with no previous implication in antimicrobial resistance.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Decomposing a San Francisco estuary microbiome using long-read metagenomics reveals species- and strain-level dominance from picoeukaryotes to viruses

ABSTRACT Although long-read sequencing has enabled obtaining high-quality and complete genomes from metagenomes, many challenges still remain to completely decompose a metagenome into its constituent prokaryotic and viral genomes. This study focuses on decomposing an estuarine metagenome to obtain a more accurate estimate of microbial diversity. To achieve this, we developed a new bead-based DNA extraction method, a novel bin refinement method, and obtained 150 Gbp of Nanopore sequencing. We estimate that there are ~500 bacterial and archaeal species in our sample and obtained 68 high-quality bins (>90% complete, <5% contamination, ≤5 contigs, contig length of >100 kbp, and all ribosomal and tRNA genes). We also obtained many contigs of picoeukaryotes, environmental DNA of larger eukaryotes such as mammals, and complete mitochondrial and chloroplast genomes and detected ~40,000 viral populations. Our analysis indicates that there are only a few strains that comprise most of the species abundances. IMPORTANCE Ocean and estuarine microbiomes play critical roles in global element cycling and ecosystem function. Despite the importance of these microbial communities, many species still have not been cultured in the lab. Environmental sequencing is the primary way the function and population dynamics of these communities can be studied. Long-read sequencing provides an avenue to overcome limitations of short-read technologies to obtain complete microbial genomes but comes with its own technical challenges, such as needed sequencing depth and obtaining high-quality DNA. We present here new sampling and bioinformatics methods to attempt decomposing an estuarine microbiome into its constituent genomes. Our results suggest there are only a few strains that comprise most of the species abundances from viruses to picoeukaryotes, and to fully decompose a metagenome of this diversity requires 1 Tbp of long-read sequencing. We anticipate that as long-read sequencing technologies continue to improve, less sequencing will be needed.

Lui, Lauren M.↗
DOE OSTI2020

Mycobacterium Phage Butters-Encoded Proteins Contribute to Host Defense against Viral Attack [plus supplemental information]

A diverse set of prophage-mediated mechanisms protecting bacterial hosts from infection has been recently uncovered within cluster N mycobacteriophages isolated on the host, Mycobacterium smegmatis mc 2 155. In that context, we unveil a novel defense mechanism in cluster N prophage Butters. By using bioinformatics analyses, phage plating efficiency experiments, microscopy, and immunoprecipitation assays, we show that Butters genes located in the central region of the genome play a key role in the defense against heterotypic viral attack. Our study suggests that a two-component system, articulated by interactions between protein products of genes 30 and 31, confers defense against heterotypic phage infection by PurpleHaze (cluster A/subcluster A3) or Alma (cluster A/subcluster A9) but is insufficient to confer defense against attack by the heterotypic phage Island3 (cluster I/subcluster I1). Therefore, based on heterotypic phage plating efficiencies on the Butters lysogen, additional prophage genes required for defense are implicated and further show specificity of prophage-encoded defense systems. IMPORTANCE: Many sequenced bacterial genomes, including those of pathogenic bacteria, contain prophages. Some prophages encode defense systems that protect their bacterial host against heterotypic viral attack. Understanding the mechanisms undergirding these defense systems is crucial to appreciate the scope of bacterial immunity against viral infections and will be critical for better implementation of phage therapy that would require evasion of these defenses. Furthermore, such knowledge of prophage-encoded defense mechanisms may be useful for developing novel genetic tools for engineering phage-resistant bacteria of industrial importance.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

MVP: a modular viromics pipeline to identify, filter, cluster, annotate, and bin viruses from metagenomes

While numerous computational frameworks and workflows are available for recovering prokaryote and eukaryote genomes from metagenome data, only a limited number of pipelines are designed specifically for viromics analysis. With many viromics tools developed in the last few years alone, it can be challenging for scientists with limited bioinformatics experience to easily recover, evaluate quality, annotate genes, dereplicate, assign taxonomy, and calculate relative abundance and coverage of viral genomes using state-of-the-art methods and standards. Here, we describe Modular Viromics Pipeline (MVP) v.1.0, a user-friendly pipeline written in Python and providing a simple framework to perform standard viromics analyses. MVP combines multiple tools to enable viral genome identification, characterization of genome quality, filtering, clustering, taxonomic and functional annotation, genome binning, and comprehensive summaries of results that can be used for downstream ecological analyses. Overall, MVP provides a standardized and reproducible pipeline for both extensive and robust characterization of viruses from large-scale sequencing data including metagenomes, metatranscriptomes, viromes, and isolate genomes. As a typical use case, we show how the entire MVP pipeline can be applied to a set of 20 metagenomes from wetland sediments using only 10 modules executed via command lines, leading to the identification of 11,656 viral contigs and 8,145 viral operational taxonomic units (vOTUs) displaying a clear beta-diversity pattern. Further, acting as a dynamic wrapper, MVP is designed to continuously incorporate updates and integrate new tools, ensuring its ongoing relevance in the rapidly evolving field of viromics. MVP is available at https://gitlab.com/ccoclet/mvp and as versioned packages in PyPi and Conda.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

RNAseq analysis of Cellvibrio japonicus during starch utilization differentiates between genes encoding carbohydrate active enzymes controlled by substrate detection or growth rate

ABSTRACT Bacterial utilization of starch is increasingly of interest as the importance and contributions of animal gut microbiomes become more defined. Consequently, identifying and characterizing the bacterial enzymes responsible for the degradation, transport, and metabolism of starch will enable developments in pharmaceutical, biotechnological, and culinary industries searching for novel prebiotics, carrier molecules, and low glycemic index sweeteners. The current challenge is that bacteria proficient at starch utilization often have hundreds of carbohydrate active enzymes, and it is unclear which are essential for starch utilization using only homology-based bioinformatics or computational methods. Complementary experimental data are also needed, especially to understand the regulation of bacterial starch utilization. We have completed an RNAseq analysis of the Gram-negative bacterium Cellvibrio japonicus and found that it has sophisticated regulation that includes substrate sensing and growth rate components for genes that encode starch-degrading enzymes. Among the 22 genes predicted to encode starch-active enzymes, C. japonicus has 10 alpha-amylases, 4 alpha-glucosidases, 2 pullulnases, and 2 cyclomaltodextrin glucanotransferases, 15 of which were up-regulated during exponential growth on starch and 8 up-regulated in stationary phase. Growth analyses with an enzyme secretion deficient mutant of C. japonicus suggested that secreted amylases are essential for this bacterium to degrade starch. Our approach of coupling a physiological growth assay with transcriptomic data provides a platform to identify targets for further genetic or biochemical analysis that can be broadly applied to other starch-utilizing bacteria. IMPORTANCE Understanding the bacterial metabolism of starch is important as this polysaccharide is a ubiquitous ingredient in foods, supplements, and medicines, all of which influence gut microbiome composition and health. Our RNAseq and growth data set provides a valuable resource to those who want to better understand the regulation of starch utilization in Gram-negative bacteria. These data are also useful as they provide an example of how to approach studying a starch-utilizing bacterium that has many putative amylases by coupling transcriptomic data with growth assays to overcome the potential challenges of functional redundancy. The RNAseq data can also be used as a part of larger meta-analyses to compare how C. japonicus regulates carbohydrate active enzymes, or how this bacterium compares to gut microbiome constituents in terms of starch utilization potential.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Targeted metagenomic assessment reflects critical colonization in battlefield injuries

Current diagnostics and clinical management strategies for combat wounds are based on decisions made by expert clinicians. However, even in the hands of experienced surgeons, wounds from combat injuries can exhibit failed healing and complications related to limitations in the rapid and comprehensive generation of diagnostic information. Previous studies have demonstrated the possible use of genomic sequencing approaches to detect microbial signatures involved in combat casualty care. While effective, whole metagenome sequencing is limited by the depth required to confidently detect all relevant signatures. To address this, we developed a targeted capture sequencing panel to detect microbial signatures relevant to wound healing. These targets include known microbial nosocomial pathogens, wound colonizers, and genes involved in virulence and antimicrobial resistance. A bioinformatics pipeline was built to identify genomic regions of interest and over 8,000 oligonucleotide probes were designed for capture. The panel was synthesized and validated using control reference genomes in human background and on wound-effluent samples from a cohort of combat-injured U.S. service members. Our panel was sensitive against wound-colonizing species, Acinetobacter baumannii and Pseudomonas aeruginosa, and was specific in detecting corresponding virulence and antimicrobial-resistance genes as well as other pathogenic species present in microflora mixtures. Random forest feature permutation confirmed the prevalence of Acinetobacter and Pseudomonas in critically colonized wounds and wounds that failed to heal, respectively. Our results demonstrate the capability of targeted sequencing tools and analysis platforms to profile and deliver information on pathogenic factors influencing wound progression, thereby guiding therapeutic intervention.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

A transcriptomic atlas of acute stress response to low pH in multiple Issatchenkia orientalis strains

Because of its natural stress tolerance to low pH, Issatchenkia orientalis (a.k.a. Pichia kudriavzevii) is a promising non-model yeast for bio-based production of organic acids. Yet, this organism is relatively unstudied, and specific mechanisms of its tolerance to low pH are poorly understood, limiting commercial use. In this study, we selected 12 I. orientalis strains with varying acid stress tolerance (six tolerant and six susceptible) and profiled their transcriptomes in different pH conditions to study potential mechanisms of pH tolerance in this species. We identified hundreds of genes whose expression response is shared by tolerant strains but not by susceptible strains, or vice versa, as well as genes whose responses are reversed between tolerant and susceptible strains. We mapped regulatory mechanisms of transcriptomic responses via motif analysis as well as differential network reconstruction, identifying several transcription factors, including Stb5, Mac1, and Rtg1/Rtg3, some of which are known for their roles in acid response in Saccharomyces cerevisiae. Functional genomics analysis of short-listed genes and transcription factors suggested significant roles for energy metabolism and translation-related processes, as well as the cell wall integrity pathway and RTG-dependent retrograde signaling pathway. Finally, we conducted additional experiments for two organic acids, 3-hydroxypropionate and citramalate, to eliminate acid-specific effects and found potential roles for glycolysis and trehalose biosynthesis specifically for response to low pH. In summary, our approach of comparative transcriptomics and phenotypic contrasting, along with a multi-pronged bioinformatics analysis, suggests specific mechanisms of tolerance to low pH in I. orientalis that merit further validation through experimental perturbation and engineering.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

INTEGRATION OF PANDA WORKLOAD MANAGEMENT SYSTEM WITH SUPERCOMPUTERS

Abstract The Large Hadron Collider (LHC), operating at the international CERN Laboratory in Geneva, Switzerland, is leading Big Data driven scientific explorations. Experiments at the LHC explore the funda- mental nature of matter and the basic forces that shape our universe, and were recently credited for the dis- covery of a Higgs boson. ATLAS, one of the largest collaborations ever assembled in the sciences, is at the forefront of research at the LHC. To address an unprecedented multi-petabyte data processing challenge, the ATLAS experiment is relying on a heterogeneous distributed computational infrastructure. The ATLAS experiment uses PanDA (Production and Data Analysis) Workload Management System for managing the workflow for all data processing on over 140 data centers. Through PanDA, ATLAS physicists see a single computing facility that enables rapid scientific breakthroughs for the experiment, even though the data cen- ters are physically scattered all over the world. While PanDA currently uses more than 250000 cores with a peak performance of 0.3+ petaFLOPS, next LHC data taking runs will require more resources than Grid computing can possibly provide. To alleviate these challenges, LHC experiments are engaged in an ambitious program to expand the current computing model to include additional resources such as the opportunistic use of supercomputers. We will describe a project aimed at integration of PanDA WMS with supercomputers in United States, Europe and Russia (in particular with Titan supercomputer at Oak Ridge Leadership Com- puting Facility (OLCF), Supercomputer at the National Research Center Kurchatov Institute , IT4 in Ostrava, and others). The current approach utilizes a modified PanDA pilot framework for job submission to the supercomputers batch queues and local data management, with light-weight MPI wrappers to run single- threaded workloads in parallel on Titan s multi-core worker nodes. This implementation was tested with a variety of Monte-Carlo workloads on several supercomputing platforms. We will present our current accom- plishments in running PanDA WMS at supercomputers and demonstrate our ability to use PanDA as a portal independent of the computing facility s infrastructure for High Energy and Nuclear Physics, as well as other data-intensive science applications, such as bioinformatics and astro-particle physics.

De, K↗
DOE OSTI2021

cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPUSystems Using Trie Based Data Structure

Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelism offered by the GPU hardware is well suited for solving the subgraph isomorphism. However, current GPU implementations are far from the achievable performance. Moreover, the enormous memory requirement of current approaches limits the problem size that can be handled. This work analyzes the fundamental challenges associated with processing the subgraph isomorphism on GPUs and develops an efficient GPU hardware-aware implementation. We also develop a new GPU-friendly trie-based data structure to drastically reduce the intermediate storage space requirement. Hence, our approach runs larger benchmarks than the competitors. We also develop the first distributed sub-graph isomorphism algorithm for GPUs. Our experimental evaluation section demonstrates the efficacy of our approach by comparing the execution time and number of cases that we can handle against the state-of-the-art GPU implementations.

Xiang, Lizhi↗
DOE OSTI2022

Computational Estimation by Scientific Data Mining with Classical Methods to Automate Learning Strategies of Scientists

Experimental results are often plotted as 2-dimensional graphical plots (aka graphs) in scientific domains depicting dependent versus independent variables to aid visual analysis of processes. Repeatedly performing laboratory experiments consumes significant time and resources, motivating the need for computational estimation. The goals are to estimate the graph obtained in an experiment given its input conditions, and to estimate the conditions that would lead to a desired graph. Existing estimation approaches often do not meet accuracy and efficiency needs of targeted applications. We develop a computational estimation approach called AutoDomainMine that integrates clustering and classification over complex scientific data in a framework so as to automate classical learning methods of scientists. Knowledge discovered thereby from a database of existing experiments serves as the basis for estimation. Challenges include preserving domain semantics in clustering, finding matching strategies in classification, striking a good balance between elaboration and conciseness while displaying estimation results based on needs of targeted users, and deriving objective measures to capture subjective user interests. These and other challenges are addressed in this work. The AutoDomainMine approach is used to build a computational estimation system, rigorously evaluated with real data in Materials Science. Our evaluation confirms that AutoDomainMine provides desired accuracy and efficiency in computational estimation. It is extendable to other science and engineering domains as proved by adaptation of its sub-processes within fields such as Bioinformatics and Nanotechnology.

Computer Science↗
DOE OSTI2023

Accelerating Random Forest Classification on GPU and FPGA

Random Forests (RFs) are a commonly used machine learning method for classification and regression tasks spanning a variety of application domains, including bioinformatics, business analytics, and software optimization. While prior work has focused primarily on improving performance of the training of RFs, many applications, such as malware identification, cancer prediction, and banking fraud detection, require fast RF classification. In this work, we accelerate RF classification on GPU and FPGA. In order to provide efficient support for large datasets, we propose a hierarchical memory layout suitable to the GPU/FPGA memory hierarchy. We design three RF classification code variants based on that layout, and we investigate GPU- and FPGA-specific considerations for these kernels. Our experimental evaluation, performed on an Nvidia Xp GPU and on a Xilinx Alveo U250 FPGA accelerator card using publicly available datasets on the scale of millions of samples and tens of features, covers various aspects. First, we evaluate the performance benefits of our hierarchical data structure over the standard compressed sparse row (CSR) format. Second, we compare our GPU implementation with cuML, a machine learning library targeting Nvidia GPUs. Third, we explore the performance/accuracy tradeoff resulting from the use of different tree depths in the RF. Finally, we perform a comparative performance analysis of our GPU and FPGA implementations. Our evaluation shows that for high accuracy targets, our GPU implementation yields 5-9x speedup over CSR, and up to a 2x speedup over cuML.

FPGA, Xilinx FPGA, GPU, Random Forest classificati↗
DOE OSTI2023

cuAlign: Scalable Network Alignment on GPU Accelerators

Given two graphs, the objective of network alignment is to find the best one-to-one mapping of vertices in one graph (??) to vertices in the other (??), such that the number of overlaps is maximized. We say that edges(??, ??) ???and(??', ??') ??? are overlapped if ?? is mapped to ??' and ?? is mapped to??'. Network alignment is an important optimization problem with several applications in bioinformatics, computer vision and ontology matching. Since it is an NP-hard problem, efficient heuristics and scalable implementations are necessary. In this work, we introduce a new framework that combines the concepts of intra-network proximity using vertex embedding,Belief Propagation (BP) and approximate weighted matching, and provides qualitative improvements up to22%over state-of-the-art approaches. We also provide scalable implementations on GPU accelerators, demonstrating up to19×speedup for Belief Propagation and 3× speedup for approximate weighted matching relative to previous multithreaded implementation. A combination of combinatorial and algebraic kernels within the network alignment algorithm poses significant hurdles for parallelization. Load imbalance and irregular DRAM traffic limit achievable performance on GPUs. Our novel approach identifies and exploits unique structural proper-ties of the BP-based algorithm and employs code fusion to reduce data movement between different steps of the algorithm. Using a diverse set of inputs, we demonstrate qualitative improvements of our algorithms, and performance gains of our GPU-accelerated implementation. We believe that our work will enable algorithmic improvements and practical applications of network alignment.

Xiang, Lizhi↗
DOE OSTI2024

Studying CPU and memory utilization of applications on Fujitsu A64FX and Nvidia Grace Superchip

ARM-based manycore CPU architectures are well-positioned to provide the rising memory throughput requirements of modern data intensive scientific applications in High Performance Computing (HPC). The Fujitsu A64FX CPU platform is based on the ARM v8.2A architecture, and is the processor of the flagship Japanese supercomputer - "Fugaku", which was previously ranked as the #1 supercomputer in the world according to the Top500 list. The Nvidia Grace superchip features 144 Neoverse V2 cores based on the ARMv9 architecture with 4x128b SVE2, providing exceptional computational power. The chip supports up to 480GB of memory, making it ideal for AI, machine learning, and scientific computing workloads. In this paper, we conduct a thorough performance exploration of a variety of parallel bandwidth-sensitive benchmarks and applications compiled with the native Fujitsu compiler on a Fugaku A64FX compute node and ARM (LLVM) Compiler on an NVIDIA Grace superchip compute node, engaging all the computational cores per cluster using OpenMP multithreading (assuming the cores can drive the available bandwidth). Our ultimate goals are to study the resource utilization of scientific applications and benchmarks on A64FX and Grace superchip, considering graph application scenarios ( GAP Benchmark suite) and eleven appli- cation proxies from the Rodinia heterogeneous benchmark suite (considering domains such as Data Mining, Bioinformatics, Fluid Dynamics, Pattern Recognition, etc.). Through exhaustive performance monitoring, we quantify the resource utilization of diverse OpenMP-based HPC applications on both the Fujitsu A64FX and the Nvidia Grace Superchip platforms.

benchmarking, Performance Analysis, High performan↗
DOE OSTI2025

FAIR Ecosystems for Science at Scale

High Performance Computing (HPC) centers provide resources to users who require greater scale to “get science done”. They deploy infrastructure with singular hardware architectures, cutting-edge software environments, and stricter security measures as compared with users’ own resources. As a result, users often create and configure digital artifacts in ways that are specialized for the unique infrastructure at a given HPC center. Each user of that center will face similar challenges as they develop specialized solutions to take full advantages of the center’s resources, potentially resulting in significant duplication of effort. Much duplicated effort could be avoided, however, if users of these centers found it easier to discover others’ solutions and artifacts as well as share their own. The FAIR principles address this problem by presenting guidelines focused around metadata practices to be implemented by vaguely defined “communities”; in practice, these tend to gather by domain (e.g. bioinformatics, geosciences, agriculture). Domain-based communities can unfortunately end up functioning as silos that tend both to inhibit sharing of solutions and best practices as well as to encourage fragile and unsustainable improvised solutions in the absence of best-practice guidance. We propose that these communities pursuing “science at scale” be nurtured both individually and collectively by HPC centers so that users can take advantage of shared challenges across disciplines and potentially across HPC centers. We describe an architecture based on the EOSC-Life FAIR Workflows Collaboratory, specialized for use with and inside HPC centers such as the Oak Ridge Leadership Computing Facility (OLCF), and we speculate on user incentives to encourage adoption. We note that a focus on FAIR workflow components rather than FAIR workflows is more likely to benefit the users of HPC centers.

Wilkinson, Sean [ORNL] (ORCID:0000000214437479)↗
DOE OSTI2026

CAHS: Context-Aware Homology Search

Protein homology search is foundational to bioinformatics: it supports annotation transfer, structure/function inference, and evolutionary analysis over rapidly expanding sequence repositories (e.g., UniProtKB). Profile hidden Markov models (pHMMs), as implemented in HMMER, remain the most widely trusted approach because they provide statistically calibrated E-values; however, their gap behavior is fixed once a profile is trained, despite biological evidence that insertion/deletion tolerance varies across flexible loops and intrinsically disordered regions. We present CAHS (Context-Aware Homology Search), a lightweight query-time adapter for pHMM search that incorporates learned and biologically motivated signals without changing HMMER's downstream search pipeline or its calibrated E-value reporting. Given a query sequence, CAHS computes per-residue representations from a protein language model and a disorder predictor, maps these to profile coordinates, and modulates only match-state transition rows (gap-open and gap-extension probabilities) while preserving Plan7 constraints. We comprehensively evaluate CAHS across six structurally diverse protein families and multi-domain architectures against a 570k-sequence target corpus. CAHS expands detection capability, retrieving thousands of additional remote homologs at relaxed thresholds by maintaining alignment quality through flexible regions. For multi-domain proteins, context-aware modulation resolves 94% of fragmented alignments. Crucially, CAHS preserves hit-set invariance at stringent operating points (E<10-10), demonstrating increased statistical confidence without inflating false positives. Furthermore, sharper statistical distinction between homologs and background noise during early filter stages yields up to a 3.87× acceleration in end-to-end wall-clock time on high-performance computing clusters. Overall, CAHS illustrates a practical AI-for-science design pattern: augmenting a trusted probabilistic model with query-specific learned signals to improve interpretable, reproducible inference in data-rich biology.

Bhattaram, Swethasree [Georgia Institute of Techno↗
DOE OSTI2023

Mechanism of Radical Initiation in the Radical SAM Enzyme Superfamily

Radical S-adenosylmethionine (SAM) enzymes use a site-differentiated [4Fe-4S] cluster and SAM to initiate radical reactions through liberation of the 5'-deoxyadenosyl (5'-dAdo•) radical. They form the largest enzyme superfamily, with more than 700,000 unique sequences currently, and their numbers continue to grow as a result of ongoing bioinformatics efforts. The range of extremely diverse, highly regio- and stereo-specific reactions known to be catalyzed by radical SAM superfamily members is remarkable. The common mechanism of radical initiation in the radical SAM superfamily is the focus of this review. Most surprising is the presence of an organometallic intermediate, Ω, exhibiting an Fe–C5'-adenosyl bond. Regioselective reductive cleavage of the SAM S–C5' bond produces 5'-dAdo• to form Ω, with the regioselectivity originating in the Jahn–Teller effect. Ω liberates the free 5'-dAdo• as the catalytically active intermediate through homolysis of the Fe–C5' bond, in analogy to Co–C5' bond homolysis in B 12 , which was once viewed as biology's choice of radical generator.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2015

Characterization of Fatty Acids in Crenarchaeota by GC-MS and NMR

Lipids composed of condensed isoprenyl units connected to glycerol backbones by ether linkages are a distinguishing feature of Archaea. Data suggesting that fatty acids with linear hydrocarbon chains are present in some Archaea have been available for decades. However, lack of genomic and biochemical evidence for the metabolic machinery required to synthesize and degrade fatty acids has left the field unclear on this potentially significant biochemical aspect. Because lipids are energy currency and cell signaling molecules, their presence in Archaea is significant for understanding archaeal biology. A recent large-scale bioinformatics analysis reignited the debate as to the importance of fatty acids in Archaea by presenting genetic evidence for the presence of enzymes required for anabolic and catabolic fatty acid metabolism across the archaeal domain. Here, we present direct biochemical evidence from gas chromatography-mass spectrometry (GC-MS) and nuclear magnetic resonance (NMR) spectroscopy for the presence of fatty acids in two members of the Crenarchaeota, Sulfolobus solfataricus and Ignicoccus hospitalis . This is the first report providing biochemical data for the existence of fatty acids in these Crenarchaeota, opening new discussions on energy balance and the potential for the discovery of new thermostable enzymes for industry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗