Evidence map›Paper›PMID 40175439›Full record

ArticleScientific reports2025

A new Similarity Based Adapted Louvain Algorithm (SIMBA) for active module identification in p-value attributed biological networks.

Nina Singlan, Fadi Abou Choucha, Claude Pasquier

Abstract read
In one paragraph

Article in Scientific reports, 2025. 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. 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.

Nina SinglanUniversité Côte d'Azur, CNRS, i3S, 06560, Valbonne, France. nsinglan@i3s.unice.fr.ORCID http://orcid.org/0000-0002-8616-2160
Fadi Abou ChouchaUniversité Côte d'Azur, CNRS, i3S, 06560, Valbonne, France.ORCID http://orcid.org/0000-0003-1319-4759
Claude PasquierUniversité Côte d'Azur, CNRS, i3S, 06560, Valbonne, France.ORCID http://orcid.org/0000-0001-7498-395X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Real-world networks, such as biological networks, often exhibit complex structures and have attributes associated with nodes, which leads to significant challenges for analysis and modeling. Community detection algorithms can help identify groups of nodes of particular importance. However, traditional methods focus primarily on topological information, overlooking the importance of attribute-based similarities. This limitation hinders their ability to identify functionally coherent subnetworks. To address this, we propose a new scoring method for graph partitioning on the basis of a novel similarity function between node attributes. We then adapt the Louvain algorithm to optimize this scoring function, enabling the identification of communities that are both densely connected and functionally coherent. Extensive experiments on diverse biological networks, including artificial and real-world datasets, demonstrate the superiority of our approach over state-of-the-art methods. By leveraging both topological and attribute-based information, our approach provides a powerful tool for uncovering biologically meaningful modules and gaining deeper insights into complex biological processes.

Indexed as

AlgorithmsComputational BiologyGene Regulatory NetworksHumansActive module identificationCommunity detectionSimilarity-based clustering

Identifiers

PMID40175439
PMCPMC11965526

What OpenQuestion holds

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