Biological Data Processing Research Articles

Enhancing the data processing speed of a deep-learning-based three-dimensional single molecule localization algorithm (FD-DeepLoc) with a combination of feature compression and pipeline programming

Three-dimensional (3D) single molecule localization microscopy (SMLM) plays an important role in biomedical applications, but its data processing is very complicated. Deep learning is a potential tool to solve this problem. As the state of art 3D super-resolution localization algorithm based on deep learning, FD-DeepLoc algorithm reported recently still has a gap with the expected goal of online image processing, even though it has greatly improved the data processing throughput. In this paper, a new algorithm Lite-FD-DeepLoc is developed on the basis of FD-DeepLoc algorithm to meet the online image processing requirements of 3D SMLM. This new algorithm uses the feature compression method to reduce the parameters of the model, and combines it with pipeline programming to accelerate the inference process of the deep learning model. The simulated data processing results show that the image processing speed of Lite-FD-DeepLoc is about twice as fast as that of FD-DeepLoc with a slight decrease in localization accuracy, which can realize real-time processing of [Formula: see text] pixels size images. The results of biological experimental data processing imply that Lite-FD-DeepLoc can successfully analyze the data based on astigmatism and saddle point engineering, and the global resolution of the reconstructed image is equivalent to or even better than FD-DeepLoc algorithm.

Computer Simulation for Effective Pharmaceutical Kinetics and Dynamics: A Review.

Computer-based modelling and simulation are developing as effective tools for supplementing biological data processing and interpretation. It helps to accelerate the creation of dosage forms at a lower cost and with the less human effort required to conduct the work. This paper aims to provide a comprehensive description of the different computer simulation models for various drugs along with their outcomes. The data used are taken from different sources, including review papers from Science Direct, Elsevier, NCBI, and Web of Science from 1995-2020. Keywords like - pharmacokinetic, pharmacodynamics, computer simulation, whole-cell model, and cell simulation, were used for the search process. The use of computer simulation helps speed up the creation of new dosage forms at a lower cost and less human effort required to complete the work. It is also widely used as a technique for researching the structure and dynamics of lipids and proteins found in membranes. It also facilitates both the diagnosis and prevention of illness. Conventional data analysis methods cannot assess and comprehend the huge amount, size, and complexity of data collected by in vitro, in vivo</i>, and ex vivo</i> experiments. As a result, numerous in silico</i> computational e-resources, databases, and simulation software are employed to determine pharmacokinetic (PK) and pharmacodynamic (PD) parameters for illness management. These techniques aid in the provision of multiscale representations of biological processes, beginning with proteins and genes and progressing through cells, isolated tissues and organs, and the whole organism.

Optimization and Performance Analysis of CAT Method for DNA Sequence Similarity Searching and Alignment.

Bioinformatics is a rapidly developing field enabling scientific experiments via computer models and simulations. In recent years, there has been an extraordinary growth in biological databases. Therefore, it is extremely important to propose effective methods and algorithms for the fast and accurate processing of biological data. Sequence comparisons are the best way to investigate and understand the biological functions and evolutionary relationships between genes on the basis of the alignment of two or more DNA sequences in order to maximize the identity level and degree of similarity. This paper presents a new version of the pairwise DNA sequences alignment algorithm, based on a new method called CAT, where a dependency with a previous match and the closest neighbor are taken into consideration to increase the uniqueness of the CAT profile and to reduce possible collisions, i.e., two or more sequence with the same CAT profiles. This makes the proposed algorithm suitable for finding the exact match of a concrete DNA sequence in a large set of DNA data faster. In order to enable the usage of the profiles as sequence metadata, CAT profiles are generated once prior to data uploading to the database. The proposed algorithm consists of two main stages: CAT profile calculation depending on the chosen benchmark sequences and sequence comparison by using the calculated CAT profiles. Improvements in the generation of the CAT profiles are detailed and described in this paper. Block schemes, pseudo code tables, and figures were updated according to the proposed new version and experimental results. Experiments were carried out using the new version of the CAT method for DNA sequence alignment and different datasets. New experimental results regarding collisions, speed, and efficiency of the suggested new implementation are presented. Experiments related to the performance comparison with Needleman-Wunsch were re-executed with the new version of the algorithm to confirm that we have the same performance. A performance analysis of the proposed algorithm based on the CAT method against the Knuth-Morris-Pratt algorithm, which has a complexity of O(n) and is widely used for biological data searching, was performed. The impact of prior matching dependencies on uniqueness for generated CAT profiles is investigated. The experimental results from sequence alignment demonstrate that the proposed CAT method-based algorithm exhibits minimal deviation, which can be deemed negligible if such deviation is considered permissible in favor of enhanced performance. It should be noted that the performance of the CAT algorithm in terms of execution time remains stable, unaffected by the length of the analyzed sequences. Hence, the primary benefit of the suggested approach lies in its rapid processing capabilities in large-scale sequence alignment, a task that traditional exact algorithms would require significantly more time to perform.

A Spiking Artificial Vision Architecture Based on Fully Emulating the Human Vision.

Intelligent vision necessitates the deployment of detectors that are always-on and low-power, mirroring the continuous and uninterrupted responsiveness characteristic of human vision. Nonetheless, contemporary artificial vision systems attain this goal by the continuous processing of massive image frames and executing intricate algorithms, thereby expending substantial computational power and energy. In contrast, biological data processing, based on event-triggered spiking, has higher efficiency and lower energy consumption. Here, this work proposes an artificial vision architecture consisting of spiking photodetectors and artificial synapses, closely mirroring the intricacies of the human visual system. Distinct from previously reported techniques, the photodetector is self-powered and event-triggered, outputting light-modulated spiking signals directly, thereby fulfilling the imperative for always-on with low-power consumption. With the spiking signals processing through the integrated synapse units, recognition of graphics, gestures, and human action has been implemented, illustrating the potent image processing capabilities inherent within this architecture. The results prove the 90% accuracy rate in human action recognition within a mere five epochs utilizing a rudimentary artificial neural network. This novel architecture, grounded in spiking photodetectors, offers a viable alternative to the extant models of always-on low-power artificial vision system.

A computational statistical approach to assess cowpea [Vigna unguiculata (L.) Walp.] cultivars diversity and select elite genotypes from Agro-morphological and biochemical traits

Computational statistic approaches play an essential role in the evaluation and processing of agronomic, biological, and bio-medical big data. The complexity and large size of those data make computational statistics a crucial tool in bio-statistical analysis. Based on this evidence, we characterized phenotype performances of cowpea cultivar in the Northern of Côte d’Ivoire, developing our own computational statistical approach, exclusively in the R programming language. Several packages of R have been executed to assess cowpea cultivar agro-morphological and biochemical performances. Z-score clustering analysis revealed four groups of cowpeas based on agro-morphological parameters. K-mean clustering survey revealed four and two groups of cowpea cultivar respectively for agro-morphological and biochemical parameters. The Horn parallel analysis highlighted two, four, two and two agro-explanatory components and/or agro-morphological parameters as influencing data variability respectively in the first, second, third, and fourth groups of cowpea cultivars previously revealed by the k-mean analysis. The same analysis exhibited two components in terms of biochemical parameters, inducing the variability in the two cluster groups of cowpea cultivar revealed by the k-mean survey. Integrative analysis of the ANOVA test and Tukey’s multi-comparative analysis displayed yield (agro-morphological parameter) and cowpea energetic content (biochemical parameter) as main sources of cowpea cultivar phenotypical variability (P &lt; 0.05). Of note, receiver operating characteristic predictive analysis showed the excellent performance of both cowpea yield and energetic content in selecting cowpea genetic germplasm area under the curve (AUC = 0.9). Considering as a whole, the present computational statistical approach shows excellent performance in the evaluation, characterization, and management of agro-morphological (yield parameter) and biochemical (energetic content) features of cowpea in genetic selection procedures.

The Application of Artificial Intelligence to The Bayesian Model Algorithm for Combining Genome Data

The combination of bioinformatics and artificial intelligence (AI) has made significant progress in the current phase. AI technology, especially deep learning, has been widely used in biology, resulting in many innovations. Currently, AI plays a key role in genomics, proteomics, and drug discovery. Deep learning models are used to predict protein structures, discover potential drug compounds, interpret genomic sequences, analyze medical images, and make personalized medical recommendations. In addition, AI can also help accelerate the processing and interpretation of biological big data, helping biologists to understand complex problems in the life sciences more deeply. Compared to traditional genetic data analysis methods, AI combined with bioinformatics methods are often faster and more accurate, and are capable of processing large-scale, high-dimensional biological data, opening up unprecedented opportunities for life science research. In this paper, the whole genome data and biomedical imaging data are used from the perspective of Bayesian hypothesis testing. Genome-wide association analysis, led by large-scale multiple tests, is a very popular tool for identifying genetic variation points in new complex diseases. In genome-wide association analysis, tens of thousands of SNPS need to be tested simultaneously to find out some SNPS related to traits. These tests are related due to factors such as linkage imbalances in the genetic process, and the test questions are set against the background of high-dimensional data (p &gt;=n).

Application of deep learning technique in next generation sequence experiments

In recent years, the widespread utilization of biological data processing technology has been driven by its cost-effectiveness. Consequently, next-generation sequencing (NGS) has become an integral component of biological research. NGS technologies enable the sequencing of billions of nucleotides in the entire genome, transcriptome, or specific target regions. This sequencing generates vast data matrices. Consequently, there is a growing demand for deep learning (DL) approaches, which employ multilayer artificial neural networks and systems capable of extracting meaningful information from these extensive data structures. In this study, the aim was to obtain optimized parameters and assess the prediction performance of deep learning and machine learning (ML) algorithms for binary classification in real and simulated whole genome data using a cloud-based system. The ART-simulated data and paired-end NGS (whole genome) data of Ch22, which includes ethnicity information, were evaluated using XGBoost, LightGBM, and DL algorithms. When the learning rate was set to 0.01 and 0.001, and the epoch values were updated to 500, 1000, and 2000 in the deep learning model for the ART simulated dataset, the median accuracy values of the ART models were as follows: 0.6320, 0.6800, and 0.7340 for epoch 0.01; and 0.6920, 0.7220, and 0.8020 for epoch 0.001, respectively. In comparison, the median accuracy values of the XGBoost and LightGBM models were 0.6990 and 0.6250 respectively. When the same process is repeated for Chr 22, the results are as follows: the median accuracy values of the DL models were 0.5290, 0.5420 and 0.5820 for epoch 0.01; and 0.5510, 0.5830 and 0.6040 for epoch 0.001, respectively. Additionally, the median accuracy values of the XGBoost and LightGBM models were 0.5760 and 0.5250, respectively. While the best classification estimates were obtained at 2000 epochs and a learning rate (LR) value of 0.001 for both real and simulated data, the XGBoost algorithm showed higher performance when the epoch value was 500 and the LR was 0.01. When dealing with class imbalance, the DL algorithm yielded similar and high Recall and Precision values. Conclusively, this study serves as a timely resource for genomic scientists, providing guidance on why, when, and how to effectively utilize deep learning/machine learning methods for the analysis of human genomic data.

Model of statistical data analysis on nitrogen content in soybeans (Glicine Max Merrill) in Clavera variety

Climate change, drought and high temperatures lately have led to the need to increase the adaptation capacities of plants to these changes. The purpose of the research is to gain knowledge regarding the influence of the biologically active substances Reglalg (compound of algal nature) and Biovit (compound of humic nature) on plant development, productivity and adaptation of plants to new climatic conditions. The research was based on decision support systems, machine learning and graph databases. These systems allow in-depth processing of unstructured data and making the necessary decisions. In this sense, an intelligent model was developed for the processing of biological data as part of a Decision Support System. For data analysis and knowledge generation, a graph database was developed to determine relationships and connections between entities, phenomena or events. Graphs allow the representation of complex information in a simple and intuitive way, which makes it easier to perform and analyze them. The use of Machine Learning methods allows the highlighting of laws and interactions between different elements, which can lead to the discovery of patterns and trends that can be easily identified. The paper presents the structure and functions of some components of the decision support system for the study of nitrogen content in soybean.

Advanced synaptic devices and their applications in biomimetic sensory neural system

Human nervous system are consisted of neuron and synapse networks, and are capable to processes information in a plastic, data-parallel, fault-tolerant, and energy-efficient approach. Inspired by the ingenious working mechanism of this miraculous biological data processing system, scientists are devoting great efforts to artificial neural systems based on synaptic devices in recent decades. With the continuous development of bioinspired sensors and synaptic devices, artificial sensory neural systems that capture and process stimuli information in real time become possible. The progress of biomimetic sensory neural systems could provide new methods for next-generation humanoid robotics, human-machine interfaces, and other frontier applications. Herein, this review summarized the recent progress of synaptic devices and biomimetic sensory neural systems. Additionally, the opportunities and remaining challenges in the further development of biomimetic sensory neural systems are outlined.

From Data Science to Bioscience: Emerging era of bioinformatics applications, tools and challenges

With the gradual technological changes in the current era, data science using soft computing and machine learning methods has played a tremendous role in various areas, including the biomedical and health sectors. The etymology of bioinformatics with several types of omics, such as genomics, transcriptomics, proteomics, and metabolomics was coined in the late twentieth century in the direction of the investigation and finding solutions for informatics processing in biological decision-making systems. Similarly, the data science era began and played a vital role in solving a large domain, particularly in biological problem solutions. In this conceptual article, an integrated machine learning-based framework for the prediction of outbreaks is proposed, followed by omics biological data processing and dimension reduction. Subsequently, various prominent benchmark tools have been shown related to problem solutions in data science and bioinformatics applications. In this study, the role of data science and soft computing approaches in bioinformatics disciplines with various associated applications is explored. Various simple soft computing techniques such as fuzzy logic, artificial neural networks, support vector machines and evolutionary computation techniques have been explained. Furthermore, complex optimization and dimension reduction techniques, such as artificial bee colony, ant colony optimization, formal concept analysis, and principal component analysis have been presented. Finally, active research zones in bioinformatics, as well as their current trends and challenges have been highlighted which will lead to future research directions.

A resource scheduling method for reliable and trusted distributed composite services in cloud environment based on deep reinforcement learning.

With the vigorous development of Internet technology, applications are increasingly migrating to the cloud. Cloud, a distributed network environment, has been widely extended to many fields such as digital finance, supply chain management, and biomedicine. In order to meet the needs of the rapid development of the modern biomedical industry, the biological cloud platform is an inevitable choice for the integration and analysis of medical information. It improves the work efficiency of the biological information system and also realizes reliable and credible intelligent processing of biological resources. Cloud services in bioinformatics are mainly for the processing of biological data, such as the analysis and processing of genes, the testing and detection of human tissues and organs, and the storage and transportation of vaccines. Biomedical companies form a data chain on the cloud, and they provide services and transfer data to each other to create composite services. Therefore, our motivation is to improve process efficiency of biological cloud services. Users’ business requirements have become complicated and diversified, which puts forward higher requirements for service scheduling strategies in cloud computing platforms. In addition, deep reinforcement learning shows strong perception and continuous decision-making capabilities in automatic control problems, which provides a new idea and method for solving the service scheduling and resource allocation problems in the cloud computing field. Therefore, this paper designs a composite service scheduling model under the containers instance mode which hybrids reservation and on-demand. The containers in the cluster are divided into two instance modes: reservation and on-demand. A composite service is described as a three-level structure: a composite service consists of multiple services, and a service consists of multiple service instances, where the service instance is the minimum scheduling unit. In addition, an improved Deep Q-Network (DQN) algorithm is proposed and applied to the scheduling algorithm of composite services. The experimental results show that applying our improved DQN algorithm to the composite services scheduling problem in the container cloud environment can effectively reduce the completion time of the composite services. Meanwhile, the method improves Quality of Service (QoS) and resource utilization in the container cloud environment.

Majorbio Cloud: A one-stop, comprehensive bioinformatic platform for multiomics analyses.

The platform consists of three modules, which are pre-configured bioinformatic pipelines, cloud toolsets, and online omics' courses. The pre-configured bioinformatic pipelines not only combine analytic tools for metagenomics, genomes, transcriptome, proteomics and metabolomics, but also provide users with powerful and convenient interactive analysis reports, which allow them to analyze and mine data independently. As a useful supplement to the bioinformatics pipelines, a wide range of cloud toolsets can further meet the needs of users for daily biological data processing, statistics, and visualization. The rich online courses of multi-omics also provide a state-of-art platform to researchers in interactive communication and knowledge sharing.

SCARF: a biomedical association rule finding webserver.

The analysis of enormous datasets with missing data entries is a standard task in biological and medical data processing. Large-scale, multi-institution clinical studies are the typical examples of such datasets. These sets make possible the search for multi-parametric relations since from the plenty of the data one is likely to find a satisfying number of subjects with the required parameter ensembles. Specifically, finding combinatorial biomarkers for some given condition also needs a very large dataset to analyze. For fast and automatic multi-parametric relation discovery association-rule finding tools are used for more than two decades in the data-mining community. Here we present the SCARF webserver for generalized association rule mining. Association rules are of the form: a AND b AND … AND x → y, meaning that the presence of properties a AND b AND … AND x implies property y; our algorithm finds generalized association rules, since it also finds logical disjunctions (i.e., ORs) at the left-hand side, allowing the discovery of more complex rules in a more compressed form in the database. This feature also helps reducing the typically very large result-tables of such studies, since allowing ORs in the left-hand side of a single rule could include dozens of classical rules. The capabilities of the SCARF algorithm were demonstrated in mining the Alzheimer’s database of the Coalition Against Major Diseases (CAMD) in our recent publication (Archives of Gerontology and Geriatrics Vol. 73, pp. 300–307, 2017). Here we describe the webserver implementation of the algorithm.

A Deep Learning Approach for Viral DNA Sequence Classification using Genetic Algorithm

DNA sequence classification is one of the major challenges in biological data processing. The identification and classification of novel viral genome sequences drastically help in reducing the dangers of a viral outbreak like COVID-19. The more accurate the classification of these viruses, the faster a vaccine can be produced to counter them. Thus, more accurate methods should be utilized to classify the viral DNA. This research proposes a hybrid deep learning model for efficient viral DNA sequence classification. A genetic algorithm (GA) was utilized for weight optimization with Convolutional Neural Networks (CNN) architecture. Furthermore, Long Short-Term Memory (LSTM) as well as Bidirectional CNN-LSTM model architectures are employed. Encoding methods are needed to transform the DNA into numeric format for the proposed model. Three different encoding methods to represent DNA sequences as input to the proposed model were experimented: k-mer, label encoding, and one hot vector encoding. Furthermore, an efficient oversampling method was applied to overcome the imbalanced dataset issues. The performance of the proposed GA optimized CNN hybrid model using label encoding achieved the highest classification accuracy of 94.88% compared with other encoding methods.

Workflow to Mine Frequent DNA Co-methylation Clusters in DNA Methylome Data.

The advances in high-throughput nucleotide sequencing technology revolutionized biomedical research. Vast amount of genomic data rapidly accumulates in a daily basis, which in turn calls for the development of powerful bioinformatics tools and efficient workflows to analyze them. One of the approaches to address the "big data" issue is to mine highly correlated clusters/networks of biological molecules, which may provide rich yet hidden information about the underlying functional, regulatory, or structural relationships among genes, proteins, genomic loci or various types of biological molecules or events. A network mining algorithm lmQCM has recently been developed, which can be applied to mine tightly connected correlation clusters (networks) in large biological data with big sample size, and it guarantees a lower bound of the cluster density. This algorithm has been used in a variety of cancer transcriptomic data to mine gene co-expression networks (GCNs), but it can be applied to any correlational matrix. lmQCM is available through R package lmQCM as well as the online tool package TSUNAMI ( https://biolearns.medicine.iu.edu ).In this study, the purpose is to establish an analytical workflow to apply lmQCM for frequent (consensus)cluster mining in multiple DNA methylation datasets in different cancers and extract the underlying common co-methylation networks for genes.Specifically, the workflow is applied to analyze DNA methylome data across different cancer types using lmQCM. It mines frequent DNA methylation clusters based on individual clustering mining results, identifying common as well as distinctive DNA methylation patterns among different cancer types. This workflow has successfully identified frequent GCNs in 33 types of cancers, thus proven to be a powerful tool to analyze large biological data. It helps to identify common features as well as distinctions among different diseases, disease subtypes, or among different biological processes. The resulted frequent clusters may provide new insights on the pathway/function networks. In the case of disease study, the results lead to new directions for biomarker and drug target discovery. The advantages of this workflow include the highly efficient processing of large biological data generated from high-throughput experiments, quick identification of highly correlated interaction networks, substantial reduction of the data dimensionality to a manageable number of variables for downstream comparative analysis, and consequently increased statistical power for detecting differences between conditions.

An efficient strategy for identifying essential proteins based on homology, subcellular location and protein-protein interaction information.

High throughput biological experiments are expensive and time consuming. For the past few years, many computational methods based on biological information have been proposed and widely used to understand the biological background. However, the processing of biological information data inevitably produces false positive and false negative data, such as the noise in the Protein-Protein Interaction (PPI) networks and the noise generated by the integration of a variety of biological information. How to solve these noise problems is the key role in essential protein predictions. An Identifying Essential Proteins model based on non-negative Matrix Symmetric tri-Factorization and multiple biological information (IEPMSF) is proposed in this paper, which utilizes only the PPI network proteins common neighbor characters to develop a weighted network, and uses the non-negative matrix symmetric tri-factorization method to find more potential interactions between proteins in the network so as to optimize the weighted network. Then, using the subcellular location and lineal homology information, the starting score of proteins is determined, and the random walk algorithm with restart mode is applied to the optimized network to mark and rank each protein. We tested the suggested forecasting model against current representative approaches using a public database. Experiment shows high efficiency of new method in essential proteins identification. The effectiveness of this method shows that it can dramatically solve the noise problems that existing in the multi-source biological information itself and cased by integrating them.

Biobanking in dentistry: A review.

Biobanks are not-for-profit services for the collection, processing, storage and distribution of biological samples and data for research and diagnostic purposes. In dentistry, biological materials and data obtained from questionnaires investigating oral conditions can be stored and used for large-scale studies on oral and systemic diseases. To give some examples: gene expression microarrays obtained on biobanked specimens were used in the identification of genetic alterations in oral cancer; efforts to identify genetic mechanisms behind dental caries have been based on an integrative analysis of transcriptome-wide associations and messenger RNA expression. One of the largest studies on facial pain was conducted using Biobank data. Cryopreservation of dental pulp stem cells is a common practice in tooth biobanks. With the exception of teeth and pulp, also leftover oral soft and hard tissues may represent a source of healthy samples that has rarely been exploited as yet. While biobanks are increasingly attracting the attention of the scientific community and becoming economically sustainable, a systematic approach to this resource in dentistry seems to be lacking. This review illustrates the applications of biobanking in dentistry, describing biobanked pathological and healthy samples and data, and discussing future developments.

Highlights from the 2016-2020 NEUBIAS training schools for Bioimage Analysts: a success story and key asset for analysts and life scientists

NEUBIAS, the European Network of Bioimage Analysts, was created in 2016 with the goal of improving the communication and the knowledge transfer among the various stakeholders involved in the acquisition, processing and analysis of biological image data, and to promote the establishment and recognition of the profession of Bioimage Analyst. One of the most successful initiatives of the NEUBIAS programme was its series of 15 training schools, which trained over 400 new Bioimage Analysts, coming from over 40 countries. Here we outline the rationale behind the innovative three-level program of the schools, the curriculum, the trainer recruitment and turnover strategy, the outcomes for the community and the career path of analysts, including some success stories. We discuss the future of the materials created during this programme and some of the new initiatives emanating from the community of NEUBIAS-trained analysts, such as the NEUBIAS Academy. Overall, we elaborate on how this training programme played a key role in collectively leveraging Bioimaging and Life Science research by bringing the latest innovations into structured, frequent and intensive training activities, and on why we believe this should become a model to further develop in Life Sciences.

Research on the Application of Computer Science in Bioinformatics

Bioinformatics is an emerging discipline that integrates many technologies such as computer application technology, network technology, biology, and statistics, etc. Without the rapid development of computer and network technology, bioinformatics would not be what it is today. Computer science has facilitated the exchange of information and the development of the discipline, which has brought great help to the collection and computational processing of biological data and information.

Highlights from the 2016-2020 NEUBIAS training schools for Bioimage Analysts: a success story and key asset for analysts and life scientists.

NEUBIAS, the European Network of Bioimage Analysts, was created in 2016 with the goal of improving the communication and the knowledge transfer among the various stakeholders involved in the acquisition, processing and analysis of biological image data, and to promote the establishment and recognition of the profession of Bioimage Analyst. One of the most successful initiatives of the NEUBIAS programme was its series of 15 training schools, which trained over 400 new Bioimage Analysts, coming from over 40 countries. Here we outline the rationale behind the innovative three-level program of the schools, the curriculum, the trainer recruitment and turnover strategy, the outcomes for the community and the career path of analysts, including some success stories. We discuss the future of the materials created during this programme and some of the new initiatives emanating from the community of NEUBIAS-trained analysts, such as the NEUBIAS Academy. Overall, we elaborate on how this training programme played a key role in collectively leveraging Bioimaging and Life Science research by bringing the latest innovations into structured, frequent and intensive training activities, and on why we believe this should become a model to further develop in Life Sciences.