High-Throughput Structure-Based Drug Design (HT-SBDD) Using Drug Docking, Fragment Molecular Orbital Calculations, and Molecular Dynamic Techniques

Structure-based drug design (SBDD) is rapidly evolving to be a fundamental tool for faster and more cost-effective methods of lead drug discovery. SBDD aims to offer a computational replacement to traditional high-throughput screening (HTS) methods of drug discovery. This "virtual screening" technique utilizes the structural data of a target protein in conjunction with large databases of potential drug candidates and then applies a range of different computational techniques to determine which potential candidates are likely to bind with high affinity and efficacy. It is proposed that high-throughput SBDD (HT-SBDD) will significantly enrich the success rate of HTS methods, which currently fluctuates around ~1%. In this chapter, we focus on the theory and utility of high-throughput drug docking, fragment molecular orbital calculations, and molecular dynamics techniques. We also offer a comparative review of the benefits and limitations of traditional methods against more recent SBDD advances. As HT-SBDD is computationally intensive, we will also cover the important role high-performance computing (HPC) clusters play in the future of computational drug discovery.

Teaching Medical Students to Use Supercomputers: A Personal Reflection

At the "Kick Off" meeting for CompBioMed (compbiomed.eu), which was first funded in October 2016, I had no idea that one single sentence ("I wish I could teach this to medical students") would lead to a dedicated program of work to engage the clinicians and biomedical researchers of the future with supercomputing. This program of work which, within the CompBiomed Centre of Excellence, we have been calling "the CompBioMed Education and Training Programme," is a holistic endeavor that has been developed by and continues to be delivered with the expertise and support from experimental researchers, computer scientists, clinicians, HPC centers, and industrial partners within or associated with CompBioMed. The original description of the initial educational approach to training has previously been published (Townsend-Nicholson Interface Focus 10:20200003, 2020). In this chapter, I describe the refinements to the program and its delivery, emphasizing the highs and lows of delivering this program over the past 6 years. I conclude with suggestions for feasible measures that I believe will help overcome the barriers and challenges we have encountered in bringing a community of users with little familiarity of computing beyond the desktop to the petascale and beyond.

High-Density Exploration of Activity States in a Multi-Area Brain Model

To simulate whole brain dynamics with only a few equations, biophysical, mesoscopic models of local neuron populations can be connected using empirical tractography data. The development of mesoscopic mean-field models of neural populations, in particular, the Adaptive Exponential (AdEx mean-field model), has successfully summarized neuron-scale phenomena leading to the emergence of global brain dynamics associated with conscious (asynchronous and rapid dynamics) and unconscious (synchronized slow-waves, with Up-and-Down state dynamics) brain states, based on biophysical mechanisms operating at cellular scales (e.g. neuromodulatory regulation of spike-frequency adaptation during sleep-wake cycles or anesthetics). Using the Virtual Brain (TVB) environment to connect mean-field AdEx models, we have previously simulated the general properties of brain states, playing on spike-frequency adaptation, but have not yet performed detailed analyses of other parameters possibly also regulating transitions in brain-scale dynamics between different brain states. We performed a dense grid parameter exploration of the TVB-AdEx model, making use of High Performance Computing. We report a remarkable robustness of the effect of adaptation to induce synchronized slow-wave activity. Moreover, the occurrence of slow waves is often paralleled with a closer relation between functional and structural connectivity. We find that hyperpolarization can also generate unconscious-like synchronized Up and Down states, which may be a mechanism underlying the action of anesthetics. We conclude that the TVB-AdEx model reveals large-scale properties identified experimentally in sleep and anesthesia.

Introduction to High-Performance Computing

Since the first general-purpose computing machines came up in the middle of the twentieth century, computer science's popularity has been growing steadily until our time. The first computers represented a significant leap forward in automating calculations, so that several theoretical methods could be taken from paper into practice. The continuous need for increased computing capacity made computers evolve and become more and more powerful. Nowadays, high-performance computing (HPC) is a crucial component of scientific and technological advancement. This book chapter introduces the field of HPC, covering key concepts and essential terminology to understand this complex and rapidly evolving area. The chapter begins with an overview of what HPC is and how it differs from conventional computing. It then explores the various components and configurations of supercomputers, including shared memory systems, distributed memory systems, and hybrid systems and the different programming models used in HPC, including message passing, shared memory, and data parallelism. Finally, the chapter discusses significant challenges and future directions in supercomputing. Overall, this chapter provides a comprehensive introduction to the world of HPC and is an essential resource for anyone interested in this fascinating field.

Efficient and Reliable Data Management for Biomedical Applications

This chapter discusses the challenges and requirements of modern Research Data Management (RDM), particularly for biomedical applications in the context of high-performance computing (HPC). The FAIR data principles (Findable, Accessible, Interoperable, Reusable) are of special importance. Data formats, publication platforms, annotation schemata, automated data management and staging, the data infrastructure in HPC centers, file transfer and staging methods in HPC, and the EUDAT components are discussed. Tools and approaches for automated data movement and replication in cross-center workflows are explained, as well as the development of ontologies for structuring and quality-checking of metadata in computational biomedicine. The CompBioMed project is used as a real-world example of implementing these principles and tools in practice. The LEXIS project has built a workflow-execution and data management platform that follows the paradigm of HPC-Cloud convergence for demanding Big Data applications. It is used for orchestrating workflows with YORC, utilizing the data documentation initiative (DDI) and distributed computing resources (DCI). The platform is accessed by a user-friendly LEXIS portal for workflow and data management, making HPC and Cloud Computing significantly more accessible. Checkpointing, duplicate runs, and spare images of the data are used to create resilient workflows. The CompBioMed project is completing the implementation of such a workflow, using data replication and brokering, which will enable urgent computing on exascale platforms.

INDUCING REPRESENTATIONAL CHANGE IN THE HIPPOCAMPUS THROUGH REAL-TIME NEUROFEEDBACK

When you perceive or remember one thing, other related things come to mind. This competition has consequences for how these items are later perceived, attended, or remembered. Such behavioral consequences result from changes in how much the neural representations of the items overlap, especially in the hippocampus. These changes can reflect increased (integration) or decreased (differentiation) overlap; previous studies have posited that the amount of coactivation between competing representations in cortex determines which will occur: high coactivation leads to hippocampal integration, medium coactivation leads to differentiation, and low coactivation is inert. However, those studies used indirect proxies for coactivation, by manipulating stimulus similarity or task demands. Here we induce coactivation of competing memories in visual cortex more directly using closed-loop neurofeedback from real-time fMRI. While viewing one object, participants were rewarded for implicitly activating the representation of another object as strongly as possible. Across multiple real-time fMRI training sessions, they succeeded in using the neurofeedback to induce coactivation. Compared with untrained objects, this coactivation led to behavioral and neural integration: The trained objects became harder for participants to discriminate in a categorical perception task and harder to decode from patterns of fMRI activity in the hippocampus.

Effect of TAVR commissural alignment on coronary flow: A fluid-structure interaction analysis

BACKGROUND AND OBJECTIVES

Coronary obstruction is a complication that may affect patients receiving Transcatheter Aortic Valve Replacement (TAVR), with catastrophic consequences and long-term negative effects. To enable healthy coronary perfusion, it is fundamental to appropriately position the device with respect to the coronary ostia. Nonetheless, most TAVR delivery systems do not control commissural alignment to do so. Moreover, no in silico study has directly assessed the effect of commissural alignment on coronary perfusion. This work aims to evaluate the effect of TAVR commissural alignment on coronary perfusion and device performance.

METHODS

A two-way computational fluid-structure interaction model is used to predict coronary perfusion at different commissural alignments. Moreover, in each scenario, hemodynamic biomarkers are evaluated to assess device performance.

RESULTS

Commissural misalignment is shown to reduce the total coronary perfusion by -3.2% and the flow rate to a single coronary branch by -6.8%. It is also observed to impair valvular function by reducing the systolic geometric orifice area by -2.5% and increasing the systolic transvalvular pressure gradients by +5.3% and the diastolic leaflet stresses by +16.0%.

CONCLUSIONS

The present TAVR patient model indicates that coronary perfusion, hemodynamic and structural performance are minimized when the prosthesis commissures are fully misaligned with the native ones. These results support the importance of enabling axial control in new TAVR delivery catheter systems and defining recommended values of commissural alignment in upcoming clinical treatment guidelines.

lifex-ep: a robust and efficient software for cardiac electrophysiology simulations

BACKGROUND

Simulating the cardiac function requires the numerical solution of multi-physics and multi-scale mathematical models. This underscores the need for streamlined, accurate, and high-performance computational tools. Despite the dedicated endeavors of various research teams, comprehensive and user-friendly software programs for cardiac simulations, capable of accurately replicating both normal and pathological conditions, are still in the process of achieving full maturity within the scientific community.

RESULTS

This work introduces [Formula: see text]-ep, a publicly available software for numerical simulations of the electrophysiology activity of the cardiac muscle, under both normal and pathological conditions. [Formula: see text]-ep employs the monodomain equation to model the heart's electrical activity. It incorporates both phenomenological and second-generation ionic models. These models are discretized using the Finite Element method on tetrahedral or hexahedral meshes. Additionally, [Formula: see text]-ep integrates the generation of myocardial fibers based on Laplace-Dirichlet Rule-Based Methods, previously released in Africa et al., 2023, within [Formula: see text]-fiber. As an alternative, users can also choose to import myofibers from a file. This paper provides a concise overview of the mathematical models and numerical methods underlying [Formula: see text]-ep, along with comprehensive implementation details and instructions for users. [Formula: see text]-ep features exceptional parallel speedup, scaling efficiently when using up to thousands of cores, and its implementation has been verified against an established benchmark problem for computational electrophysiology. We showcase the key features of [Formula: see text]-ep through various idealized and realistic simulations conducted in both normal and pathological scenarios. Furthermore, the software offers a user-friendly and flexible interface, simplifying the setup of simulations using self-documenting parameter files.

CONCLUSIONS

[Formula: see text]-ep provides easy access to cardiac electrophysiology simulations for a wide user community. It offers a computational tool that integrates models and accurate methods for simulating cardiac electrophysiology within a high-performance framework, while maintaining a user-friendly interface. [Formula: see text]-ep represents a valuable tool for conducting in silico patient-specific simulations.

Memory-friendly fixed-point iteration method for nonlinear surface mode oscillations of acoustically driven bubbles: from the perspective of high-performance GPU programming

A fixed-point iteration technique is presented to handle the implicit nature of the governing equations of nonlinear surface mode oscillations of acoustically excited microbubbles. The model is adopted from the theoretical work of Shaw [1], where the dynamics of the mean bubble radius and the surface modes are bi-directionally coupled via nonlinear terms. The model comprises a set of second-order ordinary differential equations. It extends the classic Keller-Miksis equation and the linearized dynamical equations for each surface mode. Only the implicit parts (containing the second derivatives) are reevaluated during the iteration process. The performance of the technique is tested at various parameter combinations. The majority of the test cases needs only a single reevaluation to achieve 10-9 error. Although the arithmetic operation count is higher than the Gauss elimination, due to its memory-friendly matrix-free nature, it is a viable alternative for high-performance GPU computations of massive parameter studies.

Mechanical fatigue testing in silico: Dynamic evolution of material properties of nanoscale biological particles

Biological particles have evolved to possess mechanical characteristics necessary to carry out their functions. We developed a computational approach to "fatigue testing in silico", in which constant-amplitude cyclic loading is applied to a particle to explore its mechanobiology. We used this approach to describe dynamic evolution of nanomaterial properties and low-cycle fatigue in the thin spherical encapsulin shell, thick spherical Cowpea Chlorotic Mottle Virus (CCMV) capsid, and thick cylindrical microtubule (MT) fragment over 20 cycles of deformation. Changing structures and force-deformation curves enabled us to describe their damage-dependent biomechanics (strength, deformability, stiffness), thermodynamics (released and dissipated energies, enthalpy, and entropy) and material properties (toughness). Thick CCMV and MT particles experience material fatigue due to slow recovery and damage accumulation over 3-5 loading cycles; thin encapsulin shells show little fatigue due to rapid remodeling and limited damage. The results obtained challenge the existing paradigm: damage in biological particles is partially reversible owing to particle's partial recovery; fatigue crack may or may not grow with each loading cycle and may heal; and particles adapt to deformation amplitude and frequency to minimize the energy dissipated. Using crack size to quantitate damage is problematic as several cracks might form simultaneously in a particle. Dynamic evolution of strength, deformability, and stiffness, can be predicted by analyzing the cycle number (N) dependent damage, [Formula: see text] , where α is a power law and Nf is fatigue life. Fatigue testing in silico can now be used to explore damage-induced changes in the material properties of other biological particles. STATEMENT OF SIGNIFICANCE: Biological particles possess mechanical characteristics necessary to perform their functions. We developed "fatigue testing in silico" approach, which employes Langevin Dynamics simulations of constant-amplitude cyclic loading of nanoscale biological particles, to explore dynamic evolution of the mechanical, energetic, and material properties of the thin and thick spherical particles of encapsulin and Cowpea Chlorotic Mottle Virus, and the microtubule filament fragment. Our study of damage growth and fatigue development challenge the existing paradigm. Damage in biological particles is partially reversible as fatigue crack might heal with each loading cycle. Particles adapt to deformation amplitude and frequency to minimize energy dissipation. The evolution of strength, deformability, and stiffness, can be accurately predicted by analyzing the damage growth in particle structure.

Accelerating 4D image reconstruction for magnetic resonance-guided radiotherapy

Background and purpose

Physiological motion impacts the dose delivered to tumours and vital organs in external beam radiotherapy and particularly in particle therapy. The excellent soft-tissue demarcation of 4D magnetic resonance imaging (4D-MRI) could inform on intra-fractional motion, but long image reconstruction times hinder its use in online treatment adaptation. Here we employ techniques from high-performance computing to reduce 4D-MRI reconstruction times below two minutes to facilitate their use in MR-guided radiotherapy.

Material and methods

Four patients with pancreatic adenocarcinoma were scanned with a radial stack-of-stars gradient echo sequence on a 1.5T MR-Linac. Fast parallelised open-source implementations of the extra-dimensional golden-angle radial sparse parallel algorithm were developed for central processing unit (CPU) and graphics processing unit (GPU) architectures. We assessed the impact of architecture, oversampling and respiratory binning strategy on 4D-MRI reconstruction time and compared images using the structural similarity (SSIM) index against a MATLAB reference implementation. Scaling and bottlenecks for the different architectures were studied using multi-GPU systems.

Results

All reconstructed 4D-MRI were identical to the reference implementation (SSIM > 0.99). Images reconstructed with overlapping respiratory bins were sharper at the cost of longer reconstruction times. The CPU  + GPU implementation was over 17 times faster than the reference implementation, reconstructing images in 60 ± 1 s and hyper-scaled using multiple GPUs.

Conclusion

Respiratory-resolved 4D-MRI reconstruction times can be reduced using high-performance computing methods for online workflows in MR-guided radiotherapy with potential applications in particle therapy.

Mechanobiology of the relocation of proteins in advecting cells: in vitro experiments, multi-physics modeling, and simulations

Cell motility-a cellular behavior of paramount relevance in embryonic development, immunological response, metastasis, or angiogenesis-demands a mechanical deformation of the cell membrane and influences the surface motion of molecules and their biochemical interactions. In this work, we develop a fully coupled multi-physics model able to capture and predict the protein flow on endothelial advecting plasma membranes. The model has been validated against co-designed in vitro experiments. The complete picture of the receptor dynamics has been understood, and limiting factors have been identified together with the laws that regulate receptor polarization. This computational approach might be insightful in the prediction of endothelial cell behavior in different tumoral environments, circumventing the time-consuming and expensive empirical characterization of each tumor.

lifex-fiber: an open tool for myofibers generation in cardiac computational models

BACKGROUND

Modeling the whole cardiac function involves the solution of several complex multi-physics and multi-scale models that are highly computationally demanding, which call for simpler yet accurate, high-performance computational tools. Despite the efforts made by several research groups, no software for whole-heart fully-coupled cardiac simulations in the scientific community has reached full maturity yet.

RESULTS

In this work we present [Formula: see text]-fiber, an innovative tool for the generation of myocardial fibers based on Laplace-Dirichlet Rule-Based Methods, which are the essential building blocks for modeling the electrophysiological, mechanical and electromechanical cardiac function, from single-chamber to whole-heart simulations. [Formula: see text]-fiber is the first publicly released module for cardiac simulations based on [Formula: see text], an open-source, high-performance Finite Element solver for multi-physics, multi-scale and multi-domain problems developed in the framework of the iHEART project, which aims at making in silico experiments easily reproducible and accessible to a wide community of users, including those with a background in medicine or bio-engineering.

CONCLUSIONS

The tool presented in this document is intended to provide the scientific community with a computational tool that incorporates general state of the art models and solvers for simulating the cardiac function within a high-performance framework that exposes a user- and developer-friendly interface. This report comes with an extensive technical and mathematical documentation to welcome new users to the core structure of [Formula: see text]-fiber and to provide them with a possible approach to include the generated cardiac fibers into more sophisticated computational pipelines. In the near future, more modules will be successively published either as pre-compiled binaries for x86-64 Linux systems or as open source software.

transXpress: a Snakemake pipeline for streamlined de novo transcriptome assembly and annotation

BACKGROUND

RNA-seq followed by de novo transcriptome assembly has been a transformative technique in biological research of non-model organisms, but the computational processing of RNA-seq data entails many different software tools. The complexity of these de novo transcriptomics workflows therefore presents a major barrier for researchers to adopt best-practice methods and up-to-date versions of software.

RESULTS

Here we present a streamlined and universal de novo transcriptome assembly and annotation pipeline, transXpress, implemented in Snakemake. transXpress supports two popular assembly programs, Trinity and rnaSPAdes, and allows parallel execution on heterogeneous cluster computing hardware.

CONCLUSIONS

transXpress simplifies the use of best-practice methods and up-to-date software for de novo transcriptome assembly, and produces standardized output files that can be mined using SequenceServer to facilitate rapid discovery of new genes and proteins in non-model organisms.

Co-packaged optics (CPO): status, challenges, and solutions

Due to the rise of 5G, IoT, AI, and high-performance computing applications, datacenter traffic has grown at a compound annual growth rate of nearly 30%. Furthermore, nearly three-fourths of the datacenter traffic resides within datacenters. The conventional pluggable optics increases at a much slower rate than that of datacenter traffic. The gap between application requirements and the capability of conventional pluggable optics keeps increasing, a trend that is unsustainable. Co-packaged optics (CPO) is a disruptive approach to increasing the interconnecting bandwidth density and energy efficiency by dramatically shortening the electrical link length through advanced packaging and co-optimization of electronics and photonics. CPO is widely regarded as a promising solution for future datacenter interconnections, and silicon platform is the most promising platform for large-scale integration. Leading international companies (e.g., Intel, Broadcom and IBM) have heavily investigated in CPO technology, an inter-disciplinary research field that involves photonic devices, integrated circuits design, packaging, photonic device modeling, electronic-photonic co-simulation, applications, and standardization. This review aims to provide the readers a comprehensive overview of the state-of-the-art progress of CPO in silicon platform, identify the key challenges, and point out the potential solutions, hoping to encourage collaboration between different research fields to accelerate the development of CPO technology.

Improving drug discovery through parallelism

Compound identification in ligand-based virtual screening is limited by two key issues: the quality and the time needed to obtain predictions. In this sense, we designed OptiPharm, an algorithm that obtained excellent results in improving the sequential methods in the literature. In this work, we go a step further and propose its parallelization. Specifically, we propose a two-layer parallelization. Firstly, an automation of the molecule distribution process between the available nodes in a cluster, and secondly, a parallelization of the internal methods (initialization, reproduction, selection and optimization). This new software, called pOptiPharm, aims to improve the quality of predictions and reduce experimentation time. As the results show, the performance of the proposed methods is good. It can find better solutions than the sequential OptiPharm, all while reducing its computation time almost proportionally to the number of processing units considered.

Effect of neural network structure in accelerating performance and accuracy of a convolutional neural network with GPU/TPU for image analytics

BACKGROUND

In deep learning the most significant breakthrough in the field of image recognition, object detection language processing was done by Convolutional Neural Network (CNN). Rapid growth in data and neural networks the performance of the DNN algorithms depends on the computation power and the storage capacity of the devices.

METHODS

In this paper, the convolutional neural network used for various image applications was studied and its acceleration in the various platforms like CPU, GPU, TPU was done. The neural network structure and the computing power and characteristics of the GPU, TPU was analyzed and summarized, the effect of these on accelerating the tasks is also explained. Cross-platform comparison of the CNN was done using three image applications the face mask detection (object detection/Computer Vision), Virus Detection in Plants (Image Classification: agriculture sector), and Pneumonia detection from X-ray Images (Image Classification/medical field).

RESULTS

The CNN implementation was done and a comprehensive comparison was done on the platforms to identify the performance, throughput, bottlenecks, and training time. The CNN layer-wise execution in GPU and TPU is explained with layer-wise analysis. The impact of the fully connected layer and convolutional layer on the network is analyzed. The challenges faced during the acceleration process were discussed and future works are identified.

Immune Repertoire Analysis on High-Performance Computing Using VDJServer V1: A Method by the AIRR Community

AIRR-seq data sets are usually large and require specialized analysis methods and software tools. A typical Illumina MiSeq sequencing run generates 20-30 million 2 × 300 bp paired-end sequence reads, which roughly corresponds to 15 GB of sequence data to be processed. Other platforms like NextSeq, which is useful in projects where the full V gene is not needed, create about 400 million 2 × 150 bp paired-end reads. Because of the size of the data sets, the analysis can be computationally expensive, particularly the early analysis steps like preprocessing and gene annotation that process the majority of the sequence data. A standard desktop PC may take 3-5 days of constant processing for a single MiSeq run, so dedicated high-performance computational resources may be required.VDJServer provides free access to high-performance computing (HPC) at the Texas Advanced Computing Center (TACC) through a graphical user interface (Christley et al. Front Immunol 9:976, 2018). VDJServer is a cloud-based analysis portal for immune repertoire sequence data that provides access to a suite of tools for a complete analysis workflow, including modules for preprocessing and quality control of sequence reads, V(D)J gene assignment, repertoire characterization, and repertoire comparison. Furthermore, VDJServer has parallelized execution for tools such as IgBLAST, so more compute resources are utilized as the size of the input data grows. Analysis that takes days on a desktop PC might take only a few hours on VDJServer. VDJServer is a free, publicly available, and open-source licensed resource. Here, we describe the workflow for performing immune repertoire analysis on VDJServer's high-performance computing.

An effective simulation- and measurement-based workflow for enhanced diagnostics in rhinology

Physics-based analyses have the potential to consolidate and substantiate medical diagnoses in rhinology. Such methods are frequently subject to intense investigations in research. However, they are not used in clinical applications, yet. One issue preventing their direct integration is that these methods are commonly developed as isolated solutions which do not consider the whole chain of data processing from initial medical to higher valued data. This manuscript presents a workflow that incorporates the whole data processing pipeline based on a Jupyter environment. Therefore, medical image data are fully automatically pre-processed by machine learning algorithms. The resulting geometries employed for the simulations on high-performance computing systems reach an accuracy of up to 99.5% compared to manually segmented geometries. Additionally, the user is enabled to upload and visualize 4-phase rhinomanometry data. Subsequent analysis and visualization of the simulation outcome extend the results of standardized diagnostic methods by a physically sound interpretation. Along with a detailed presentation of the methodologies, the capabilities of the workflow are demonstrated by evaluating an exemplary medical case. The pipeline output is compared to 4-phase rhinomanometry data. The comparison underlines the functionality of the pipeline. However, it also illustrates the influence of mucosa swelling on the simulation. Graphical Abstract Workflow for enhanced diagnostics in rhinology.

Uncertainty in geospatial health: challenges and opportunities ahead

PURPOSE

Uncertainty is not always well captured, understood, or modeled properly, and can bias the robustness of complex relationships, such as the association between the environment and public health through exposure, estimates of geographic accessibility and cluster detection, to name a few.

METHODS

We review current challenges and future opportunities as geospatial data and analyses are applied to the field of public health. We are particularly interested in the sources of uncertainty in geospatial data and how this uncertainty may propagate in spatial analysis.

RESULTS

We present opportunities to reduce the magnitude and impact of uncertainty. Specifically, we focus on (1) the use of multiple reference data sources to reduce geocoding errors, (2) the validity of online geocoders and how confidentiality (e.g., HIPAA) may be breached, (3) use of multiple reference data sources to reduce geocoding errors, (4) the impact of geoimputation techniques on travel estimates, (5) residential mobility and how it affects accessibility metrics and clustering, and (6) modeling errors in the American Community Survey. Our paper discusses how to communicate spatial and spatiotemporal uncertainty, and high-performance computing to conduct large amounts of simulations to ultimately increase statistical robustness for studies in public health.

CONCLUSIONS

Our paper contributes to recent efforts to fill in knowledge gaps at the intersection of spatial uncertainty and public health.

Manual Annotation Studio (MAS): a collaborative platform for manual functional annotation of viral and microbial genomes

Background

Functional genome annotation is the process of labelling functional genomic regions with descriptive information. Manual curation can produce higher quality genome annotations than fully automated methods. Manual annotation efforts are time-consuming and complex; however, software can help reduce these drawbacks.

Results

We created Manual Annotation Studio (MAS) to improve the efficiency of the process of manual functional annotation prokaryotic and viral genomes. MAS allows users to upload unannotated genomes, provides an interface to edit and upload annotations, tracks annotation history and progress, and saves data to a relational database. MAS provides users with pertinent information through a simple point and click interface to execute and visualize results for multiple homology search tools (blastp, rpsblast, and HHsearch) against multiple databases (Swiss-Prot, nr, CDD, PDB, and an internally generated database). MAS was designed to accept connections over the local area network (LAN) of a lab or organization so multiple users can access it simultaneously. MAS can take advantage of high-performance computing (HPC) clusters by interfacing with SGE or SLURM and data can be exported from MAS in a variety of formats (FASTA, GenBank, GFF, and excel).

Conclusions

MAS streamlines and provides structure to manual functional annotation projects. MAS enhances the ability of users to generate, interpret, and compare results from multiple tools. The structure that MAS provides can improve project organization and reduce annotation errors. MAS is ideal for team-based annotation projects because it facilitates collaboration.

Supplementary Information

The online version contains supplementary material available at 10.1186/s12864-021-08029-8.

Large-Scale Molecular Dynamics Simulations of Cellular Compartments

Molecular dynamics or MD simulation is gradually maturing into a tool for constructing in vivo models of living cells in atomistic details. The feasibility of such models is bolstered by integrating the simulations with data from microscopic, tomographic and spectroscopic experiments on exascale supercomputers, facilitated by the use of deep learning technologies. Over time, MD simulation has evolved from tens of thousands of atoms to over 100 million atoms comprising an entire cell organelle, a photosynthetic chromatophore vesicle from a purple bacterium. In this chapter, we present a step-by-step outline for preparing, executing and analyzing such large-scale MD simulations of biological systems that are essential to life processes. All scripts are provided via GitHub.

In situ visualization of large-scale turbulence simulations in Nek5000 with ParaView Catalyst

In situ visualization on high-performance computing systems allows us to analyze simulation results that would otherwise be impossible, given the size of the simulation data sets and offline post-processing execution time. We develop an in situ adaptor for Paraview Catalyst and Nek5000, a massively parallel Fortran and C code for computational fluid dynamics. We perform a strong scalability test up to 2048 cores on KTH's Beskow Cray XC40 supercomputer and assess in situ visualization's impact on the Nek5000 performance. In our study case, a high-fidelity simulation of turbulent flow, we observe that in situ operations significantly limit the strong scalability of the code, reducing the relative parallel efficiency to only ≈ 21 % on 2048 cores (the relative efficiency of Nek5000 without in situ operations is ≈ 99 % ). Through profiling with Arm MAP, we identified a bottleneck in the image composition step (that uses the Radix-kr algorithm) where a majority of the time is spent on MPI communication. We also identified an imbalance of in situ processing time between rank 0 and all other ranks. In our case, better scaling and load-balancing in the parallel image composition would considerably improve the performance of Nek5000 with in situ capabilities. In general, the result of this study highlights the technical challenges posed by the integration of high-performance simulation codes and data-analysis libraries and their practical use in complex cases, even when efficient algorithms already exist for a certain application scenario.

Neuroimaging PheWAS (Phenome-Wide Association Study): A Free Cloud-Computing Platform for Big-Data, Brain-Wide Imaging Association Studies

Large-scale, case-control genome-wide association studies (GWASs) have revealed genetic variations associated with diverse neurological and psychiatric disorders. Recent advances in neuroimaging and genomic databases of large healthy and diseased cohorts have empowered studies to characterize effects of the discovered genetic factors on brain structure and function, implicating neural pathways and genetic mechanisms in the underlying biology. However, the unprecedented scale and complexity of the imaging and genomic data requires new advanced biomedical data science tools to manage, process and analyze the data. In this work, we introduce Neuroimaging PheWAS (phenome-wide association study): a web-based system for searching over a wide variety of brain-wide imaging phenotypes to discover true system-level gene-brain relationships using a unified genotype-to-phenotype strategy. This design features a user-friendly graphical user interface (GUI) for anonymous data uploading, study definition and management, and interactive result visualizations as well as a cloud-based computational infrastructure and multiple state-of-art methods for statistical association analysis and multiple comparison correction. We demonstrated the potential of Neuroimaging PheWAS with a case study analyzing the influences of the apolipoprotein E (APOE) gene on various brain morphological properties across the brain in the Alzheimer's Disease Neuroimaging Initiative (ADNI) cohort. Benchmark tests were performed to evaluate the system's performance using data from UK Biobank. The Neuroimaging PheWAS system is freely available. It simplifies the execution of PheWAS on neuroimaging data and provides an opportunity for imaging genetics studies to elucidate routes at play for specific genetic variants on diseases in the context of detailed imaging phenotypic data.

Numerical simulations of paper-based electrophoretic separations with open-source tools

A new tool for the solution of electromigrative separations in paper-based microfluidics devices is presented. The implementation is based on a recently published complete mathematical model for describing these types of separations, and was developed on top of the open-source toolbox electroMicroTransport, based on OpenFOAM^® , inheriting all its features as native 3D problem handling, support for parallel computation, and a GNU GPL license. The presented tool includes full support for paper-based electromigrative separations (including EOF and the novel mechanical and electrical dispersion effects), compatibility with a well-recognized electrolyte database, and a novel algorithm for computing and controlling the electric current in arbitrary geometries. Additionally, the installation on any operating system is available due to its novel installation option in the form of a Docker image. A validation example with data from literature is included, and two extra application examples are provided, including a 2D free-flow IEF problem, which demonstrates the capabilities of the toolbox for dealing with computational and physicochemical modeling challenges simultaneously. This tool will enable efficient and reliable numerical prototypes of paper-based electrophoretic devices to accompany the contemporary fast growth in paper-based microfluidics.

ProkEvo: an automated, reproducible, and scalable framework for high-throughput bacterial population genomics analyses

Whole Genome Sequence (WGS) data from bacterial species is used for a variety of applications ranging from basic microbiological research, diagnostics, and epidemiological surveillance. The availability of WGS data from hundreds of thousands of individual isolates of individual microbial species poses a tremendous opportunity for discovery and hypothesis-generating research into ecology and evolution of these microorganisms. Flexibility, scalability, and user-friendliness of existing pipelines for population-scale inquiry, however, limit applications of systematic, population-scale approaches. Here, we present ProkEvo, an automated, scalable, reproducible, and open-source framework for bacterial population genomics analyses using WGS data. ProkEvo was specifically developed to achieve the following goals: (1) Automation and scaling of complex combinations of computational analyses for many thousands of bacterial genomes from inputs of raw Illumina paired-end sequence reads; (2) Use of workflow management systems (WMS) such as Pegasus WMS to ensure reproducibility, scalability, modularity, fault-tolerance, and robust file management throughout the process; (3) Use of high-performance and high-throughput computational platforms; (4) Generation of hierarchical-based population structure analysis based on combinations of multi-locus and Bayesian statistical approaches for classification for ecological and epidemiological inquiries; (5) Association of antimicrobial resistance (AMR) genes, putative virulence factors, and plasmids from curated databases with the hierarchically-related genotypic classifications; and (6) Production of pan-genome annotations and data compilation that can be utilized for downstream analysis such as identification of population-specific genomic signatures. The scalability of ProkEvo was measured with two datasets comprising significantly different numbers of input genomes (one with ~2,400 genomes, and the second with ~23,000 genomes). Depending on the dataset and the computational platform used, the running time of ProkEvo varied from ~3-26 days. ProkEvo can be used with virtually any bacterial species, and the Pegasus WMS uniquely facilitates addition or removal of programs from the workflow or modification of options within them. To demonstrate versatility of the ProkEvo platform, we performed a hierarchical-based population structure analyses from available genomes of three distinct pathogenic bacterial species as individual case studies. The specific case studies illustrate how hierarchical analyses of population structures, genotype frequencies, and distribution of specific gene functions can be integrated into an analysis. Collectively, our study shows that ProkEvo presents a practical viable option for scalable, automated analyses of bacterial populations with direct applications for basic microbiology research, clinical microbiological diagnostics, and epidemiological surveillance.

Simulation of the ductile machining mode of silicon

Diamond wire sawing has been developed to reduce the cutting loss when cutting silicon wafers from ingots. The surface of silicon solar cells must be flawless in order to achieve the highest possible efficiency. However, the surface is damaged during sawing. The extent of the damage depends primarily on the material removal mode. Under certain conditions, the generally brittle material can be machined in ductile mode, whereby considerably fewer cracks occur in the surface than with brittle material removal. In the presented paper, a numerical model is developed in order to support the optimisation of the machining process regarding the transition between ductile and brittle material removal. The simulations are performed with an GPU-accelerated in-house developed code using mesh-free methods which easily handle large deformations while classic methods like FEM would require intensive remeshing. The Johnson-Cook flow stress model is implemented and used to evaluate the applicability of a model for ductile material behaviour in the transition zone between ductile and brittle removal mode. The simulation results are compared with results obtained from single grain scratch experiments using a real, non-idealised grain geometry as present in the diamond wire sawing process.

The ethical use of high-performance computing and artificial intelligence: fighting COVID-19 at Barcelona Supercomputing Center

The COVID-19 pandemic has created an extraordinary medical, economic and humanitarian emergency. Artificial intelligence, in combination with other digital technologies, is being used as a tool to support the fight against the viral pandemic that has affected the entire world since the beginning of 2020. Barcelona Supercomputing Center collaborates in the battle against the coronavirus in different areas: the application of bioinformatics for the research on the virus and its possible treatments, the use of artificial intelligence, natural language processing and big data techniques to analyse the spread and impact of the pandemic, and the use of the MareNostrum 4 supercomputer to enable massive analysis on COVID-19 data. Many of these activities have included the use of personal and sensitive data of citizens, which, even during a pandemic, should be treated and handled with care. In this work we discuss our approach based on an ethical, transparent and fair use of this information, an approach aligned with the guidelines proposed by the European Union.

Accelerated global sensitivity analysis of genome-wide constraint-based metabolic models

Background

Genome-wide reconstructions of metabolism opened the way to thorough investigations of cell metabolism for health care and industrial purposes. However, the predictions offered by Flux Balance Analysis (FBA) can be strongly affected by the choice of flux boundaries, with particular regard to the flux of reactions that sink nutrients into the system. To mitigate possible errors introduced by a poor selection of such boundaries, a rational approach suggests to focus the modeling efforts on the pivotal ones.

Methods

In this work, we present a methodology for the automatic identification of the key fluxes in genome-wide constraint-based models, by means of variance-based sensitivity analysis. The goal is to identify the parameters for which a small perturbation entails a large variation of the model outcomes, also referred to as sensitive parameters. Due to the high number of FBA simulations that are necessary to assess sensitivity coefficients on genome-wide models, our method exploits a master-slave methodology that distributes the computation on massively multi-core architectures. We performed the following steps: (1) we determined the putative parameterizations of the genome-wide metabolic constraint-based model, using Saltelli’s method; (2) we applied FBA to each parameterized model, distributing the massive amount of calculations over multiple nodes by means of MPI; (3) we then recollected and exploited the results of all FBA runs to assess a global sensitivity analysis.

Results

We show a proof-of-concept of our approach on latest genome-wide reconstructions of human metabolism Recon2.2 and Recon3D. We report that most sensitive parameters are mainly associated with the intake of essential amino acids in Recon2.2, whereas in Recon 3D they are associated largely with phospholipids. We also illustrate that in most cases there is a significant contribution of higher order effects.

Conclusion

Our results indicate that interaction effects between different model parameters exist, which should be taken into account especially at the stage of calibration of genome-wide models, supporting the importance of a global strategy of sensitivity analysis.

Supplementary Information

The online version contains supplementary material available at 10.1186/s12859-021-04002-0.

Inferring Core Genome Phylogenies for Bacteria

Due to the increasing availability of public bacterial genome data and cost efficiency of novel bacterial strain sequencing, phylogenetic analyses based on more than a single or few marker genes have become feasible. In this method protocol, we describe the complete bioinformatic workflow from raw genomic data to final phylogenetic analyses based on 107 conserved single copy genes. This approach can be used to perform phylogenetic reconstructions with high resolution on strain level or across taxa spanning different clades of the bacterial tree of life.

Fast and Accurate Multiple Sequence Alignment with MSAProbs-MPI

Multiple sequence alignment (MSA) is a central step in many bioinformatics and computational biology analyses. Although there exist many methods to perform MSA, most of them fail when dealing with large datasets due to their high computational cost. MSAProbs-MPI is a publicly available tool ( http://msaprobs.sourceforge.net ) that provides highly accurate results in relatively short runtime thanks to exploiting the hardware resources of multicore clusters. In this chapter, I explain the statistical and biological concepts employed in MSAProbs-MPI to complete the alignments, as well as the high-performance computing techniques used to accelerate it. Moreover, I provide some hints about the configuration parameters that should be used to guarantee high-performance executions.

Accelerated training of bootstrap aggregation-based deep information extraction systems from cancer pathology reports

OBJECTIVE

In machine learning, it is evident that the classification of the task performance increases if bootstrap aggregation (bagging) is applied. However, the bagging of deep neural networks takes tremendous amounts of computational resources and training time. The research question that we aimed to answer in this research is whether we could achieve higher task performance scores and accelerate the training by dividing a problem into sub-problems.

MATERIALS AND METHODS

The data used in this study consist of free text from electronic cancer pathology reports. We applied bagging and partitioned data training using Multi-Task Convolutional Neural Network (MT-CNN) and Multi-Task Hierarchical Convolutional Attention Network (MT-HCAN) classifiers. We split a big problem into 20 sub-problems, resampled the training cases 2,000 times, and trained the deep learning model for each bootstrap sample and each sub-problem-thus, generating up to 40,000 models. We performed the training of many models concurrently in a high-performance computing environment at Oak Ridge National Laboratory (ORNL).

RESULTS

We demonstrated that aggregation of the models improves task performance compared with the single-model approach, which is consistent with other research studies; and we demonstrated that the two proposed partitioned bagging methods achieved higher classification accuracy scores on four tasks. Notably, the improvements were significant for the extraction of cancer histology data, which had more than 500 class labels in the task; these results show that data partition may alleviate the complexity of the task. On the contrary, the methods did not achieve superior scores for the tasks of site and subsite classification. Intrinsically, since data partitioning was based on the primary cancer site, the accuracy depended on the determination of the partitions, which needs further investigation and improvement.

CONCLUSION

Results in this research demonstrate that 1. The data partitioning and bagging strategy achieved higher performance scores. 2. We achieved faster training leveraged by the high-performance Summit supercomputer at ORNL.

Sensitivity analysis of a strongly-coupled human-based electromechanical cardiac model: Effect of mechanical parameters on physiologically relevant biomarkers

The human heart beats as a result of multiscale nonlinear dynamics coupling subcellular to whole organ processes, achieving electrophysiologically-driven mechanical contraction. Computational cardiac modelling and simulation have achieved a great degree of maturity, both in terms of mathematical models of underlying biophysical processes and the development of simulation software. In this study, we present the detailed description of a human-based physiologically-based, and fully-coupled ventricular electromechanical modelling and simulation framework, and a sensitivity analysis focused on its mechanical properties. The biophysical detail of the model, from ionic to whole-organ, is crucial to enable future simulations of disease and drug action. Key novelties include the coupling of state-of-the-art human-based electrophysiology membrane kinetics, excitation-contraction and active contraction models, and the incorporation of a pre-stress model to allow for pre-stressing and pre-loading the ventricles in a dynamical regime. Through high performance computing simulations, we demonstrate that 50% to 200% - 1000% variations in key parameters result in changes in clinically-relevant mechanical biomarkers ranging from diseased to healthy values in clinical studies. Furthermore mechanical biomarkers are primarily affected by only one or two parameters. Specifically, ejection fraction is dominated by the scaling parameter of the active tension model and its scaling parameter in the normal direction ( k ort 2 ); the end systolic pressure is dominated by the pressure at which the ejection phase is triggered ( P ej ) and the compliance of the Windkessel fluid model ( C ); and the longitudinal fractional shortening is dominated by the fibre angle ( ϕ ) and k ort 2 . The wall thickening does not seem to be clearly dominated by any of the considered input parameters. In summary, this study presents in detail the description and implementation of a human-based coupled electromechanical modelling and simulation framework, and a high performance computing study on the sensitivity of mechanical biomarkers to key model parameters. The tools and knowledge generated enable future investigations into disease and drug action on human ventricles.

sv-callers: a highly portable parallel workflow for structural variant detection in whole-genome sequence data

Structural variants (SVs) are an important class of genetic variation implicated in a wide array of genetic diseases including cancer. Despite the advances in whole genome sequencing, comprehensive and accurate detection of SVs in short-read data still poses some practical and computational challenges. We present sv-callers, a highly portable workflow that enables parallel execution of multiple SV detection tools, as well as provide users with example analyses of detected SV callsets in a Jupyter Notebook. This workflow supports easy deployment of software dependencies, configuration and addition of new analysis tools. Moreover, porting it to different computing systems requires minimal effort. Finally, we demonstrate the utility of the workflow by performing both somatic and germline SV analyses on different high-performance computing systems.

Parallelisation strategies for agent based simulation of immune systems

BACKGROUND

In recent years, the study of immune response behaviour using bottom up approach, Agent Based Modeling (ABM), has attracted considerable efforts. The ABM approach is a very common technique in the biological domain due to high demand for a large scale analysis tools for the collection and interpretation of information to solve biological problems. Simulating massive multi-agent systems (i.e. simulations containing a large number of agents/entities) requires major computational effort which is only achievable through the use of parallel computing approaches.

RESULTS

This paper explores different approaches to parallelising the key component of biological and immune system models within an ABM model: pairwise interactions. The focus of this paper is on the performance and algorithmic design choices of cell interactions in continuous and discrete space where agents/entities are competing to interact with one another within a parallel environment.

CONCLUSIONS

Our performance results demonstrate the applicability of these methods to a broader class of biological systems exhibiting typical cell to cell interactions. The advantage and disadvantage of each implementation is discussed showing each can be used as the basis for developing complete immune system models on parallel hardware.

How Big Data and High-performance Computing Drive Brain Science

Brain science accelerates the study of intelligence and behavior, contributes fundamental insights into human cognition, and offers prospective treatments for brain disease. Faced with the challenges posed by imaging technologies and deep learning computational models, big data and high-performance computing (HPC) play essential roles in studying brain function, brain diseases, and large-scale brain models or connectomes. We review the driving forces behind big data and HPC methods applied to brain science, including deep learning, powerful data analysis capabilities, and computational performance solutions, each of which can be used to improve diagnostic accuracy and research output. This work reinforces predictions that big data and HPC will continue to improve brain science by making ultrahigh-performance analysis possible, by improving data standardization and sharing, and by providing new neuromorphic insights.

Advancing HIV Vaccine Research With Low-Cost High-Performance Computing Infrastructure: An Alternative Approach for Resource-Limited Settings

Next-generation sequencing (NGS) technologies have revolutionized biological research by generating genomic data that were once unaffordable by traditional first-generation sequencing technologies. These sequencing methodologies provide an opportunity for in-depth analyses of host and pathogen genomes as they are able to sequence millions of templates at a time. However, these large datasets can only be efficiently explored using bioinformatics analyses requiring huge data storage and computational resources adapted for high-performance processing. High-performance computing allows for efficient handling of large data and tasks that may require multi-threading and prolonged computational times, which is not feasible with ordinary computers. However, high-performance computing resources are costly and therefore not always readily available in low-income settings. We describe the establishment of an affordable high-performance computing bioinformatics cluster consisting of 3 nodes, constructed using ordinary desktop computers and open-source software including Linux Fedora, SLURM Workload Manager, and the Conda package manager. For the analysis of large antibody sequence datasets and for complex viral phylodynamic analyses, the cluster out-performed desktop computers. This has demonstrated that it is possible to construct high-performance computing capacity capable of analyzing large NGS data from relatively low-cost hardware and entirely free (open-source) software, even in resource-limited settings. Such a cluster design has broad utility beyond bioinformatics to other studies that require high-performance computing.

RACS: rapid analysis of ChIP-Seq data for contig based genomes

BACKGROUND

Chromatin immunoprecipitation coupled to next generation sequencing (ChIP-Seq) is a widely-used molecular method to investigate the function of chromatin-related proteins by identifying their associated DNA sequences on a genomic scale. ChIP-Seq generates large quantities of data that is difficult to process and analyze, particularly for organisms with a contig-based sequenced genomes that typically have minimal annotation on their associated set of genes other than their associated coordinates primarily predicted by gene finding programs. Poorly annotated genome sequence makes comprehensive analysis of ChIP-Seq data difficult and as such standardized analysis pipelines are lacking.

RESULTS

We present a one-stop computational pipeline, "Rapid Analysis of ChIP-Seq data" (RACS), that utilizes traditional High-Performance Computing (HPC) techniques in association with open source tools for processing and analyzing raw ChIP-Seq data. RACS is an open source computational pipeline available from any of the following repositories https://bitbucket.org/mjponce/RACS or https://gitrepos.scinet.utoronto.ca/public/?a=summary&p=RACS . RACS is particularly useful for ChIP-Seq in organisms with contig-based genomes that have poor gene annotation to aid protein function discovery.To test the performance and efficiency of RACS, we analyzed ChIP-Seq data previously published in a model organism Tetrahymena thermophila which has a contig-based genome. We assessed the generality of RACS by analyzing a previously published data set generated using the model organism Oxytricha trifallax, whose genome sequence is also contig-based with poor annotation.

CONCLUSIONS

The RACS computational pipeline presented in this report is an efficient and reliable tool to analyze genome-wide raw ChIP-Seq data generated in model organisms with poorly annotated contig-based genome sequence. Because RACS segregates the found read accumulations between genic and intergenic regions, it is particularly efficient for rapid downstream analyses of proteins involved in gene expression.

DECA: scalable XHMM exome copy-number variant calling with ADAM and Apache Spark

Background

XHMM is a widely used tool for copy-number variant (CNV) discovery from whole exome sequencing data but can require hours to days to run for large cohorts. A more scalable implementation would reduce the need for specialized computational resources and enable increased exploration of the configuration parameter space to obtain the best possible results.

Results

DECA is a horizontally scalable implementation of the XHMM algorithm using the ADAM framework and Apache Spark that incorporates novel algorithmic optimizations to eliminate unneeded computation. DECA parallelizes XHMM on both multi-core shared memory computers and large shared-nothing Spark clusters. We performed CNV discovery from the read-depth matrix in 2535 exomes in 9.3 min on a 16-core workstation (35.3× speedup vs. XHMM), 12.7 min using 10 executor cores on a Spark cluster (18.8× speedup vs. XHMM), and 9.8 min using 32 executor cores on Amazon AWS’ Elastic MapReduce. We performed CNV discovery from the original BAM files in 292 min using 640 executor cores on a Spark cluster.

Conclusions

We describe DECA’s performance, our algorithmic and implementation enhancements to XHMM to obtain that performance, and our lessons learned porting a complex genome analysis application to ADAM and Spark. ADAM and Apache Spark are a performant and productive platform for implementing large-scale genome analyses, but efficiently utilizing large clusters can require algorithmic optimizations and careful attention to Spark’s configuration parameters.

High-Performance Computing in Bayesian Phylogenetics and Phylodynamics Using BEAGLE

In this chapter, we focus on the computational challenges associated with statistical phylogenomics and how use of the broad-platform evolutionary analysis general likelihood evaluator (BEAGLE), a high-performance library for likelihood computation, can help to substantially reduce computation time in phylogenomic and phylodynamic analyses. We discuss computational improvements brought about by the BEAGLE library on a variety of state-of-the-art multicore hardware, and for a range of commonly used evolutionary models. For data sets of varying dimensions, we specifically focus on comparing performance in the Bayesian evolutionary analysis by sampling trees (BEAST) software between multicore central processing units (CPUs) and a wide range of graphics processing cards (GPUs). We put special emphasis on computational benchmarks from the field of phylodynamics, which combines the challenges of phylogenomics with those of modelling trait data associated with the observed sequence data. In conclusion, we show that for increasingly large molecular sequence data sets, GPUs can offer tremendous computational advancements through the use of the BEAGLE library, which is available for software packages for both Bayesian inference and maximum-likelihood frameworks.

SWIFOLD: Smith-Waterman implementation on FPGA with OpenCL for long DNA sequences

Background

The Smith-Waterman (SW) algorithm is the best choice for searching similar regions between two DNA or protein sequences. However, it may become impracticable in some contexts due to its high computational demands. Consequently, the computer science community has focused on the use of modern parallel architectures such as Graphics Processing Units (GPUs), Xeon Phi accelerators and Field Programmable Gate Arrays (FGPAs) to speed up large-scale workloads.

Results

This paper presents and evaluates SWIFOLD: a Smith-Waterman parallel Implementation on FPGA with OpenCL for Long DNA sequences. First, we evaluate its performance and resource usage for different kernel configurations. Next, we carry out a performance comparison between our tool and other state-of-the-art implementations considering three different datasets. SWIFOLD offers the best average performance for small and medium test sets, achieving a performance that is independent of input size and sequence similarity. In addition, SWIFOLD provides competitive performance rates in comparison with GPU-based implementations on the latest GPU generation for the large dataset.

Conclusions

The results suggest that SWIFOLD can be a serious contender for accelerating the SW alignment of DNA sequences of unrestricted size in an affordable way reaching on average 125 GCUPS and almost a peak of 270 GCUPS.

Parallelization of Molecular Docking: A Review

Molecular docking, as one of the widely used virtual screening methods, aims to predict the binding-conformations of small molecule ligands to the appropriate target binding site. Because of the computational complexity and the arrival of the big data era, molecular docking requests High- Performance Computing (HPC) to improve its performance and accuracy. We discuss, in detail, the advances in accelerating molecular docking software in parallel, based on the different common HPC platforms, respectively. Not only the existing suitable programs have been optimized and ported to HPC platforms, but also many novel parallel algorithms have been designed and implemented. This review focuses on the techniques and methods adopted in parallelizing docking software. Where appropriate, we refer readers to exemplary case studies.

Two-dimensional grid optimization for sedimentation velocity analysis in the analytical ultracentrifuge

Sedimentation velocity experiments performed in the analytical ultracentrifuge are modeled using finite-element solutions of the Lamm equation. During modeling, three fundamental parameters are optimized: the sedimentation coefficients, the diffusion coefficients, and the partial concentrations of all solutes present in a mixture. A general modeling approach consists of fitting the partial concentrations of solutes defined in a two-dimensional grid of sedimentation and diffusion coefficient combinations that cover the range of possible solutes for a given mixture. An increasing number of grid points increase the resolution of the model produced by the subsequent analysis, with denser grids giving rise to a very large system of equations. Here, we evaluate the efficiency and resolution of several regular grids and show that traditionally defined grids tend to provide inadequate coverage in one region of the grid, while at the same time being computationally wasteful in other sections of the grid. We describe a rapid and systematic approach for generating efficient two-dimensional analysis grids that balance optimal information content and model resolution for a given signal-to-noise ratio with improved calculation efficiency. These findings are general and apply to one- and two-dimensional grids, although they no longer represent regular grids. We provide a recipe for an improved grid-point spacing in both directions which eliminates unnecessary points, while at the same time providing a more uniform resolution that can be scaled based on the stochastic noise in the experimental data.

Fast genomic prediction of breeding values using parallel Markov chain Monte Carlo with convergence diagnosis

Background

Running multiple-chain Markov Chain Monte Carlo (MCMC) provides an efficient parallel computing method for complex Bayesian models, although the efficiency of the approach critically depends on the length of the non-parallelizable burn-in period, for which all simulated data are discarded. In practice, this burn-in period is set arbitrarily and often leads to the performance of far more iterations than required. In addition, the accuracy of genomic predictions does not improve after the MCMC reaches equilibrium.

Results

Automatic tuning of the burn-in length for running multiple-chain MCMC was proposed in the context of genomic predictions using BayesA and BayesCπ models. The performance of parallel computing versus sequential computing and tunable burn-in MCMC versus fixed burn-in MCMC was assessed using simulation data sets as well by applying these methods to genomic predictions of a Chinese Simmental beef cattle population. The results showed that tunable burn-in parallel MCMC had greater speedups than fixed burn-in parallel MCMC, and both had greater speedups relative to sequential (single-chain) MCMC. Nevertheless, genomic estimated breeding values (GEBVs) and genomic prediction accuracies were highly comparable between the various computing approaches. When applied to the genomic predictions of four quantitative traits in a Chinese Simmental population of 1217 beef cattle genotyped by an Illumina Bovine 770 K SNP BeadChip, tunable burn-in multiple-chain BayesCπ (TBM-BayesCπ) outperformed tunable burn-in multiple-chain BayesCπ (TBM-BayesA) and Genomic Best Linear Unbiased Prediction (GBLUP) in terms of the prediction accuracy, although the differences were not necessarily caused by computational factors and could have been intrinsic to the statistical models per se.

Conclusions

Automatically tunable burn-in multiple-chain MCMC provides an accurate and cost-effective tool for high-performance computing of Bayesian genomic prediction models, and this algorithm is generally applicable to high-performance computing of any complex Bayesian statistical model.

Electronic supplementary material

The online version of this article (doi:10.1186/s12859-017-2003-3) contains supplementary material, which is available to authorized users.

Congestion game scheduling for virtual drug screening optimization

In virtual drug screening, the chemical diversity of hits is an important factor, along with their predicted activity. Moreover, interim results are of interest for directing the further research, and their diversity is also desirable. In this paper, we consider a problem of obtaining a diverse set of virtual screening hits in a short time. To this end, we propose a mathematical model of task scheduling for virtual drug screening in high-performance computational systems as a congestion game between computational nodes to find the equilibrium solutions for best balancing the number of interim hits with their chemical diversity. The model considers the heterogeneous environment with workload uncertainty, processing time uncertainty, and limited knowledge about the input dataset structure. We perform computational experiments and evaluate the performance of the developed approach considering organic molecules database GDB-9. The used set of molecules is rich enough to demonstrate the feasibility and practicability of proposed solutions. We compare the algorithm with two known heuristics used in practice and observe that game-based scheduling outperforms them by the hit discovery rate and chemical diversity at earlier steps. Based on these results, we use a social utility metric for assessing the efficiency of our equilibrium solutions and show that they reach greatest values.

Optimisation of an exemplar oculomotor model using multi-objective genetic algorithms executed on a GPU-CPU combination

BACKGROUND

Parameter optimisation is a critical step in the construction of computational biology models. In eye movement research, computational models are increasingly important to understanding the mechanistic basis of normal and abnormal behaviour. In this study, we considered an existing neurobiological model of fast eye movements (saccades), capable of generating realistic simulations of: (i) normal horizontal saccades; and (ii) infantile nystagmus - pathological ocular oscillations that can be subdivided into different waveform classes. By developing appropriate fitness functions, we optimised the model to existing experimental saccade and nystagmus data, using a well-established multi-objective genetic algorithm. This algorithm required the model to be numerically integrated for very large numbers of parameter combinations. To address this computational bottleneck, we implemented a master-slave parallelisation, in which the model integrations were distributed across the compute units of a GPU, under the control of a CPU.

RESULTS

While previous nystagmus fitting has been based on reproducing qualitative waveform characteristics, our optimisation protocol enabled us to perform the first direct fits of a model to experimental recordings. The fits to normal eye movements showed that although saccades of different amplitudes can be accurately simulated by individual parameter sets, a single set capable of fitting all amplitudes simultaneously cannot be determined. The fits to nystagmus oscillations systematically identified the parameter regimes in which the model can reproduce a number of canonical nystagmus waveforms to a high accuracy, whilst also identifying some waveforms that the model cannot simulate. Using a GPU to perform the model integrations yielded a speedup of around 20 compared to a high-end CPU.

CONCLUSIONS

The results of both optimisation problems enabled us to quantify the predictive capacity of the model, suggesting specific modifications that could expand its repertoire of simulated behaviours. In addition, the optimal parameter distributions we obtained were consistent with previous computational studies that had proposed the saccadic braking signal to be the origin of the instability preceding the development of infantile nystagmus oscillations. Finally, the master-slave parallelisation method we developed to accelerate the optimisation process can be readily adapted to fit other highly parametrised computational biology models to experimental data.

PWHATSHAP: efficient haplotyping for future generation sequencing

Background

Haplotype phasing is an important problem in the analysis of genomics information. Given a set of DNA fragments of an individual, it consists of determining which one of the possible alleles (alternative forms of a gene) each fragment comes from. Haplotype information is relevant to gene regulation, epigenetics, genome-wide association studies, evolutionary and population studies, and the study of mutations. Haplotyping is currently addressed as an optimisation problem aiming at solutions that minimise, for instance, error correction costs, where costs are a measure of the confidence in the accuracy of the information acquired from DNA sequencing. Solutions have typically an exponential computational complexity. WhatsHap is a recent optimal approach which moves computational complexity from DNA fragment length to fragment overlap, i.e., coverage, and is hence of particular interest when considering sequencing technology’s current trends that are producing longer fragments.

Results

Given the potential relevance of efficient haplotyping in several analysis pipelines, we have designed and engineered pWhatsHap, a parallel, high-performance version of WhatsHap. pWhatsHap is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building on WhatsHap, pWhatsHap exhibits the same complexity exploring a number of possible solutions which is exponential in the coverage of the dataset. The parallel implementation on multi-core architectures allows for a relevant reduction of the execution time for haplotyping, while the provided results enjoy the same high accuracy as that provided by WhatsHap, which increases with coverage.

Conclusions

Due to its structure and management of the large datasets, the parallelisation of WhatsHap posed demanding technical challenges, which have been addressed exploiting a high-level parallel programming framework. The result, pWhatsHap, is a freely available toolkit that improves the efficiency of the analysis of genomics information.

Recommendations on e-infrastructures for next-generation sequencing

With ever-increasing amounts of data being produced by next-generation sequencing (NGS) experiments, the requirements placed on supporting e-infrastructures have grown. In this work, we provide recommendations based on the collective experiences from participants in the EU COST Action SeqAhead for the tasks of data preprocessing, upstream processing, data delivery, and downstream analysis, as well as long-term storage and archiving. We cover demands on computational and storage resources, networks, software stacks, automation of analysis, education, and also discuss emerging trends in the field. E-infrastructures for NGS require substantial effort to set up and maintain over time, and with sequencing technologies and best practices for data analysis evolving rapidly it is important to prioritize both processing capacity and e-infrastructure flexibility when making strategic decisions to support the data analysis demands of tomorrow. Due to increasingly demanding technical requirements we recommend that e-infrastructure development and maintenance be handled by a professional service unit, be it internal or external to the organization, and emphasis should be placed on collaboration between researchers and IT professionals.

Evaluation of Emerging Energy-Efficient Heterogeneous Computing Platforms for Biomolecular and Cellular Simulation Workloads

Many of the continuing scientific advances achieved through computational biology are predicated on the availability of ongoing increases in computational power required for detailed simulation and analysis of cellular processes on biologically-relevant timescales. A critical challenge facing the development of future exascale supercomputer systems is the development of new computing hardware and associated scientific applications that dramatically improve upon the energy efficiency of existing solutions, while providing increased simulation, analysis, and visualization performance. Mobile computing platforms have recently become powerful enough to support interactive molecular visualization tasks that were previously only possible on laptops and workstations, creating future opportunities for their convenient use for meetings, remote collaboration, and as head mounted displays for immersive stereoscopic viewing. We describe early experiences adapting several biomolecular simulation and analysis applications for emerging heterogeneous computing platforms that combine power-efficient system-on-chip multi-core CPUs with high-performance massively parallel GPUs. We present low-cost power monitoring instrumentation that provides sufficient temporal resolution to evaluate the power consumption of individual CPU algorithms and GPU kernels. We compare the performance and energy efficiency of scientific applications running on emerging platforms with results obtained on traditional platforms, identify hardware and algorithmic performance bottlenecks that affect the usability of these platforms, and describe avenues for improving both the hardware and applications in pursuit of the needs of molecular modeling tasks on mobile devices and future exascale computers.

1001 Ways to run AutoDock Vina for virtual screening

Large-scale computing technologies have enabled high-throughput virtual screening involving thousands to millions of drug candidates. It is not trivial, however, for biochemical scientists to evaluate the technical alternatives and their implications for running such large experiments. Besides experience with the molecular docking tool itself, the scientist needs to learn how to run it on high-performance computing (HPC) infrastructures, and understand the impact of the choices made. Here, we review such considerations for a specific tool, AutoDock Vina, and use experimental data to illustrate the following points: (1) an additional level of parallelization increases virtual screening throughput on a multi-core machine; (2) capturing of the random seed is not enough (though necessary) for reproducibility on heterogeneous distributed computing systems; (3) the overall time spent on the screening of a ligand library can be improved by analysis of factors affecting execution time per ligand, including number of active torsions, heavy atoms and exhaustiveness. We also illustrate differences among four common HPC infrastructures: grid, Hadoop, small cluster and multi-core (virtual machine on the cloud). Our analysis shows that these platforms are suitable for screening experiments of different sizes. These considerations can guide scientists when choosing the best computing platform and set-up for their future large virtual screening experiments.