SUMMARY: Transcriptomic analysis is a key tool for exploring gene expression, but the complexity of biological systems often limits its insights. In particular, the lack of intermodal or multi-layered analysis hinders the ability to fully capture key cellular functions such as metabolism from transcriptomic data alone. Here, we introduce a novel approach that informs transcriptomic data analysis with metabolic network modeling to address this. Unlike traditional methods, HUman MEtabolism Specific Signature (HUMESS) uses genome-scale metabolic modeling and flux analysis to highlight reactions and involved genes based on their metabolic significance, offering a deeper understanding of transcriptomic data. Our computational pipeline, supported by a user-friendly Rshiny application, enhances gene expression analysis by uncovering metabolic phenotypic signatures. AVAILABILITY AND IMPLEMENTATION: HUMESS is open source and available under GitLab https://gitlab.univ-nantes.fr/bird_pipeline_registry/humess with the complete documentation available at https://gitlab.univ-nantes.fr/bird_pipeline_registry/humess/-/wikis/Home. A zenodo archive is also available at the following DOI: https://doi.org/10.5281/zenodo.15487717. An RShiny application has been developed to facilitate the exploration and analysis of HUMESS's results. The app is available online at the following address: https://shiny-bird.univ-nantes.fr/app/shinymess but can also be installed locally, available under GitLab https://gitlab.univ-nantes.fr/pare-l/shinymess.

Proteins ensure their biological functions by interacting with each other. Hence, characterising protein interactions is fundamental for our understanding of the cellular machinery, and for improving medicine and bioengineering. Over the past years, a large body of experimental data has been accumulated on who interacts with whom and in what manner. However, these data are highly heterogeneous and sometimes contradictory, noisy, and biased. Ab initio methods provide a means to a "blind" protein-protein interaction network reconstruction. Here, we report on a molecular cross-docking-based approach for the identification of protein partners. The docking algorithm uses a coarse-grained representation of the protein structures and treats them as rigid bodies. We applied the approach to a few hundred of proteins, in the unbound conformations, and we systematically investigated the influence of several key ingredients, such as the size and quality of the interfaces, and the scoring function. We achieved some significant improvement compared to previous works, and a very high discriminative power on some specific functional classes. We provide a readout of the contributions of shape and physico-chemical complementarity, interface matching, and specificity, in the predictions. In addition, we assessed the ability of the approach to account for protein surface multiple usages, and we compared it with a sequence-based deep learning method. This work may contribute to guiding the exploitation of the large amounts of protein structural models now available toward the discovery of unexpected partners and their complex structure characterisation.

MOTIVATION: The understanding of the ever-increasing number of metagenomic sequences accumulating in our databases demands for approaches that rapidly 'explore' the content of multiple and/or large metagenomic datasets with respect to specific domain targets, avoiding full domain annotation and full assembly. RESULTS: S3A is a fast and accurate domain-targeted assembler designed for a rapid functional profiling. It is based on a novel construction and a fast traversal of the Overlap-Layout-Consensus graph, designed to reconstruct coding regions from domain annotated metagenomic sequence reads. S3A relies on high-quality domain annotation to efficiently assemble metagenomic sequences and on the design of a new confidence measure for a fast evaluation of overlapping reads. Its implementation is highly generic and can be applied to any arbitrary type of annotation. On simulated data, S3A achieves a level of accuracy similar to that of classical metagenomics assembly tools while permitting to conduct a faster and sensitive profiling on domains of interest. When studying a few dozens of functional domains-a typical scenario-S3A is up to an order of magnitude faster than general purpose metagenomic assemblers, thus enabling the analysis of a larger number of datasets in the same amount of time. S3A opens new avenues to the fast exploration of the rapidly increasing number of metagenomic datasets displaying an ever-increasing size. AVAILABILITY AND IMPLEMENTATION: S3A is available at http://www.lcqb.upmc.fr/S3A_ASSEMBLER/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

We present a new educational initiative called Meet-U that aims to train students for collaborative work in computational biology and to bridge the gap between education and research. Meet-U mimics the setup of collaborative research projects and takes advantage of the most popular tools for collaborative work and of cloud computing. Students are grouped in teams of 4-5 people and have to realize a project from A to Z that answers a challenging question in biology. Meet-U promotes "coopetition," as the students collaborate within and across the teams and are also in competition with each other to develop the best final product. Meet-U fosters interactions between different actors of education and research through the organization of a meeting day, open to everyone, where the students present their work to a jury of researchers and jury members give research seminars. This very unique combination of education and research is strongly motivating for the students and provides a formidable opportunity for a scientific community to unite and increase its visibility. We report on our experience with Meet-U in two French universities with master's students in bioinformatics and modeling, with protein-protein docking as the subject of the course. Meet-U is easy to implement and can be straightforwardly transferred to other fields and/or universities. All the information and data are available at www.meet-u.org.

In recent years, marked point processes have received a great deal of attention. They were applied with success to extract objects in large data sets as those obtained in remote sensing frameworks or biological studies. We propose in this paper a method based on marked point processes to reconstruct volumes of 3D particles from images of 2D particles provided by the Tomographic Particle Image Velocimetry (Tomo-PIV) technique. Unlike other reconstruction methods, our approach allows us to solve the problem in a parsimonious way. It facilitates the introduction of prior knowledge and naturally solves the memory problem which is inherent to pixel based approach used by classical tomographic reconstruction methods. The best reconstruction is found by minimizing an energy function which defines the marked point process. In order to avoid local minima, we use a simulated annealing algorithm. Results are presented on simulated data.

A typical characteristic of real-time systems is concurrent processing of tasks under strict timing requirements. These timing requirements may impose not only direct constraints, such as deadlines, but also indirect timing constraints in terms of inter-task dependencies. However scheduling policies which can deal with some of these constraints effectively are limited, especially for the on-line context, and are not widely known within the real-time community. In this context, this paper presents a technique to control execution irregularities, namely, jitter. The technique is based on the modification of task temporal parameters in the paradigm of the well known Deadline Monotonic (DM) and Earliest Deadline First (EDF) algorithms. The technique presents a way either to remove jitter completely (in the case of regularity constrained tasks) or to bound jitter releases. Moreover, the approach takes into account temporal dependencies of tasks on one another.