ArticleScientific reports2022
Domination based classification algorithms for the controllability analysis of biological interaction networks.
Article in Scientific reports, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.
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.
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.
Who cites it
3 citing papers in PubMed, 5 citations in OpenAlex.
- A graph theoretical approach to experimental prioritization in genome-scale investigations.Mammalian genome : official journal of the International Mammalian Genome Society · 2024Article
- Module control of network analysis in psychopathology.iScience · 2024Article
- Seminar: Scalable Preprocessing Tools for Exposomic Data Analysis.Environmental health perspectives · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors at 2 institutions in 2 countries.
Funding
Abstract
Deciding the size of a minimum dominating set is a classic NP-complete problem. It has found increasing utility as the basis for classifying vertices in networks derived from protein-protein, noncoding RNA, metabolic, and other biological interaction data. In this context it can be helpful, for example, to identify those vertices that must be present in any minimum solution. Current classification methods, however, can require solving as many instances as there are vertices, rendering them computationally prohibitive in many applications. In an effort to address this shortcoming, new classification algorithms are derived and tested for efficiency and effectiveness. Results of performance comparisons on real-world biological networks are reported.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.