An exome-wide study of renal operational tolerance.

Background: Renal operational tolerance is a rare and beneficial state of prolonged renal allograft function in the absence of immunosuppression. The underlying mechanisms are unknown. We hypothesized that tolerance might be driven by inherited protein coding genetic variants with large effect, at least in some patients. Methods: We set up a European survey of over 218,000 renal transplant recipients and collected DNAs from 40 transplant recipients who maintained good allograft function without immunosuppression for at least 1 year. We performed an exome-wide association study comparing the distribution of moderate to high impact variants in 36 tolerant patients, selected for genetic homogeneity using principal component analysis, and 192 controls, using an optimal sequence-kernel association test adjusted for small samples. Results: We identified rare variants of HOMER2 (3/36, FDR 0.0387), IQCH (5/36, FDR 0.0362), and LCN2 (3/36, FDR 0.102) in 10 tolerant patients vs. 0 controls. One patient carried a variant in both HOMER2 and LCN2. Furthermore, the three genes showed an identical variant in two patients each. The three genes are expressed at the primary cilium, a key structure in immune responses. Conclusion: Rare protein coding variants are associated with operational tolerance in a sizable portion of patients. Our findings have important implications for a better understanding of immune tolerance in transplantation and other fields of medicine.ClinicalTrials.gov, identifier: NCT05124444.

Prediction of metabolic pathways from genome-scale metabolic networks.

The analysis of a variety of data sets (transcriptome arrays, phylogenetic profiles, etc.) yields groups of functionally related genes. In order to determine their biological function, associated gene groups are often projected onto known pathways or tested for enrichment of known functions. However, these approaches are not flexible enough to deal with variations or novel pathways. During the last decade, we developed and refined an approach that predicts metabolic pathways from a global metabolic network encompassing all known reactions and their substrates/products, by extracting a subgraph connecting at best a set of seed nodes (compounds, reactions, enzymes or enzyme-coding genes). In this review, we summarize this work, while discussing the problems and pitfalls but also the advantages and applications of network-based metabolic pathway prediction.

In response to 'Can sugars be produced from fatty acids? A test case for pathway analysis tools'.

MOTIVATION: In their article entitled 'Can sugars be produced from fatty acids? A test case for pathway analysis tools' de Figueiredo and co-authors assess the performance of three pathway prediction tools (METATOOL, PathFinding and Pathway Hunter Tool) using the synthesis of glucose-6-phosphate (G6P) from acetyl-CoA in humans as a test case. We think that this article is biased for three reasons: (i) the metabolic networks used as input for the respective tools were of very different sizes; (ii) the 'assessment' is restricted to two study cases; (iii) developers are inherently more skilled to use their own tools than those developed by other people. We extended the analyses led by de Figueiredo and clearly show that the apparent superior performance of their tool (METATOOL) is partly due to the differences in input network sizes. We also see a conceptual problem in the comparison of tools that serve different purposes. In our opinion, metabolic path finding and elementary mode analysis are answering different biological questions, and should be considered as complementary rather than competitive approaches. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Metabolic pathfinding using RPAIR annotation.

Metabolic databases contain information about thousands of small molecules and reactions, which can be represented as networks. In the context of metabolic reconstruction, pathways can be inferred by searching optimal paths in such networks. A recurrent problem is the presence of pool metabolites (e.g., water, energy carriers, and cofactors), which are connected to hundreds of reactions, thus establishing irrelevant shortcuts between nodes of the network. One solution to this problem relies on weighted networks to penalize highly connected compounds. A more refined solution takes the chemical structure of reactants into account in order to differentiate between side and main compounds of a reaction. Thanks to an intensive annotation effort at KEGG, decompositions of reactions into reactant pairs (RPAIR) categorized by their role (main, trans, cofac, ligase, and leave) are now available. The goal of this article is to evaluate the impact of RPAIR data on pathfinding in metabolic networks. To this end, we measure the impact of different parameters concerning the construction of the metabolic network: mapping of reactions and reactant pairs onto a graph, use of selected categories of reactant pairs, weighting schemes for compounds and reactions, removal of highly connected metabolites, and reaction directionality. In total, we tested 104 combinations of parameters and identified their optimal values for pathfinding on the basis of 55 reference pathways from three organisms. The best-performing metabolic network combines the biochemical knowledge encoded by KEGG RPAIR with a weighting scheme penalizing highly connected compounds. With this network, we could recover reference pathways from Escherichia coli with an average accuracy of 93% (32 pathways), from Saccharomyces cerevisiae with an average accuracy of 66% (11 pathways), and from humans with an average accuracy of 70% (12 pathways). Our pathfinding approach is available as part of the Network Analysis Tools.

Inferring meaningful pathways in weighted metabolic networks.

An approach is presented for computing meaningful pathways in the network of small molecule metabolism comprising the chemical reactions characterized in all organisms. The metabolic network is described as a weighted graph in which all the compounds are included, but each compound is assigned a weight equal to the number of reactions in which it participates. Path finding is performed in this graph by searching for one or more paths with lowest weight. Performance is evaluated systematically by computing paths between the first and last reactions in annotated metabolic pathways, and comparing the intermediate reactions in the computed pathways to those in the annotated ones. For the sake of comparison, paths are computed also in the un-weighted raw (all compounds and reactions) and filtered (highly connected pool metabolites removed) metabolic graphs, respectively. The correspondence between the computed and annotated pathways is very poor (<30%) in the raw graph; increasing to approximately 65% in the filtered graph; reaching approximately 85% in the weighted graph. Considering the best-matching path among the five lightest paths increases the correspondence to 92%, on average. We then show that the average distance between pairs of metabolites is significantly larger in the weighted graph than in the raw unfiltered graph, suggesting that the small-world properties previously reported for metabolic networks probably result from irrelevant shortcuts through pool metabolites. In addition, we provide evidence that the length of the shortest path in the weighted graph represents a valid measure of the "metabolic distance" between enzymes. We suggest that the success of our simplistic approach is rooted in the high degree of specificity of the reactions in metabolic pathways, presumably reflecting thermodynamic constraints operating in these pathways. We expect our approach to find useful applications in inferring metabolic pathways in newly sequenced genomes.

Metabolic PathFinding: inferring relevant pathways in biochemical networks.

Our knowledge of metabolism can be represented as a network comprising several thousands of nodes (compounds and reactions). Several groups applied graph theory to analyse the topological properties of this network and to infer metabolic pathways by path finding. This is, however, not straightforward, with a major problem caused by traversing irrelevant shortcuts through highly connected nodes, which correspond to pool metabolites and co-factors (e.g. H2O, NADP and H+). In this study, we present a web server implementing two simple approaches, which circumvent this problem, thereby improving the relevance of the inferred pathways. In the simplest approach, the shortest path is computed, while filtering out the selection of highly connected compounds. In the second approach, the shortest path is computed on the weighted metabolic graph where each compound is assigned a weight equal to its connectivity in the network. This approach significantly increases the accuracy of the inferred pathways, enabling the correct inference of relatively long pathways (e.g. with as many as eight intermediate reactions). Available options include the calculation of the k-shortest paths between two specified seed nodes (either compounds or reactions). Multiple requests can be submitted in a queue. Results are returned by email, in textual as well as graphical formats (available in http://www.scmbb.ulb.ac.be/pathfinding/).