VLDB 2026 Research / reviewers in the wild / expert
Paulo Vieira Milreu
dblp:49/109
· DBLP profile ↗
8ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5 · 2 first-authorTheory of computation · 3Artificial intelligence and machine learning · 1
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 |
Algorithms and data structures · 50% Computational complexity · 50% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › systems bioinformatics › pathway analysis
metabolic pathway analysis |
0.2 | 1 | 2014 | Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure · Bioinform. 2014 |
Bioinformatics and computational biology
metabolomics |
0.2 | 1 | 2014 | Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure · Bioinform. 2014 |
Bioinformatics and computational biology › systems bioinformatics › pathway analysis
pathway ranking |
0.2 | 1 | 2014 | Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure · Bioinform. 2014 |
Bioinformatics and computational biology › systems biology
metabolic network analysis |
0.1 | 1 | 2012 | Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks · Bioinform. 2012 |
Algorithms and data structures › combinatorial algorithms
enumeration algorithms |
0.1 | 1 | 2012 | Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks · Bioinform. 2012 |
Computational complexity › counting complexity
hardness of enumeration |
0.1 | 1 | 2012 | Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks · Bioinform. 2012 |
Methods — techniques the papers use, named apart from their topics
factory-based algorithm · 0.3combinatorial characterization · 0.3network analysis · 0.2graph-based scenario enumeration · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposureabstractMOTIVATION: The increasing availability of metabolomics data enables to better understand the metabolic processes involved in the immediate response of an organism to environmental changes and stress. The data usually come in the form of a list of metabolites whose concentrations significantly changed under some conditions, and are thus not easy to interpret without being able to precisely visualize how such metabolites are interconnected. RESULTS: We present a method that enables to organize the data from any metabolomics experiment into metabolic stories. Each story corresponds to a possible scenario explaining the flow of matter between the metabolites of interest. These scenarios may then be ranked in different ways depending on which interpretation one wishes to emphasize for the causal link between two affected metabolites: enzyme activation, enzyme inhibition or domino effect on the concentration changes of substrates and products. Equally probable stories under any selected ranking scheme can be further grouped into a single anthology that summarizes, in a unique subnetwork, all equivalently plausible alternative stories. An anthology is simply a union of such stories. We detail an application of the method to the response of yeast to cadmium exposure. We use this system as a proof of concept for our method, and we show that we are able to find a story that reproduces very well the current knowledge about the yeast response to cadmium. We further show that this response is mostly based on enzyme activation. We also provide a framework for exploring the alternative pathways or side effects this local response is expected to have in the rest of the network. We discuss several interpretations for the changes we see, and we suggest hypotheses that could in principle be experimentally tested. Noticeably, our method requires simple input data and could be used in a wide variety of applications. AVAILABILITY AND IMPLEMENTATION: The code for the method presented in this article is available at http://gobbolino.gforge.inria.fr. Paulo Vieira Milreu, Cecilia Coimbra Klein, Ludovic Cottret, Vicente Acuña, Etienne Birmelé, Michele Borassi, Christophe Junot, Alberto Marchetti-Spaccamela, Andrea Marino 0001, Leen Stougie, Fabien Jourdan, Pierluigi Crescenzi, Vincent Lacroix, Marie-France Sagot |
Bioinform. | 1 |
| 2013 | Telling Stories Fast
Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino 0001, Marie-France Sagot, Paulo Vieira Milreu |
SEA | 6 |
| 2012 | Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone
Alexandre S. Freire, Vicente Acuña, Pierluigi Crescenzi, Carlos Eduardo Ferreira, Vincent Lacroix, Paulo Vieira Milreu, Eduardo Moreno 0001, Marie-France Sagot |
ISCO | 6 |
| 2012 | Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networksabstractMOTIVATION: In the context of studying whole metabolic networks and their interaction with the environment, the following question arises: given a set of target metabolites T and a set of possible external source metabolites , which are the minimal subsets of that are able to produce all the metabolites in T. Such subsets are called the minimal precursor sets of T. The problem is then whether we can enumerate all of them efficiently. RESULTS: We propose a new characterization of precursor sets as the inputs of reaction sets called factories and an efficient algorithm to decide if a set of sources is precursor set of T. We show proofs of hardness for the problems of finding a precursor set of minimum size and of enumerating all minimal precursor sets T. We propose two new algorithms which, despite the hardness of the enumeration problem, allow to enumerate all minimal precursor sets in networks with up to 1000 reactions. AVAILABILITY: Source code and datasets used in our benchmarks are freely available for download at http://sites.google.com/site/pitufosoftware/download. CONTACT: [email protected], [email protected] or [email protected]. Vicente Acuña, Paulo Vieira Milreu, Ludovic Cottret, Alberto Marchetti-Spaccamela, Leen Stougie, Marie-France Sagot |
Bioinform. | 2 |
| 2012 | Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Vicente Acuña, Etienne Birmelé, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, Vincent Lacroix, Alberto Marchetti-Spaccamela, Andrea Marino 0001, Paulo Vieira Milreu, Marie-France Sagot, Leen Stougie |
Theor. Comput. Sci. | 9 |
| 2010 | Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms
Paulo Vieira Milreu, Vicente Acuña, Etienne Birmelé, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie, Vincent Lacroix |
WABI | 1 |
| 2010 | Graph-Based Analysis of the Metabolic Exchanges between Two Co-Resident Intracellular Symbionts, Baumannia cicadellinicola and Sulcia muelleri, with Their Insect Host, Homalodisca coagulataabstractEndosymbiotic bacteria from different species can live inside cells of the same eukaryotic organism. Metabolic exchanges occur between host and bacteria but also between different endocytobionts. Since a complete genome annotation is available for both, we built the metabolic network of two endosymbiotic bacteria, Sulcia muelleri and Baumannia cicadellinicola, that live inside specific cells of the sharpshooter Homalodisca coagulata and studied the metabolic exchanges involving transfers of carbon atoms between the three. We automatically determined the set of metabolites potentially exogenously acquired (seeds) for both metabolic networks. We show that the number of seeds needed by both bacteria in the carbon metabolism is extremely reduced. Moreover, only three seeds are common to both metabolic networks, indicating that the complementarity of the two metabolisms is not only manifested in the metabolic capabilities of each bacterium, but also by their different use of the same environment. Furthermore, our results show that the carbon metabolism of S. muelleri may be completely independent of the metabolic network of B. cicadellinicola. On the contrary, the carbon metabolism of the latter appears dependent on the metabolism of S. muelleri, at least for two essential amino acids, threonine and lysine. Next, in order to define which subsets of seeds (precursor sets) are sufficient to produce the metabolites involved in a symbiotic function, we used a graph-based method, PITUFO, that we recently developed. Our results highly refine our knowledge about the complementarity between the metabolisms of the two bacteria and their host. We thus indicate seeds that appear obligatory in the synthesis of metabolites are involved in the symbiotic function. Our results suggest both B. cicadellinicola and S. muelleri may be completely independent of the metabolites provided by the co-resident endocytobiont to produce the carbon backbone of the metabolites provided to the symbiotic system (., thr and lys are only exploited by B. cicadellinicola to produce its proteins). Ludovic Cottret, Paulo Vieira Milreu, Vicente Acuña, Alberto Marchetti-Spaccamela, Leen Stougie, Hubert Charles, Marie-France Sagot |
PLoS Comput. Biol. | 2 |
| 2008 | Enumerating Precursor Sets of Target Metabolites in a Metabolic Network
Ludovic Cottret, Paulo Vieira Milreu, Vicente Acuña, Alberto Marchetti-Spaccamela, Fábio Viduani Martinez, Marie-France Sagot, Leen Stougie |
WABI | 2 |