Evidence map›Paper›PMID 25810431›Full record

ArticleBioinformatics (Oxford, England)2015

Proper evaluation of alignment-free network comparison methods.

Ömer Nebil Yaveroğlu, Tijana Milenković, Nataša Pržulj

Abstract readComparative Study
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
24citing 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

24 citing papers in PubMed.

  1. Article
  2. Article
  3. Directed Network Comparison Using Motifs.Entropy (Basel, Switzerland) · 2024
    Article
  4. Article
  5. Article
  6. Article
  7. Review
  8. Article
  9. Chromatin network markers of leukemia.Bioinformatics (Oxford, England) · 2020
    Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. graphkernels: R and Python packages for graph comparison.Bioinformatics (Oxford, England) · 2018
    Article
  16. Article
  17. Article
  18. Alignment of dynamic networks.Bioinformatics (Oxford, England) · 2017
    Article
  19. Article
  20. PeerJ · 2017
    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

3 authors.

Ömer Nebil YaveroğluCalifornia Institute for Telecommunications and Information Technology (Calit2), University of California, Irvine, CA 92697, USA.
Tijana MilenkovićDepartment of Computer Science and Engineering, University of Notre Dame, IN 46556, USA and.
Nataša PržuljDepartment of Computing, Imperial College London, London SW7 2AZ, UK.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationNetwork comparison is a computationally intractable problem with important applications in systems biology and other domains. A key challenge is to properly quantify similarity between wiring patterns of two networks in an alignment-free fashion. Also, alignment-based methods exist that aim to identify an actual node mapping between networks and as such serve a different purpose. Various alignment-free methods that use different global network properties (e.g. degree distribution) have been proposed. Methods based on small local subgraphs called graphlets perform the best in the alignment-free network comparison task, due to high level of topological detail that graphlets can capture. Among different graphlet-based methods, Graphlet Correlation Distance (GCD) was shown to be the most accurate for comparing networks. Recently, a new graphlet-based method called NetDis was proposed, which was claimed to be superior. We argue against this, as the performance of NetDis was not properly evaluated to position it correctly among the other alignment-free methods.

resultsWe evaluate the performance of available alignment-free network comparison methods, including GCD and NetDis. We do this by measuring accuracy of each method (in a systematic precision-recall framework) in terms of how well the method can group (cluster) topologically similar networks. By testing this on both synthetic and real-world networks from different domains, we show that GCD remains the most accurate, noise-tolerant and computationally efficient alignment-free method. That is, we show that NetDis does not outperform the other methods, as originally claimed, while it is also computationally more expensive. Furthermore, since NetDis is dependent on the choice of a network null model (unlike the other graphlet-based methods), we show that its performance is highly sensitive to the choice of this parameter. Finally, we find that its performance is not independent on network sizes and densities, as originally claimed. CONTACT: natasha@imperial.ac.uk SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

Gene Regulatory NetworksAlgorithmsCluster AnalysisHumansPhylogenyProtein Interaction MappingReference StandardsSequence Alignment

Identifiers

PMID25810431
PMCPMC4528624

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.