Francisco J. Planes

Francisco J. Planes

Auto-generated profile, based on publicly available information

Francisco J. Planes

CEIT and TECNUN, University of Navarra, Manuel de Lardizabal 15, 20018 San Sebastian, Spain

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 May 2011 in Genome Biology
Verified
Journal Article
Open access
PDF file
JPJon Pey
Jon Pey
JCJoaquin M Prada Jimenez de Cisneros
Joaquin M Prada Jimenez de Cisneros
JBJohn E Beasley
John E Beasley
FPFrancisco J Planes
Francisco J Planes
Graph-based methods have been widely used for the analysis of biological networks. Their application to metabolic networks has been much discussed, in particular noting that an important weakness in such methods is that reaction stoichiometry is neglected. In this study, we show that reaction stoichiometry can be incorporated into path-finding approaches via mixed-integer linear programming. This major advance at the modeling level results in improved prediction of topological and functional properties in metabolic networks.

10 April 2014 in Bioinformatics
Verified
Journal Article
Closed access
PDF file
JPJon Pey
Jon Pey
FPFrancisco J. Planes
Francisco J. Planes
Motivation: The concept of Elementary Flux Mode (EFM) has been widely used for the past 20 years. However, its application to genome-scale metabolic networks (GSMNs) is still under development because of methodological limitations. Therefore, novel approaches are demanded to extend the application of EFMs. A novel family of methods based on optimization is emerging that provides us with a subset of EFMs. Because the calculation of the whole set of EFMs goes beyond our capacity, performing a selective search is a proper strategy.

6 November 2014 in Bioinformatics
Verified
Journal Article
Open access
PDF file
JPJon Pey
Jon Pey
JVJuan A. Villar
Juan A. Villar
LTLuis Tobalina
Luis Tobalina
ARAlberto Rezola
Alberto Rezola
Ginés García-MateosGinés García-Mateos
Ginés García-Mateos
FPFrancisco J. Planes
Francisco J. Planes
Motivation: Elementary flux modes (EFMs) analysis constitutes a fundamental tool in systems biology. However, the efficient calculation of EFMs in genome-scale metabolic networks (GSMNs) is still a challenge. We present a novel algorithm that uses a linear programming-based tree search and efficiently enumerates a subset of EFMs in GSMNs. Results: Our approach is compared with the EFMEvolver approach, demonstrating a significant improvement in computation time. We also validate the usefulness of our new approach by studying the acetate overflow metabolism in the Escherichia coli bacteria. To do so, we computed 1 million EFMs for each energetic amino acid and then analysed the relevance of each energetic amino acid based on gene/protein expression data and the obtained EFMs. We found good agreement between previous experiments and the conclusions reached using EFMs. Finally, we also analysed the performance of our approach when applied to large GSMNs. Availability and implementation: The stand-alone software TreeEFM is implemented in C++ and interacts with the open-source linear solver COIN-OR Linear program Solver (CLP). Contact: fplanes@ceit.es Supplementary information: Supplementary data are available at Bioinformatics online.

19 July 2013 in BMC Systems Biology
Verified
Journal Article
Open access
PDF file
JPJon Pey
Jon Pey
LTLuis Tobalina
Luis Tobalina
JCJoaquin M Prada Jimenez de Cisneros
Joaquin M Prada Jimenez de Cisneros
FPFrancisco J Planes
Francisco J Planes
Background: The study of metabolism has attracted much attention during the last years due to its relevance in various diseases. The advance in metabolomics platforms allows us to detect an increasing number of metabolites in abnormal high/low concentration in a disease phenotype. Finding a mechanistic interpretation for these alterations is important to understand pathophysiological processes, however it is not an easy task. The availability of genome scale metabolic networks and Systems Biology techniques open new avenues to address this question. Results: In this article we present a novel mathematical framework to find enzymes whose malfunction explains the accumulation/depletion of a given metabolite in a disease phenotype. Our approach is based on a recently introduced pathway concept termed Carbon Flux Paths (CFPs), which extends classical topological definition by including network stoichiometry. Using CFPs, we determine the Connectivity Curve of an altered metabolite, which allows us to quantify changes in its pathway structure when a certain enzyme is removed. The influence of enzyme removal is then ranked and used to explain the accumulation/depletion of such metabolite. For illustration, we center our study in the accumulation of two metabolites (L-Cystine and Homocysteine) found in high concentration in the brain of patients with mental disorders. Our results were discussed based on literature and found a good agreement with previously reported mechanisms. In addition, we hypothesize a novel role of several enzymes for the accumulation of these metabolites, which opens new strategies to understand the metabolic processes underlying these diseases. Conclusions: With personalized medicine on the horizon, metabolomic platforms are providing us with a vast amount of experimental data for a number of complex diseases. Our approach provides a novel apparatus to rationally investigate and understand metabolite alterations under disease phenotypes. This work contributes to the development of Systems Medicine, whose objective is to answer clinical questions based on theoretical methods and high-throughput “omics” data.

4 May 2016 in PLOS ONE
Verified
Journal Article
Open access
PDF file
LTLuis Tobalina
Luis Tobalina
JPJon Pey
Jon Pey
ARAlberto Rezola
Alberto Rezola
FPFrancisco J. Planes
Francisco J. Planes
Gene Essentiality Analysis based on Flux Balance Analysis (FBA-based GEA) is a promising tool for the identification of novel metabolic therapeutic targets in cancer. The reconstruction of cancer-specific metabolic networks, typically based on gene expression data, constitutes a sensible step in this approach. However, to our knowledge, no extensive assessment on the influence of the reconstruction process on the obtained results has been carried out to date. In this article, we aim to study context-specific networks and their FBA-based GEA results for the identification of cancer-specific metabolic essential genes. To that end, we used gene expression datasets from the Cancer Cell Line Encyclopedia (CCLE), evaluating the results obtained in 174 cancer cell lines. In order to more clearly observe the effect of cancer-specific expression data, we did the same analysis using randomly generated expression patterns. Our computational analysis showed some essential genes that are fairly common in the reconstructions derived from both gene expression and randomly generated data. However, though of limited size, we also found a subset of essential genes that are very rare in the randomly generated networks, while recurrent in the sample derived networks, and, thus, would presumably constitute relevant drug targets for further analysis. In addition, we compare the in-silico results to high-throughput gene silencing experiments from Project Achilles with conflicting results, which leads us to raise several questions, particularly the strong influence of the selected biomass reaction on the obtained results. Notwithstanding, using previous literature in cancer research, we evaluated the most relevant of our targets in three different cancer cell lines, two derived from Gliobastoma Multiforme and one from Non-Small Cell Lung Cancer, finding that some of the predictions are in the right track.

28 February 2016 in Bioinformatics
Verified
Journal Article
Open access
PDF file
LTLuis Tobalina
Luis Tobalina
JPJon Pey
Jon Pey
FPFrancisco J. Planes
Francisco J. Planes
Motivation: The concept of Minimal Cut Sets (MCSs) is used in metabolic network modeling to describe minimal groups of reactions or genes whose simultaneous deletion eliminates the capability of the network to perform a specific task. Previous work showed that MCSs where closely related to Elementary Flux Modes (EFMs) in a particular dual problem, opening up the possibility to use the tools developed for computing EFMs to compute MCSs. Until recently, however, there existed no method to compute an EFM with some specific characteristic, meaning that, in the case of MCSs, the only strategy to obtain them was to enumerate them using, for example, the standard K-shortest EFMs algorithm. Results: In this work, we adapt the recently developed theory to compute EFMs satisfying several constraints to the calculation of MCSs involving a specific reaction knock-out. Importantly, we emphasize that not all the EFMs in the dual problem correspond to real MCSs, and propose a new formulation capable of correctly identifying the MCS wanted. Furthermore, this formulation brings interesting insights about the relationship between the primal and the dual problem of the MCS computation. Availability and implementation: A Matlab-Cplex implementation of the proposed algorithm is available as a supplementary material . Contact:fplanes@ceit.es Supplementary information: Supplementary data are available at Bioinformatics online.