Evidence map›Paper›PMID 37387165›Full record

ArticleBioinformatics (Oxford, England)2023

Trap spaces of multi-valued networks: definition, computation, and applications.

Van-Giang Trinh, Belaid Benhamou, Thomas Henzinger, Samuel Pastva

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. BioLogical: a universal analysis framework for biosystem logical dynamics.Computational and structural biotechnology journal · 2026
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Van-Giang TrinhLIS, Aix-Marseille University, Marseille 13397, France.ORCID 0000-0001-6581-998X
Belaid BenhamouLIS, Aix-Marseille University, Marseille 13397, France.
Thomas HenzingerInstitute of Science and Technology, Klosterneuburg 3400, Austria.
Samuel PastvaInstitute of Science and Technology, Klosterneuburg 3400, Austria.ORCID 0000-0003-1993-0331

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationBoolean networks are simple but efficient mathematical formalism for modelling complex biological systems. However, having only two levels of activation is sometimes not enough to fully capture the dynamics of real-world biological systems. Hence, the need for multi-valued networks (MVNs), a generalization of Boolean networks. Despite the importance of MVNs for modelling biological systems, only limited progress has been made on developing theories, analysis methods, and tools that can support them. In particular, the recent use of trap spaces in Boolean networks made a great impact on the field of systems biology, but there has been no similar concept defined and studied for MVNs to date.

resultsIn this work, we generalize the concept of trap spaces in Boolean networks to that in MVNs. We then develop the theory and the analysis methods for trap spaces in MVNs. In particular, we implement all proposed methods in a Python package called trapmvn. Not only showing the applicability of our approach via a realistic case study, we also evaluate the time efficiency of the method on a large collection of real-world models. The experimental results confirm the time efficiency, which we believe enables more accurate analysis on larger and more complex multi-valued models. AVAILABILITY AND IMPLEMENTATION: Source code and data are freely available at https://github.com/giang-trinh/trap-mvn.

Indexed as

SoftwareSystems Biology

Identifiers

PMID37387165
PMCPMC10311308

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.