Demo Data from EDBT 2026 / reviewers in the wild / expert
Francisco Guil 0002
dblp:160/8041 · also Francisco De Asís Guil Asensio
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0002-6846-1888ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › systems biology
metabolic network analysis |
1.1 | 2 | 2023 | On the representativeness and stability of a set of EFMs · Bioinform. 2023 Boosting the extraction of elementary flux modes in genome-scale metabolic networks using the linear programming approach · Bioinform. 2020 |
Bioinformatics and computational biology › systems biology › metabolic network analysis
elementary flux modes |
0.7 | 1 | 2023 | On the representativeness and stability of a set of EFMs · Bioinform. 2023 |
Bioinformatics and computational biology › systems biology › metabolic network analysis
elementary flux mode computation |
0.4 | 1 | 2020 | Boosting the extraction of elementary flux modes in genome-scale metabolic networks using the linear programming approach · Bioinform. 2020 |
Mathematical optimization
linear programming |
0.4 | 1 | 2020 | Boosting the extraction of elementary flux modes in genome-scale metabolic networks using the linear programming approach · Bioinform. 2020 |
Bioinformatics and computational biology › systems biology › metabolic network analysis
genome-scale metabolic model analysis |
0.1 | 1 | 2020 | Boosting the extraction of elementary flux modes in genome-scale metabolic networks using the linear programming approach · Bioinform. 2020 |
Methods — techniques the papers use, named apart from their topics
simplex method · 0.9linear programming · 0.9elementary flux modes · 0.9elementary flux mode computation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | On the representativeness and stability of a set of EFMsabstractMOTIVATION: Elementary flux modes are a well-known tool for analyzing metabolic networks. The whole set of elementary flux modes (EFMs) cannot be computed in most genome-scale networks due to their large cardinality. Therefore, different methods have been proposed to compute a smaller subset of EFMs that can be used for studying the structure of the network. These latter methods pose the problem of studying the representativeness of the calculated subset. In this article, we present a methodology to tackle this problem. RESULTS: We have introduced the concept of stability for a particular network parameter and its relation to the representativeness of the EFM extraction method studied. We have also defined several metrics to study and compare the EFM biases. We have applied these techniques to compare the relative behavior of previously proposed methods in two case studies. Furthermore, we have presented a new method for the EFM computation (PiEFM), which is more stable (less biased) than previous ones, has suitable representativeness measures, and exhibits better variability in the extracted EFMs. AVAILABILITY AND IMPLEMENTATION: Software and additional material are freely available at https://github.com/biogacop/PiEFM. Francisco Guil 0002, José F. Hidalgo, José M. García 0001 |
Bioinform. | 1 |
| 2020 | Boosting the extraction of elementary flux modes in genome-scale metabolic networks using the linear programming approachabstractMOTIVATION: Elementary flux modes (EFMs) are a key tool for analyzing genome-scale metabolic networks, and several methods have been proposed to compute them. Among them, those based on solving linear programming (LP) problems are known to be very efficient if the main interest lies in computing large enough sets of EFMs. RESULTS: Here, we propose a new method called EFM-Ta that boosts the efficiency rate by analyzing the information provided by the LP solver. We base our method on a further study of the final tableau of the simplex method. By performing additional elementary steps and avoiding trivial solutions consisting of two cycles, we obtain many more EFMs for each LP problem posed, improving the efficiency rate of previously proposed methods by more than one order of magnitude. AVAILABILITY AND IMPLEMENTATION: Software is freely available at https://github.com/biogacop/Boost_LP_EFM. CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Francisco Guil 0002, José F. Hidalgo, José M. García 0001 |
Bioinform. | 1 |