ArticlePloS one2012
Information indices with high discriminative power for graphs.
Article in PloS one, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 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
14 citing papers in PubMed.
- Approach to Semantic Visual SLAM for Bionic Robots Based on Loop Closure Detection with Combinatorial Graph Entropy in Complex Dynamic Scenes.Biomimetics (Basel, Switzerland) · 2025Article
- Net-Net Auto Machine Learning (AutoML) Prediction of Complex Ecosystems.Scientific reports · 2018Article
- A protein network descriptor server and its use in studying protein, disease, metabolic and drug targeted networks.Briefings in bioinformatics · 2017Article
- Mutual information model for link prediction in heterogeneous complex networks.Scientific reports · 2017Article
- Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices.PloS one · 2015Article
- Trends in information theory-based chemical structure codification.Molecular diversity · 2014Review
- The gene regulatory network for breast cancer: integrated regulatory landscape of cancer hallmarks.Frontiers in genetics · 2014Article
- Article
- The uniqueness of DMAX-matrix graph invariants.PloS one · 2014Article
- [COMMODE] a large-scale database of molecular descriptors using compounds from PubChem.Source code for biology and medicine · 2013Article
- The discrimination power of structural SuperIndices.PloS one · 2013Article
- Article
- Article
- Structural discrimination of networks by using distance, degree and eigenvalue-based measures.PloS one · 2012Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
In this paper, we evaluate the uniqueness of several information-theoretic measures for graphs based on so-called information functionals and compare the results with other information indices and non-information-theoretic measures such as the well-known Balaban J index. We show that, by employing an information functional based on degree-degree associations, the resulting information index outperforms the Balaban J index tremendously. These results have been obtained by using nearly 12 million exhaustively generated, non-isomorphic and unweighted graphs. Also, we obtain deeper insights on these and other topological descriptors when exploring their uniqueness by using exhaustively generated sets of alkane trees representing connected and acyclic graphs in which the degree of a vertex is at most four.
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.