Demo Data from VLDB 2026 / reviewers in the wild / expert
Aurélien Naldi
dblp:30/3974
· DBLP profile ↗
9ranked-venue papers
5as first author
2since 2021 · last 2023
0000-0002-6495-2655ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 6 · 3 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author
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
3 papers |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
systems biology |
0.7 | 2 | 2020 | Automated inference of Boolean models from molecular interaction maps using CaSQ · Bioinform. 2020 Cooperative development of logical modelling standards and tools with CoLoMoTo · Bioinform. 2015 |
Bioinformatics and computational biology › biological network › network biology › network inference › gene regulatory network inference
boolean network inference |
0.4 | 1 | 2020 | Automated inference of Boolean models from molecular interaction maps using CaSQ · Bioinform. 2020 |
Bioinformatics and computational biology › systems biology › cellular signaling
signaling pathway modeling |
0.3 | 1 | 2017 | MaBoSS 2.0: an environment for stochastic Boolean modeling · Bioinform. 2017 |
Methods — techniques the papers use, named apart from their topics
logical formula construction · 0.4boolean rule inference · 0.4stochastic simulation · 0.3boolean modelling · 0.3logical modelling framework · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Linear cuts in Boolean networksabstractAbstract Boolean networks are popular tools for the exploration of qualitative dynamical properties of biological systems. Several dynamical interpretations have been proposed based on the same logical structure that captures the interactions between Boolean components. They reproduce, in different degrees, the behaviours emerging in more quantitative models. In particular, regulatory conflicts can prevent the standard asynchronous dynamics from reproducing some trajectories that might be expected upon inspection of more detailed models. We introduce and study the class of networks with linear cuts, where linear components—intermediates with a single regulator and a single target—eliminate the aforementioned regulatory conflicts. The interaction graph of a Boolean network admits a linear cut when a linear component occurs in each cycle and in each path from components with multiple targets to components with multiple regulators. Under this structural condition the attractors are in one-to-one correspondence with the minimal trap spaces, and the reachability of attractors can also be easily characterized. Linear cuts provide the base for a new interpretation of the Boolean semantics that captures all behaviours of multi-valued refinements with regulatory thresholds that are uniquely defined for each interaction, and contribute a new approach for the investigation of behaviour of logical models. Aurélien Naldi, Adrien Richard, Elisa Tonello |
Nat. Comput. | 1 |
| 2021 | Setting the basis of best practices and standards for curation and annotation of logical models in biology - highlights of the [BC]2 2019 CoLoMoTo/SysMod WorkshopabstractThe fast accumulation of biological data calls for their integration, analysis and exploitation through more systematic approaches. The generation of novel, relevant hypotheses from this enormous quantity of data remains challenging. Logical models have long been used to answer a variety of questions regarding the dynamical behaviours of regulatory networks. As the number of published logical models increases, there is a pressing need for systematic model annotation, referencing and curation in community-supported and standardised formats. This article summarises the key topics and future directions of a meeting entitled 'Annotation and curation of computational models in biology', organised as part of the 2019 [BC]2 conference. The purpose of the meeting was to develop and drive forward a plan towards the standardised annotation of logical models, review and connect various ongoing projects of experts from different communities involved in the modelling and annotation of molecular biological entities, interactions, pathways and models. This article defines a roadmap towards the annotation and curation of logical models, including milestones for best practices and minimum standard requirements. Anna Niarakis, Martin Kuiper, Marek Ostaszewski, Rahuman S. Malik-Sheriff, Cristina Casals-Casas, Denis Thieffry, Tom C. Freeman, Paul D. Thomas, Vasundra Touré, Vincent Noel, Gautier Stoll, Julio Saez-Rodriguez, Aurélien Naldi, Eugenia Oshurko, Ioannis Xenarios, Sylvain Soliman, Claudine Chaouiya, Tomás Helikar, Laurence Calzone |
Briefings Bioinform. | 13 |
| 2020 | Automated inference of Boolean models from molecular interaction maps using CaSQabstractMOTIVATION: Molecular interaction maps have emerged as a meaningful way of representing biological mechanisms in a comprehensive and systematic manner. However, their static nature provides limited insights to the emerging behaviour of the described biological system under different conditions. Computational modelling provides the means to study dynamic properties through in silico simulations and perturbations. We aim to bridge the gap between static and dynamic representations of biological systems with CaSQ, a software tool that infers Boolean rules based on the topology and semantics of molecular interaction maps built with CellDesigner. RESULTS: We developed CaSQ by defining conversion rules and logical formulas for inferred Boolean models according to the topology and the annotations of the starting molecular interaction maps. We used CaSQ to produce executable files of existing molecular maps that differ in size, complexity and the use of Systems Biology Graphical Notation (SBGN) standards. We also compared, where possible, the manually built logical models corresponding to a molecular map to the ones inferred by CaSQ. The tool is able to process large and complex maps built with CellDesigner (either following SBGN standards or not) and produce Boolean models in a standard output format, Systems Biology Marked Up Language-qualitative (SBML-qual), that can be further analyzed using popular modelling tools. References, annotations and layout of the CellDesigner molecular map are retained in the obtained model, facilitating interoperability and model reusability. AVAILABILITY AND IMPLEMENTATION: The present tool is available online: https://lifeware.inria.fr/∼soliman/post/casq/ and distributed as a Python package under the GNU GPLv3 license. The code can be accessed here: https://gitlab.inria.fr/soliman/casq. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Sara Sadat Aghamiri, Vidisha Singh, Aurélien Naldi, Tomás Helikar, Sylvain Soliman, Anna Niarakis, Jinbo Xu |
Bioinform. | 3 |
| 2017 | MaBoSS 2.0: an environment for stochastic Boolean modelingabstractMOTIVATION: Modeling of signaling pathways is an important step towards the understanding and the treatment of diseases such as cancers, HIV or auto-immune diseases. MaBoSS is a software that allows to simulate populations of cells and to model stochastically the intracellular mechanisms that are deregulated in diseases. MaBoSS provides an output of a Boolean model in the form of time-dependent probabilities, for all biological entities (genes, proteins, phenotypes, etc.) of the model. RESULTS: We present a new version of MaBoSS (2.0), including an updated version of the core software and an environment. With this environment, the needs for modeling signaling pathways are facilitated, including model construction, visualization, simulations of mutations, drug treatments and sensitivity analyses. It offers a framework for automated production of theoretical predictions. AVAILABILITY AND IMPLEMENTATION: MaBoSS software can be found at https://maboss.curie.fr , including tutorials on existing models and examples of models. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Gautier Stoll, Barthélémy Caron, Eric Viara, Aurélien Dugourd, Andrei Yu. Zinovyev, Aurélien Naldi, Guido Kroemer, Emmanuel Barillot, Laurence Calzone |
Bioinform. | 6 |
| 2017 | Reconstruction and signal propagation analysis of the Syk signaling network in breast cancer cellsabstractThe ability to build in-depth cell signaling networks from vast experimental data is a key objective of computational biology. The spleen tyrosine kinase (Syk) protein, a well-characterized key player in immune cell signaling, was surprisingly first shown by our group to exhibit an onco-suppressive function in mammary epithelial cells and corroborated by many other studies, but the molecular mechanisms of this function remain largely unsolved. Based on existing proteomic data, we report here the generation of an interaction-based network of signaling pathways controlled by Syk in breast cancer cells. Pathway enrichment of the Syk targets previously identified by quantitative phospho-proteomics indicated that Syk is engaged in cell adhesion, motility, growth and death. Using the components and interactions of these pathways, we bootstrapped the reconstruction of a comprehensive network covering Syk signaling in breast cancer cells. To generate in silico hypotheses on Syk signaling propagation, we developed a method allowing to rank paths between Syk and its targets. We first annotated the network according to experimental datasets. We then combined shortest path computation with random walk processes to estimate the importance of individual interactions and selected biologically relevant pathways in the network. Molecular and cell biology experiments allowed to distinguish candidate mechanisms that underlie the impact of Syk on the regulation of cortactin and ezrin, both involved in actin-mediated cell adhesion and motility. The Syk network was further completed with the results of our biological validation experiments. The resulting Syk signaling sub-networks can be explored via an online visualization platform. Aurélien Naldi, Romain M. Larive, Urszula Czerwinska, Serge Urbach, Philippe Montcourrier, Christian Roy, Jérôme Solassol, Gilles Freiss, Peter J. Coopman, Ovidiu Radulescu |
PLoS Comput. Biol. | 1 |
| 2015 | Cooperative development of logical modelling standards and tools with CoLoMoToabstractThe identification of large regulatory and signalling networks involved in the control of crucial cellular processes calls for proper modelling approaches. Indeed, models can help elucidate properties of these networks, understand their behaviour and provide (testable) predictions by performing in silico experiments. In this context, qualitative, logical frameworks have emerged as relevant approaches, as demonstrated by a growing number of published models, along with new methodologies and software tools. This productive activity now requires a concerted effort to ensure model reusability and interoperability between tools. Following an outline of the logical modelling framework, we present the most important achievements of the Consortium for Logical Models and Tools, along with future objectives. Our aim is to advertise this open community, which welcomes contributions from all researchers interested in logical modelling or in related mathematical and computational developments. Aurélien Naldi, Pedro T. Monteiro 0001, Christoph Müssel, Hans A. Kestler, Denis Thieffry, Ioannis Xenarios, Julio Saez-Rodriguez, Tomás Helikar, Claudine Chaouiya |
Bioinform. | 1 |
| 2011 | Petri net representation of multi-valued logical regulatory graphs
Claudine Chaouiya, Aurélien Naldi, Elisabeth Remy, Denis Thieffry |
Nat. Comput. | 2 |
| 2011 | Dynamically consistent reduction of logical regulatory graphs
Aurélien Naldi, Elisabeth Remy, Denis Thieffry, Claudine Chaouiya |
Theor. Comput. Sci. | 1 |
| 2010 | Diversity and Plasticity of Th Cell Types Predicted from Regulatory Network ModellingabstractAlternative cell differentiation pathways are believed to arise from the concerted action of signalling pathways and transcriptional regulatory networks. However, the prediction of mammalian cell differentiation from the knowledge of the presence of specific signals and transcriptional factors is still a daunting challenge. In this respect, the vertebrate hematopoietic system, with its many branching differentiation pathways and cell types, is a compelling case study. In this paper, we propose an integrated, comprehensive model of the regulatory network and signalling pathways controlling Th cell differentiation. As most available data are qualitative, we rely on a logical formalism to perform extensive dynamical analyses. To cope with the size and complexity of the resulting network, we use an original model reduction approach together with a stable state identification algorithm. To assess the effects of heterogeneous environments on Th cell differentiation, we have performed a systematic series of simulations considering various prototypic environments. Consequently, we have identified stable states corresponding to canonical Th1, Th2, Th17 and Treg subtypes, but these were found to coexist with other transient hybrid cell types that co-express combinations of Th1, Th2, Treg and Th17 markers in an environment-dependent fashion. In the process, our logical analysis highlights the nature of these cell types and their relationships with canonical Th subtypes. Finally, our logical model can be used to explore novel differentiation pathways in silico. Aurélien Naldi, Jorge Carneiro, Claudine Chaouiya, Denis Thieffry |
PLoS Comput. Biol. | 1 |