Search bioRxiv⌕ Search

Biology subjects

Chitpin, J. G.

Publications and source records attributed to Chitpin, J. G..

4 recordsLinked to original sources

Atomic elementary flux modes explain the steady state flow of metabolites in large-scale flux networks

Steady state fluxes are a measure of cellular activity under metabolic homoeostasis, but understanding how individual substrates are metabolized remains a challenge in large-scale networks. Pathway-based approaches such as elementary flux mode (EFM) analysis are limited to small networks due to the combinatorial explosion of pathways and the ambiguity of decomposing fluxes onto EFMs. Here, we present an alternative approach to explain metabolic fluxes in terms of the steady state flow of their atomic constituents. We refer to these pathways as atomic elementary flux modes (AEFMs) and show that computations involving AEFMs are orders of magnitude faster than standard EFMs. Using our approach, we enumerate carbon and nitrogen AEFMs in five genome-scale metabolic models and compute the AEFM decomposition of fluxes estimated in a HepG2 liver cancer cell line. Our results systematically characterize carbon and nitrogen remodelling and, on the HepG2 network, predict glutamine metabolism through a recently discovered non-canonical TCA cycle.

bioinformatics↗

A Markov constraint to uniquely identify elementary flux mode weights in unimolecular metabolic networks

Elementary flux modes (EFMs) are minimal, steady state pathways characterizing a flux network. Fundamentally, all steady state fluxes in a network are decomposable into a linear combination of EFMs. While there is typically no unique set of EFM weights that reconstructs these fluxes, several optimization-based methods have been proposed to constrain the solution space by enforcing some notion of parsimony. However, it has long been recognized that optimization-based approaches may fail to uniquely identify EFM weights and return different feasible solutions across objective functions and solvers. Here we show that, for flux networks only involving single molecule transformations, these problems can be avoided by imposing a Markovian constraint on EFM weights. Our Markovian constraint guarantees a unique solution to the flux decomposition problem, and that solution is arguably more biophysically plausible than other solutions. We describe an algorithm for computing Markovian EFM weights via steady state analysis of a certain discrete-time Markov chain, based on the flux network, which we call the cycle-history Markov chain. We demonstrate our method with a differential analysis of EFM activity in a lipid metabolic network comparing healthy and Alzheimers disease patients. Our method is the first to uniquely decompose steady state fluxes into EFM weights for any unimolecular metabolic network.

bioinformatics↗

BATL: Bayesian annotations for targeted lipidomics

MotivationBioinformatic tools capable of annotating, rapidly and reproducibly, large, targeted lipidomic datasets are limited. Specifically, few programs enable high-throughput peak assessment of liquid chromatography-electrospray ionization tandem mass spectrometry (LC-ESI-MS/MS) data acquired in either selected or multiple reaction monitoring (SRM and MRM) modes. ResultsWe present here Bayesian Annotations for Targeted Lipidomics (BATL), a Gaussian naive Bayes classifier for targeted lipidomics that annotates peak identities according to eight features related to retention time, intensity, and peak shape. Lipid identification is achieved by modelling distributions of these eight input features across biological conditions and maximizing the joint posterior probabilities of all peak identities at a given transition. When applied to sphingolipid and glycerophosphocholine SRM datasets, we demonstrate over 95% of all peaks are rapidly and correctly identified. Availability and implementationBATL software is freely accessible online at https://complimet.ca/batl/ and is compatible with Safari, Firefox, Chrome and Edge. Supplementary informationSupplementary data are available at Bioinformatics online.

bioinformatics↗

RECAP reveals the true statistical significance of ChIP-seq peak calls

MotivationChlP-seq is used extensively to identify sites of transcription factor binding or regions of epigenetic modifications to the genome. A key step in ChIP-seq analysis is peak calling, where genomic regions enriched for ChIP versus control reads are identified. Many programs have been designed to solve this task, but nearly all fall into the statistical trap of using the data twice--once to determine candidate enriched regions, and again to assess enrichment by classical statistical hypothesis testing. This double use of the data invalidates the statistical significance assigned to enriched regions, and as a consequence, invalidates false discovery rate estimates. Thus, the true significance or reliability of peak calls remains unknown.\n\nResultsUsing simulated and real ChIP-seq data sets, we show that three well-known peak callers, MACS, SICER and diffReps, output optimistically biased p-values, and therefore optimistic false discovery rate estimates--in some cases, many orders of magnitude too optimistic. We propose a wrapper algorithm, RECAP, that uses resampling of ChIP-seq and control data to estimate and correct for biases built into peak calling algorithms. P-values recalibrated by RECAP are approximately uniformly distributed when applied to null hypothesis data, in which ChIP-seq and control come from the same genomic distributions. When applied to non-null data, RECAP p-values give a better estimate of the true statistical significance of candidate peaks and better false discovery rate estimates, which correlate better with empirical reproducibility. RECAP is a powerful new tool for assessing the true statistical significance of ChIP-seq peak calls.\n\nAvailabilityThe RECAP software is available on github at https://github.com/theodorejperkins/RECAP.\n\nContacttperkins@ohri.ca

bioinformatics↗