Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tanguy Riou

dblp:246/1868 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 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
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Mathematical optimization · 50% Combinatorics and discrete mathematics · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › systems biology
metabolic network analysis
0.412019
Computing irreversible minimal cut sets in genome-scale metabolic networks via flux cone projection · Bioinform. 2019
Bioinformatics and computational biology › systems biology › metabolic network analysis
minimal cut sets
0.412019
Computing irreversible minimal cut sets in genome-scale metabolic networks via flux cone projection · Bioinform. 2019
Mathematical optimization
combinatorial optimization
0.112019
Computing irreversible minimal cut sets in genome-scale metabolic networks via flux cone projection · Bioinform. 2019
Combinatorics and discrete mathematics › matroid theory
oriented matroids
0.112019
Computing irreversible minimal cut sets in genome-scale metabolic networks via flux cone projection · Bioinform. 2019

Methods — techniques the papers use, named apart from their topics

oriented matroid theory · 0.8flux cone projection · 0.8
YearPublicationVenuePosition
2019 Computing irreversible minimal cut sets in genome-scale metabolic networks via flux cone projection
abstract
MOTIVATION: Minimal cut sets (MCSs) for metabolic networks are sets of reactions which, if they are removed from the network, prevent a target reaction from carrying flux. To compute MCSs different methods exist, which may fail to find sufficiently many MCSs for larger genome-scale networks. RESULTS: Here we introduce irreversible minimal cut sets (iMCSs). These are MCSs that consist of irreversible reactions only. The advantage of iMCSs is that they can be computed by projecting the flux cone of the metabolic network on the set of irreversible reactions, which usually leads to a smaller cone. Using oriented matroid theory, we show how the projected cone can be computed efficiently and how this can be applied to find iMCSs even in large genome-scale networks. AVAILABILITY AND IMPLEMENTATION: Software is freely available at https://sourceforge.net/projects/irreversibleminimalcutsets/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Annika Röhl, Tanguy Riou, Alexander Bockmayr
Bioinform.2