Pedro de Atauri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Pedro de Atauri has a total of 294 co-authors. Here are the top co-authors by number of shared publications:
- Marta Cascante
Department of Biochemistry and Molecular Biomedicine, Faculty of Biology, University of Barcelona, 08028 Barcelona, Spain
43 shared publications - Josep Joan Centelles
Universitat de Barcelona
16 shared publications - Carles Foguet
Cambridge Baker Systems Genomics Initiative, Department of Public Health and Primary Care, University of Cambridge, Cambridge, UK
8 shared publications - Silvia Marin
Department of Biochemistry and Molecular Biomedicine, Faculty of Biology, University of Barcelona, 08028 Barcelona, Spain
8 shared publications - Estefanía Moreno
Department of Biochemistry and Molecular Biomedicine, Faculty of Biology, Institute of Biomedicine of the University of Barcelona, University of Barcelona
6 shared publications - Pablo Moreno
European Molecular Biology Laboratory - European Bioinformatics Institute (EMBL-EBI), Wellcome Genome Campus
5 shared publications
Latest Publications
- Open Access
- 29 April 2025
- Published by Edicions de la Universitat de Barcelona in Reire Revista D'innovació I Recerca En Educació
- Vol. 18 (2) , 1-14
La intel·ligència artificial pot substituir el professorat? Determinació de l’equació de la velocitat d’una reacció utilitzant la tècnica de King i Altman
INTRODUCCIÓ. La tècnica de King i Altman és un mètode matemàtic per determinar la velocitat d’una reacció a partir del mecanisme de cinètica enzimàtica. Aquesta tècnica cerca el nombre de formes enzimàtiques (N) del mecanisme cíclic i les rutes amb N – 1 fletxes que van a cadascuna d’aquestes formes. La concentració relativa de cada forma (respecte a la concentració total de l’enzim) és el producte de les constants de cadascuna de les rutes en qüestió dividida pel de totes les rutes de les N – 1 fletxes de totes les formes enzimàtiques del sistema. Aquesta tècnica permet obtenir les equacions de velocitat ràpidament. MÈTODE. A partir d’una pàgina web es pot fer el càlcul de la velocitat de manera no manual. Malgrat tot, cal que els alumnes aprenguin a fer la tècnica manualment. RESULTATS. En aquest treball hem utilitzat ChatGPT 3.5 per consultar sobre la tècnica de King i Altman. També ho hem cercat mitjançant Google, però hem trobat molt pocs resultats. Pel que fa a ChatGPT 3.5, desconeix la tècnica i ens va respondre nombroses incorreccions. DISCUSSIÓ. Aquests resultats conclouen que cal avançar una mica més en la intel·ligència artificial per poder utilitzar-la com a professor.
- 29 April 2025
- Published by Edicions de la Universitat de Barcelona in Reire Revista D'innovació I Recerca En Educació
- Vol. 18 (2) , 1-14
Open AccessLa intel·ligència artificial pot substituir el professorat? Determinació de l’equació de la velocitat d’una reacció utilitzant la tècnica de King i Altman
INTRODUCCIÓ. La tècnica de King i Altman és un mètode matemàtic per determinar la velocitat d’una reacció a partir del mecanisme de cinètica enzimàtica. Aquesta tècnica cerca el nombre de formes enzimàtiques (N) del mecanisme cíclic i les rutes amb N – 1 fletxes que van a cadascuna d’aquestes formes. La concentració relativa de cada forma (respecte a la concentració total de l’enzim) és el producte de les constants de cadascuna de les rutes en qüestió dividida pel de totes les rutes de les N – 1 fletxes de totes les formes enzimàtiques del sistema. Aquesta tècnica permet obtenir les equacions de velocitat ràpidament. MÈTODE. A partir d’una pàgina web es pot fer el càlcul de la velocitat de manera no manual. Malgrat tot, cal que els alumnes aprenguin a fer la tècnica manualment. RESULTATS. En aquest treball hem utilitzat ChatGPT 3.5 per consultar sobre la tècnica de King i Altman. També ho hem cercat mitjançant Google, però hem trobat molt pocs resultats. Pel que fa a ChatGPT 3.5, desconeix la tècnica i ens va respondre nombroses incorreccions. DISCUSSIÓ. Aquests resultats conclouen que cal avançar una mica més en la intel·ligència artificial per poder utilitzar-la com a professor.
- Open Access
- 9 June 2024
- Published by ISTES Organization in International Journal on Engineering, Science and Technology
- Vol. 6 (1) , 55-67
Problem-Based Learning for Calculating Kinetic Parameters from Michaelis-Menten Equation
In “Advanced Enzymology” at the University of Barcelona, we teach various methods for identifying uni-uni irreversible reactions. Kinetic constants such as maximum velocity (Vmax) and Michaelis constant (Km) are calculated using non-linear regression with the Michaelis-Menten equation. However, if a computer is not available, students must calculate these kinetic parameters using linear regressions with Lineweaver-Burk, Eadie-Hofstee, and Hanes-Woolf plots. Michaelis-Menten equation: v = (Vmax [S]) / (Km + [S]), Lineweaver-Burk equation: 1/v = (Km/Vmax) (1/[S]) + 1/Vmax, Eadie-Hofstee equation: v = – Km (v/[S]) + Vmax, Hanes-Woolf equation: [S]/v = (1/Vmax) [S] + (Km/Vmax). The objective of this work was that students explore various methods for calculating kinetic constants and determine the most effective approach. A problem was prepared with data on substrate concentrations ([S]) and reaction rates (v). Data points with lower substrate concentration, and also with lower velocities had higher errors. The Michaelis-Menten plot provided only an approximate estimation of the kinetic constants, as it is not a linear graph. The Lineweaver-Burk plot generated maximum velocities that were too low due to the higher errors for low substrate concentrations, rendering impossible values of the kinetic parameters. The Eadie-Hofstee plot provided better results, as the values of v/[S] compensated their errors. Furthermore, kinetic constants were obtained directly from the slope and intersection of the line equation. The Hanes-Woolf plot also produced correct values for kinetic parameters, since high substrate concentrations were less erroneous than lower ones. After completing this computer class, students were very satisfied and learned the different methods for obtaining kinetic parameters. Non-linear regression is undoubtedly the most accurate method for obtaining kinetic parameters values. However, in the absence of computers, the Eadie-Hofstee plot is the best and most commonly used plot in kinetic papers.
- 9 June 2024
- Published by ISTES Organization in International Journal on Engineering, Science and Technology
- Vol. 6 (1) , 55-67
Open AccessProblem-Based Learning for Calculating Kinetic Parameters from Michaelis-Menten Equation
In “Advanced Enzymology” at the University of Barcelona, we teach various methods for identifying uni-uni irreversible reactions. Kinetic constants such as maximum velocity (Vmax) and Michaelis constant (Km) are calculated using non-linear regression with the Michaelis-Menten equation. However, if a computer is not available, students must calculate these kinetic parameters using linear regressions with Lineweaver-Burk, Eadie-Hofstee, and Hanes-Woolf plots. Michaelis-Menten equation: v = (Vmax [S]) / (Km + [S]), Lineweaver-Burk equation: 1/v = (Km/Vmax) (1/[S]) + 1/Vmax, Eadie-Hofstee equation: v = – Km (v/[S]) + Vmax, Hanes-Woolf equation: [S]/v = (1/Vmax) [S] + (Km/Vmax). The objective of this work was that students explore various methods for calculating kinetic constants and determine the most effective approach. A problem was prepared with data on substrate concentrations ([S]) and reaction rates (v). Data points with lower substrate concentration, and also with lower velocities had higher errors. The Michaelis-Menten plot provided only an approximate estimation of the kinetic constants, as it is not a linear graph. The Lineweaver-Burk plot generated maximum velocities that were too low due to the higher errors for low substrate concentrations, rendering impossible values of the kinetic parameters. The Eadie-Hofstee plot provided better results, as the values of v/[S] compensated their errors. Furthermore, kinetic constants were obtained directly from the slope and intersection of the line equation. The Hanes-Woolf plot also produced correct values for kinetic parameters, since high substrate concentrations were less erroneous than lower ones. After completing this computer class, students were very satisfied and learned the different methods for obtaining kinetic parameters. Non-linear regression is undoubtedly the most accurate method for obtaining kinetic parameters values. However, in the absence of computers, the Eadie-Hofstee plot is the best and most commonly used plot in kinetic papers.
- Open Access
- 18 October 2023
- Published by ISTES Organization in International Journal on Engineering, Science and Technology
- Vol. 5 (4) , 290-305
Self-learning by Using Code-Based Games: An Easy Way to Learn Biomolecule’s Nomenclature
The Montessori method was an educational model devised at the beginning of the 20th century by the Italian pedagogue, physician, psychologist, and psychiatrist María Montessori (1870-1952). She observed that her students activated their intelligence and developed their personality by carrying out manual activities. In recent years, one of the activities that she used, gamification, is currently booming in teaching. Games based in words or letters are often used in language learning, either in presential lessons or in mobile applications. In our teaching innovation group (GINDOC-UB/180), we proposed to adapt those word games using codes so that students could achieve a self-learning on the nomenclature of biomolecules, thus improving their knowledge in metabolism. These code-based games were proposed to Biochemistry students at the Chemistry degree of the Universitat de Barcelona. Games were posted on the Virtual Campus using Moodle. A code is part of a communicative system, and it is defined as a set of elements that allows a message to be decoded. In biochemistry, the best-known code is the genetic code that translates 3 nucleotides to an amino acid. The code allows the students to see that it is a degenerated code, and it was the first code-based game used. Nevertheless, only 20 amino acids are involved, and some letters are missing. Thus, we also used other codes such as numeric codes, Morse code, Braille system code, or codes from other alphabets (Japanese katakana or hiragana, Cyrillic alphabet, Arabic alphabet, or runic alphabet). In this work some examples of the games that can be proposed to the students are shown. Proposed games were highly valued by students and allowed a self-learning on the proposed biomolecules. Games based on the genetic code were easier and more enjoyable for the students to solve, and they provided them with additional biochemical knowledge of protein translation.
- 18 October 2023
- Published by ISTES Organization in International Journal on Engineering, Science and Technology
- Vol. 5 (4) , 290-305
Open AccessSelf-learning by Using Code-Based Games: An Easy Way to Learn Biomolecule’s Nomenclature
The Montessori method was an educational model devised at the beginning of the 20th century by the Italian pedagogue, physician, psychologist, and psychiatrist María Montessori (1870-1952). She observed that her students activated their intelligence and developed their personality by carrying out manual activities. In recent years, one of the activities that she used, gamification, is currently booming in teaching. Games based in words or letters are often used in language learning, either in presential lessons or in mobile applications. In our teaching innovation group (GINDOC-UB/180), we proposed to adapt those word games using codes so that students could achieve a self-learning on the nomenclature of biomolecules, thus improving their knowledge in metabolism. These code-based games were proposed to Biochemistry students at the Chemistry degree of the Universitat de Barcelona. Games were posted on the Virtual Campus using Moodle. A code is part of a communicative system, and it is defined as a set of elements that allows a message to be decoded. In biochemistry, the best-known code is the genetic code that translates 3 nucleotides to an amino acid. The code allows the students to see that it is a degenerated code, and it was the first code-based game used. Nevertheless, only 20 amino acids are involved, and some letters are missing. Thus, we also used other codes such as numeric codes, Morse code, Braille system code, or codes from other alphabets (Japanese katakana or hiragana, Cyrillic alphabet, Arabic alphabet, or runic alphabet). In this work some examples of the games that can be proposed to the students are shown. Proposed games were highly valued by students and allowed a self-learning on the proposed biomolecules. Games based on the genetic code were easier and more enjoyable for the students to solve, and they provided them with additional biochemical knowledge of protein translation.
- Open Access
- 27 July 2023
- Published by Elsevier in BioSystems
- Vol. 231, 104984
Control analysis in the identification of key enzymes driving metabolic adaptations: Towards drug target discovery
- 27 July 2023
- Published by Elsevier in BioSystems
- Vol. 231, 104984
Open AccessControl analysis in the identification of key enzymes driving metabolic adaptations: Towards drug target discovery
- Open Access
- 15 June 2023
- Published by ISTES Organization in International Journal on Engineering, Science and Technology
- Vol. 5 (1) , 74-88
Use of Several Grids in the Knight Tour’s Game to Find Shorter or Longer Biochemistry’s Sentences
Knight tour is a mathematical problem that was first solved by Leonhard Euler (1707-1785). The problem consists in finding if it is possible that the knight piece of chess can tour through all the boxes of a chess grid, passing only once through each box. Bishop piece can only move to diagonal boxes of one color, and pawns can only move in one column. It can be easily seen that king, queen and rook can move through all the boxes. But it was not clear that the knight could move all through. Euler found several solutions for the 8x8 grid, and he numbered all the boxes of the grid in the order through which the knight passed. Surprisingly, he obtained some solutions with semi-magic squares, in which the sum of all the numbers of each row and column was the same. Nevertheless, diagonals didn’t sum the same, as happens in the magic squares. One of the typical games in word game’s books is the knight tour, with a 5x5 grid, that hides a 25-syllable sentence. The objective of this work was to study other grids, to obtain different sentences length with 3x3 (9-syllables), 4x4 (16-syllables), 5x5 (25 syllables), 6x6 (36 syllables) or 7x7 (49 syllables) grids. Thus, this game would be more versatile and could be used more extensively than limiting it to 25-syllable sentences.
- 15 June 2023
- Published by ISTES Organization in International Journal on Engineering, Science and Technology
- Vol. 5 (1) , 74-88
Open AccessUse of Several Grids in the Knight Tour’s Game to Find Shorter or Longer Biochemistry’s Sentences
Knight tour is a mathematical problem that was first solved by Leonhard Euler (1707-1785). The problem consists in finding if it is possible that the knight piece of chess can tour through all the boxes of a chess grid, passing only once through each box. Bishop piece can only move to diagonal boxes of one color, and pawns can only move in one column. It can be easily seen that king, queen and rook can move through all the boxes. But it was not clear that the knight could move all through. Euler found several solutions for the 8x8 grid, and he numbered all the boxes of the grid in the order through which the knight passed. Surprisingly, he obtained some solutions with semi-magic squares, in which the sum of all the numbers of each row and column was the same. Nevertheless, diagonals didn’t sum the same, as happens in the magic squares. One of the typical games in word game’s books is the knight tour, with a 5x5 grid, that hides a 25-syllable sentence. The objective of this work was to study other grids, to obtain different sentences length with 3x3 (9-syllables), 4x4 (16-syllables), 5x5 (25 syllables), 6x6 (36 syllables) or 7x7 (49 syllables) grids. Thus, this game would be more versatile and could be used more extensively than limiting it to 25-syllable sentences.
- Open Access
- 30 January 2023
- Published by Edicions de la Universitat de Barcelona in Revista d'Innovació Docent Universitària
- p. 28-41
Refuerzo de conocimientos de Bioquímica aplicando juegos de letras o de palabras sencillos
Introducción y problema: Los juegos son muy apreciados por la población en general, así que realizamos una búsqueda de diversos juegos con la finalidad de utilizarlos para reforzar los conocimientos en bioquímica de los alumnos del grado de Química de la Universidad de Barcelona. Los juegos de los libros de pasatiempos están basados en dos posibilidades: números y letras. Entre los juegos de letras los más frecuentes son los crucigramas, autodefinidos, palabras cruzadas y sopas de letras. Metodología: Para reforzar los conocimientos de los estudiantes en Bioquímica, realizamos una búsqueda de juegos de palabras usados en el aprendizaje de gramática de idiomas, para luego adaptarlos a la nomenclatura y estructura de biomoléculas en Bioquímica. Siguiendo una aproximación conductista, utilizamos el modelo de Dick y Carey. Resultados y discusión: Los juegos más sencillos sobre palabras se basan en buscar dentro de un conjunto de palabras, aquellas que tengan alguna parte en común. En este sentido, implementamos juegos de rimas, en los que las palabras terminan en –ina (terminación frecuente de los aminoácidos, bases nitrogenadas, nucleósidos y algunas proteínas), en –osa (terminación frecuente de los hidratos de carbono), o en –ico / –ato (terminación frecuente de los ácidos grasos y otros ácidos intermediarios del metabolismo, o de sus sales correspondientes). Así pues, los alumnos pueden observar estas características en la nomenclatura. Por otro lado, también implementamos juegos de palabras incompletas que se basan en completar los nombres de los metabolitos utilizando grupos de letras a escoger. Los juegos se clasificaron en 4 grupos y se presentan algunos ejemplos de estos. Respecto a la dificultad, los juegos tipo dominó son los más difíciles de resolver, pues requieren conocer tanto la nomenclatura como la estructura de las biomoléculas. Conclusiones: Nuestra propuesta incluye diversos juegos de palabras que permiten reforzar conocimientos de Bioquímica.
- 30 January 2023
- Published by Edicions de la Universitat de Barcelona in Revista d'Innovació Docent Universitària
- p. 28-41
Open AccessRefuerzo de conocimientos de Bioquímica aplicando juegos de letras o de palabras sencillos
Introducción y problema: Los juegos son muy apreciados por la población en general, así que realizamos una búsqueda de diversos juegos con la finalidad de utilizarlos para reforzar los conocimientos en bioquímica de los alumnos del grado de Química de la Universidad de Barcelona. Los juegos de los libros de pasatiempos están basados en dos posibilidades: números y letras. Entre los juegos de letras los más frecuentes son los crucigramas, autodefinidos, palabras cruzadas y sopas de letras. Metodología: Para reforzar los conocimientos de los estudiantes en Bioquímica, realizamos una búsqueda de juegos de palabras usados en el aprendizaje de gramática de idiomas, para luego adaptarlos a la nomenclatura y estructura de biomoléculas en Bioquímica. Siguiendo una aproximación conductista, utilizamos el modelo de Dick y Carey. Resultados y discusión: Los juegos más sencillos sobre palabras se basan en buscar dentro de un conjunto de palabras, aquellas que tengan alguna parte en común. En este sentido, implementamos juegos de rimas, en los que las palabras terminan en –ina (terminación frecuente de los aminoácidos, bases nitrogenadas, nucleósidos y algunas proteínas), en –osa (terminación frecuente de los hidratos de carbono), o en –ico / –ato (terminación frecuente de los ácidos grasos y otros ácidos intermediarios del metabolismo, o de sus sales correspondientes). Así pues, los alumnos pueden observar estas características en la nomenclatura. Por otro lado, también implementamos juegos de palabras incompletas que se basan en completar los nombres de los metabolitos utilizando grupos de letras a escoger. Los juegos se clasificaron en 4 grupos y se presentan algunos ejemplos de estos. Respecto a la dificultad, los juegos tipo dominó son los más difíciles de resolver, pues requieren conocer tanto la nomenclatura como la estructura de las biomoléculas. Conclusiones: Nuestra propuesta incluye diversos juegos de palabras que permiten reforzar conocimientos de Bioquímica.
- Open Access
- 16 January 2022
- Published by ISTES Organization in International Journal on Engineering, Science and Technology
- Vol. 3 (2) , 155-164
An Escape-Room about Krebs cycle prepared for Chemical Students
Games are excellent teaching tools for self-learning. Students playing a game enjoy themselves and at the same time learn basic and important concepts. Different games including crossword puzzles, word search puzzles, knight’s tour games, connecting dots, mazes, matching two sets, amidakuji, and logic games were used for continuous assessment during the confinement due to pandemic. These games were developed as part of the GINDO-UB180 teaching innovation group activities. Since these games were very successful, we decided to combine all of them and construct a new teaching activity, that would help our students to study one essential metabolic pathway: The Krebs cycle. This activity (https://forms.gle/BPvpnLQRNYNPxcLQ7) is an Escape-room, and it was recently tested by our students in a General Biochemistry course. The code of the Escape room after the game is a word: either the longest in the letter soup, an anagram from several boxes from the crossword puzzles, the sentence from the knight’s tour game, or a word obtained following a maze. The results obtained after carrying out the Escape room will be compared with those obtained using previous tasks in terms of assessment and acceptance by the students in order to be included in the future as self-evaluation activities.
- 16 January 2022
- Published by ISTES Organization in International Journal on Engineering, Science and Technology
- Vol. 3 (2) , 155-164
Open AccessAn Escape-Room about Krebs cycle prepared for Chemical Students
Games are excellent teaching tools for self-learning. Students playing a game enjoy themselves and at the same time learn basic and important concepts. Different games including crossword puzzles, word search puzzles, knight’s tour games, connecting dots, mazes, matching two sets, amidakuji, and logic games were used for continuous assessment during the confinement due to pandemic. These games were developed as part of the GINDO-UB180 teaching innovation group activities. Since these games were very successful, we decided to combine all of them and construct a new teaching activity, that would help our students to study one essential metabolic pathway: The Krebs cycle. This activity (https://forms.gle/BPvpnLQRNYNPxcLQ7) is an Escape-room, and it was recently tested by our students in a General Biochemistry course. The code of the Escape room after the game is a word: either the longest in the letter soup, an anagram from several boxes from the crossword puzzles, the sentence from the knight’s tour game, or a word obtained following a maze. The results obtained after carrying out the Escape room will be compared with those obtained using previous tasks in terms of assessment and acceptance by the students in order to be included in the future as self-evaluation activities.
- Open Access
- 23 July 2021
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 17 (7) , e1009234
Integrating systemic and molecular levels to infer key drivers sustaining metabolic adaptations
Metabolic adaptations to complex perturbations, like the response to pharmacological treatments in multifactorial diseases such as cancer, can be described through measurements of part of the fluxes and concentrations at the systemic level and individual transporter and enzyme activities at the molecular level. In the framework of Metabolic Control Analysis (MCA), ensembles of linear constraints can be built integrating these measurements at both systemic and molecular levels, which are expressed as relative differences or changes produced in the metabolic adaptation. Here, combining MCA with Linear Programming, an efficient computational strategy is developed to infer additional non-measured changes at the molecular level that are required to satisfy these constraints. An application of this strategy is illustrated by using a set of fluxes, concentrations, and differentially expressed genes that characterize the response to cyclin-dependent kinases 4 and 6 inhibition in colon cancer cells. Decreases and increases in transporter and enzyme individual activities required to reprogram the measured changes in fluxes and concentrations are compared with down-regulated and up-regulated metabolic genes to unveil those that are key molecular drivers of the metabolic response.
- 23 July 2021
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 17 (7) , e1009234
Open AccessIntegrating systemic and molecular levels to infer key drivers sustaining metabolic adaptations
Metabolic adaptations to complex perturbations, like the response to pharmacological treatments in multifactorial diseases such as cancer, can be described through measurements of part of the fluxes and concentrations at the systemic level and individual transporter and enzyme activities at the molecular level. In the framework of Metabolic Control Analysis (MCA), ensembles of linear constraints can be built integrating these measurements at both systemic and molecular levels, which are expressed as relative differences or changes produced in the metabolic adaptation. Here, combining MCA with Linear Programming, an efficient computational strategy is developed to infer additional non-measured changes at the molecular level that are required to satisfy these constraints. An application of this strategy is illustrated by using a set of fluxes, concentrations, and differentially expressed genes that characterize the response to cyclin-dependent kinases 4 and 6 inhibition in colon cancer cells. Decreases and increases in transporter and enzyme individual activities required to reprogram the measured changes in fluxes and concentrations are compared with down-regulated and up-regulated metabolic genes to unveil those that are key molecular drivers of the metabolic response.
- Open Access
Cysteine and Folate Metabolism Are Targetable Vulnerabilities of Metastatic Colorectal Cancer
With most cancer-related deaths resulting from metastasis, the development of new therapeutic approaches against metastatic colorectal cancer (mCRC) is essential to increasing patient survival. The metabolic adaptations that support mCRC remain undefined and their elucidation is crucial to identify potential therapeutic targets. Here, we employed a strategy for the rational identification of targetable metabolic vulnerabilities. This strategy involved first a thorough metabolic characterisation of same-patient-derived cell lines from primary colon adenocarcinoma (SW480), its lymph node metastasis (SW620) and a liver metastatic derivative (SW620-LiM2), and second, using a novel multi-omics integration workflow, identification of metabolic vulnerabilities specific to the metastatic cell lines. We discovered that the metastatic cell lines are selectively vulnerable to the inhibition of cystine import and folate metabolism, two key pathways in redox homeostasis. Specifically, we identified the system xCT and MTHFD1 genes as potential therapeutic targets, both individually and combined, for combating mCRC.
Open AccessCysteine and Folate Metabolism Are Targetable Vulnerabilities of Metastatic Colorectal Cancer
With most cancer-related deaths resulting from metastasis, the development of new therapeutic approaches against metastatic colorectal cancer (mCRC) is essential to increasing patient survival. The metabolic adaptations that support mCRC remain undefined and their elucidation is crucial to identify potential therapeutic targets. Here, we employed a strategy for the rational identification of targetable metabolic vulnerabilities. This strategy involved first a thorough metabolic characterisation of same-patient-derived cell lines from primary colon adenocarcinoma (SW480), its lymph node metastasis (SW620) and a liver metastatic derivative (SW620-LiM2), and second, using a novel multi-omics integration workflow, identification of metabolic vulnerabilities specific to the metastatic cell lines. We discovered that the metastatic cell lines are selectively vulnerable to the inhibition of cystine import and folate metabolism, two key pathways in redox homeostasis. Specifically, we identified the system xCT and MTHFD1 genes as potential therapeutic targets, both individually and combined, for combating mCRC.
- Open Access
- 6 September 2019
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 15 (9) , e1007310
p13CMFA: Parsimonious 13C metabolic flux analysis
Deciphering the mechanisms of regulation of metabolic networks subjected to perturbations, including disease states and drug-induced stress, relies on tracing metabolic fluxes. One of the most informative data to predict metabolic fluxes are 13C based metabolomics, which provide information about how carbons are redistributed along central carbon metabolism. Such data can be integrated using 13C Metabolic Flux Analysis (13C MFA) to provide quantitative metabolic maps of flux distributions. However, 13C MFA might be unable to reduce the solution space towards a unique solution either in large metabolic networks or when small sets of measurements are integrated. Here we present parsimonious 13C MFA (p13CMFA), an approach that runs a secondary optimization in the 13C MFA solution space to identify the solution that minimizes the total reaction flux. Furthermore, flux minimization can be weighted by gene expression measurements allowing seamless integration of gene expression data with 13C data. As proof of concept, we demonstrate how p13CMFA can be used to estimate intracellular flux distributions from 13C measurements and transcriptomics data. We have implemented p13CMFA in Iso2Flux, our in-house developed isotopic steady-state 13C MFA software. The source code is freely available on GitHub (https://github.com/cfoguet/iso2flux/releases/tag/0.7.2). 13C Metabolic Flux Analysis (13C MFA) is a well-established technique that has proven to be a valuable tool in quantifying the metabolic flux profile of central carbon metabolism. When a biological system is incubated with a 13C-labeled substrate, 13C propagates to metabolites throughout the metabolic network in a flux and pathway-dependent manner. 13C MFA integrates measurements of 13C enrichment in metabolites to identify the flux distributions consistent with the measured 13C propagation. However, there is often a range of flux values that can lead to the observed 13C distribution. Indeed, either when the metabolic network is large or a small set of measurements are integrated, the range of valid solutions can be too wide to accurately estimate part of the underlying flux distribution. Here we propose to use flux minimization to select the best flux solution in the13C MFA solution space. Furthermore, this approach can integrate gene expression data to give greater weight to the minimization of fluxes through enzymes with low gene expression evidence in order to ensure that the selected solution is biologically relevant. The concept of using flux minimization to select the best solution is widely used in flux balance analysis, but it had never been applied in the framework of 13C MFA. We have termed this new approach parsimonious 13C MFA (p13CMFA).
- 6 September 2019
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 15 (9) , e1007310
Open Accessp13CMFA: Parsimonious 13C metabolic flux analysis
Deciphering the mechanisms of regulation of metabolic networks subjected to perturbations, including disease states and drug-induced stress, relies on tracing metabolic fluxes. One of the most informative data to predict metabolic fluxes are 13C based metabolomics, which provide information about how carbons are redistributed along central carbon metabolism. Such data can be integrated using 13C Metabolic Flux Analysis (13C MFA) to provide quantitative metabolic maps of flux distributions. However, 13C MFA might be unable to reduce the solution space towards a unique solution either in large metabolic networks or when small sets of measurements are integrated. Here we present parsimonious 13C MFA (p13CMFA), an approach that runs a secondary optimization in the 13C MFA solution space to identify the solution that minimizes the total reaction flux. Furthermore, flux minimization can be weighted by gene expression measurements allowing seamless integration of gene expression data with 13C data. As proof of concept, we demonstrate how p13CMFA can be used to estimate intracellular flux distributions from 13C measurements and transcriptomics data. We have implemented p13CMFA in Iso2Flux, our in-house developed isotopic steady-state 13C MFA software. The source code is freely available on GitHub (https://github.com/cfoguet/iso2flux/releases/tag/0.7.2). 13C Metabolic Flux Analysis (13C MFA) is a well-established technique that has proven to be a valuable tool in quantifying the metabolic flux profile of central carbon metabolism. When a biological system is incubated with a 13C-labeled substrate, 13C propagates to metabolites throughout the metabolic network in a flux and pathway-dependent manner. 13C MFA integrates measurements of 13C enrichment in metabolites to identify the flux distributions consistent with the measured 13C propagation. However, there is often a range of flux values that can lead to the observed 13C distribution. Indeed, either when the metabolic network is large or a small set of measurements are integrated, the range of valid solutions can be too wide to accurately estimate part of the underlying flux distribution. Here we propose to use flux minimization to select the best flux solution in the13C MFA solution space. Furthermore, this approach can integrate gene expression data to give greater weight to the minimization of fluxes through enzymes with low gene expression evidence in order to ensure that the selected solution is biologically relevant. The concept of using flux minimization to select the best solution is widely used in flux balance analysis, but it had never been applied in the framework of 13C MFA. We have termed this new approach parsimonious 13C MFA (p13CMFA).