FLUXestimator: a webserver for predicting metabolic flux and variations using transcriptomics data.

Quantitative assessment of single cell fluxome is critical for understanding the metabolic heterogeneity in diseases. Unfortunately, laboratory-based single cell fluxomics is currently impractical, and the current computational tools for flux estimation are not designed for single cell-level prediction. Given the well-established link between transcriptomic and metabolomic profiles, leveraging single cell transcriptomics data to predict single cell fluxome is not only feasible but also an urgent task. In this study, we present FLUXestimator, an online platform for predicting metabolic fluxome and variations using single cell or general transcriptomics data of large sample-size. The FLUXestimator webserver implements a recently developed unsupervised approach called single cell flux estimation analysis (scFEA), which uses a new neural network architecture to estimate reaction rates from transcriptomics data. To the best of our knowledge, FLUXestimator is the first web-based tool dedicated to predicting cell-/sample-wise metabolic flux and metabolite variations using transcriptomics data of human, mouse and 15 other common experimental organisms. The FLUXestimator webserver is available at http://scFLUX.org/, and stand-alone tools for local use are available at https://github.com/changwn/scFEA. Our tool provides a new avenue for studying metabolic heterogeneity in diseases and has the potential to facilitate the development of new therapeutic strategies.

Progressively Learning to Reach Remote Goals by Continuously Updating Boundary Goals.

Training an effective policy on complex goal-reaching tasks with sparse rewards is an open challenge. It is more difficult for the task of reaching remote goals (RRG), as the unavailability of the original rewards and large Wasserstein distance between the distributions of desired goals and initial states make existing methods for common goal-reaching tasks inefficient or even completely ineffective. In this article, we propose progressively learning to reach remote goals by continuously updating boundary goals (PLUB), which solves RRG tasks by reducing the Wasserstein distance between the distributions of boundary goals and desired goals. Specifically, the concept of boundary goal is introduced, which is the set of the closest achieved goals for each desired goal. In addition, to reduce the computational complexity caused by the Wasserstein distance, the closest moving distance is introduced, which is its upper bound, and also the expectation of the distance between the desired goal and the closest boundary goal. By selecting the appropriate intermediate goal from all boundary goals and continuously updating boundary goals, both the closest moving distance and the Wasserstein distance can be reduced. As a result, RRG tasks degenerate into common goal-reaching tasks that can be efficiently solved by a combination of hindsight relabeling and the learning from demonstrations (LfD) method. Extensive experiments on several robotic manipulation tasks demonstrate that PLUB can bring substantial improvements over the existing methods.

Flux estimation analysis systematically characterizes the metabolic shifts of the central metabolism pathway in human cancer.

Introduction: Glucose and glutamine are major carbon and energy sources that promote the rapid proliferation of cancer cells. Metabolic shifts observed on cell lines or mouse models may not reflect the general metabolic shifts in real human cancer tissue. Method: In this study, we conducted a computational characterization of the flux distribution and variations of the central energy metabolism and key branches in a pan-cancer analysis, including the glycolytic pathway, production of lactate, tricarboxylic acid (TCA) cycle, nucleic acid synthesis, glutaminolysis, glutamate, glutamine, and glutathione metabolism, and amino acid synthesis, in 11 cancer subtypes and nine matched adjacent normal tissue types using TCGA transcriptomics data. Result: Our analysis confirms the increased influx in glucose uptake and glycolysis and decreased upper part of the TCA cycle, i.e., the Warburg effect, in almost all the analyzed cancer. However, increased lactate production and the second half of the TCA cycle were only seen in certain cancer types. More interestingly, we failed to detect significantly altered glutaminolysis in cancer tissues compared to their adjacent normal tissues. A systems biology model of metabolic shifts through cancer and tissue types is further developed and analyzed. We observed that (1) normal tissues have distinct metabolic phenotypes; (2) cancer types have drastically different metabolic shifts compared to their adjacent normal controls; and (3) the different shifts in tissue-specific metabolic phenotypes result in a converged metabolic phenotype through cancer types and cancer progression. Discussion: This study strongly suggests the possibility of having a unified framework for studies of cancer-inducing stressors, adaptive metabolic reprogramming, and cancerous behaviors.

Pipeline for characterizing alternative mechanisms (PCAM) based on bi-clustering to study colorectal cancer heterogeneity.

The cells of colorectal cancer (CRC) in their microenvironment experience constant stress, leading to dysregulated activity in the tumor niche. As a result, cancer cells acquire alternative pathways in response to the changing microenvironment, posing significant challenges for the design of effective cancer treatment strategies. While computational studies on high-throughput omics data have advanced our understanding of CRC subtypes, characterizing the heterogeneity of this disease remains remarkably complex. Here, we present a novel computational Pipeline for Characterizing Alternative Mechanisms (PCAM) based on biclustering to gain a more detailed understanding of cancer heterogeneity. Our application of PCAM to large-scale CRC transcriptomics datasets suggests that PCAM can generate a wealth of information leading to new biological understanding and predictive markers of alternative mechanisms. Our key findings include: 1) A comprehensive collection of alternative pathways in CRC, associated with biological and clinical factors. 2) Full annotation of detected alternative mechanisms, including their enrichment in known pathways and associations with various clinical outcomes. 3) A mechanistic relationship between known clinical subtypes and outcomes on a consensus map, visualized by the presence of alternative mechanisms. 4) Several potential novel alternative drug resistance mechanisms for Oxaliplatin, 5-Fluorouracil, and FOLFOX, some of which were validated on independent datasets. We believe that gaining a deeper understanding of alternative mechanisms is a critical step towards characterizing the heterogeneity of CRC. The hypotheses generated by PCAM, along with the comprehensive collection of biologically and clinically associated alternative pathways in CRC, could provide valuable insights into the underlying mechanisms driving cancer progression and drug resistance, which could aid in the development of more effective cancer therapies and guide experimental design towards more targeted and personalized treatment strategies. The computational pipeline of PCAM is available in GitHub (https://github.com/changwn/BC-CRC).

Generalized Matrix Local Low Rank Representation by Random Projection and Submatrix Propagation.

Matrix low rank approximation is an effective method to reduce or eliminate the statistical redundancy of its components. Compared with the traditional global low rank methods such as singular value decomposition (SVD), local low rank approximation methods are more advantageous to uncover interpretable data structures when clear duality exists between the rows and columns of the matrix. Local low rank approximation is equivalent to low rank submatrix detection. Unfortunately, existing local low rank approximation methods can detect only submatrices of specific mean structure, which may miss a substantial amount of true and interesting patterns. In this work, we develop a novel matrix computational framework called RPSP (Random Probing based submatrix Propagation) that provides an effective solution for the general matrix local low rank representation problem. RPSP detects local low rank patterns that grow from small submatrices of low rank property, which are determined by a random projection approach. RPSP is supported by theories of random projection. Experiments on synthetic data demonstrate that RPSP outperforms all state-of-the-art methods, with the capacity to robustly and correctly identify the low rank matrices when the pattern has a similar mean as the background, background noise is heteroscedastic and multiple patterns present in the data. On real-world datasets, RPSP also demonstrates its effectiveness in identifying interpretable local low rank matrices.