ArticleBioinformatics (Oxford, England)2015
Proper evaluation of alignment-free network comparison methods.
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.
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
24 citing papers in PubMed.
- Complex dynamics in psychological data: Mapping individual symptom trajectories to group-level patterns.Behavior research methods · 2026Article
- An egonet based approach to effective weighted network comparison.Scientific reports · 2025Article
- Directed Network Comparison Using Motifs.Entropy (Basel, Switzerland) · 2024Article
- Current and future directions in network biology.Bioinformatics advances · 2024Article
- Metrics for network comparison using egonet feature distributions.Scientific reports · 2023Article
- Integrated Data Analysis Uncovers New COVID-19 Related Genes and Potential Drug Re-Purposing Candidates.International journal of molecular sciences · 2023Article
- Graph embedding and geometric deep learning relevance to network biology and structural chemistry.Frontiers in artificial intelligence · 2023Review
- Article
- Chromatin network markers of leukemia.Bioinformatics (Oxford, England) · 2020Article
- Topological structure analysis of chromatin interaction networks.BMC bioinformatics · 2019Article
- Comparing methods for comparing networks.Scientific reports · 2019Article
- 'NetShift': a methodology for understanding 'driver microbes' from healthy and disease microbiome datasets.The ISME journal · 2019Article
- From homogeneous to heterogeneous network alignment via colored graphlets.Scientific reports · 2018Article
- SSAW: A new sequence similarity analysis method based on the stationary discrete wavelet transform.BMC bioinformatics · 2018Article
- graphkernels: R and Python packages for graph comparison.Bioinformatics (Oxford, England) · 2018Article
- GRAFENE: Graphlet-based alignment-free network approach integrates 3D structural and sequence (residue order) data to improve protein structural comparison.Scientific reports · 2017Article
- Logic programming reveals alteration of key transcription factors in multiple myeloma.Scientific reports · 2017Article
- Alignment of dynamic networks.Bioinformatics (Oxford, England) · 2017Article
- Conservation of Species- and Trait-Based Modeling Network Interactions in Extremely Acidic Microbial Community Assembly.Frontiers in microbiology · 2017Article
- Article
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
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
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.