Glycome informatics: using systems biology to gain mechanistic insights into glycan biosynthesis

GlyCompute: towards the automated analysis of protein N-linked glycosylation kinetics via an open-source computational framework

Understanding the complex biosynthetic pathways of glycosylation is crucial for the expanding field of glycosciences. Computer-aided glycosylation analysis has greatly benefited in recent years from the development of tools found in web-based portals and open-source libraries. However, the in silico analysis of cellular glycosylation kinetics is underrepresented in current glycoscience-related tools and databases. This could be partly attributed to the limited accessibility of kinetic models developed using proprietary software and the difficulty in reliably parameterising such models. This work aims to address these challenges by proposing GlyCompute, an open-source framework demonstrating a novel, streamlined approach for the assembly, simulation, and parameterisation of kinetic models of protein N-linked glycosylation. Specifically, given one or more sets of experimentally observed N-glycan structures and their relative abundances, minimum representations of a glycosylation reaction network are generated. The topology of the resulting networks is then used to automatically assemble the material balances and kinetic mechanisms underpinning the mathematical model. To match the experimentally observed relative abundances, a sequential parameter estimation strategy using Bayesian inference is proposed, with stages determined automatically based on the underlying network topology. The proposed framework was tested on a case study involving the simultaneous fitting of the kinetic model to two protein N-linked glycoprofiles produced by the same CHO cell culture, showing good agreement with experimental observations. We envision that GlyCompute could help glycoscientists gain quantitative insights into the effect of enzyme kinetics and their perturbations on experimentally observed glycoprofiles in biomanufacturing and clinical settings.

Preparing glycomics data for robust statistical analysis with GlyCompareCT

GlyCompareCT is a portable command-line tool to facilitate downstream glycomic data analyses, by addressing data inherent sparsity and non-independence. Inputting glycan abundances, users can run GlyCompareCT with one line of code to obtain the abundances of a minimal substructure set, named glycomotif, thereby quantifying hidden biosynthetic relationships between measured glycans. Optional parameters tuning and annotation are supported for personal preference. For complete details on the use and execution of this protocol, please refer to Bao et al. (2021).1.

Quantum computing algorithms: getting closer to critical problems in computational biology

The recent biotechnological progress has allowed life scientists and physicians to access an unprecedented, massive amount of data at all levels (molecular, supramolecular, cellular and so on) of biological complexity. So far, mostly classical computational efforts have been dedicated to the simulation, prediction or de novo design of biomolecules, in order to improve the understanding of their function or to develop novel therapeutics. At a higher level of complexity, the progress of omics disciplines (genomics, transcriptomics, proteomics and metabolomics) has prompted researchers to develop informatics means to describe and annotate new biomolecules identified with a resolution down to the single cell, but also with a high-throughput speed. Machine learning approaches have been implemented to both the modelling studies and the handling of biomedical data. Quantum computing (QC) approaches hold the promise to resolve, speed up or refine the analysis of a wide range of these computational problems. Here, we review and comment on recently developed QC algorithms for biocomputing, with a particular focus on multi-scale modelling and genomic analyses. Indeed, differently from other computational approaches such as protein structure prediction, these problems have been shown to be adequately mapped onto quantum architectures, the main limit for their immediate use being the number of qubits and decoherence effects in the available quantum machines. Possible advantages over the classical counterparts are highlighted, along with a description of some hybrid classical/quantum approaches, which could be the closest to be realistically applied in biocomputation.