Evidence map›Paper›PMID 41290858›Full record

ArticleScientific reports2025

Network motif detection using hidden markov models.

Costas Bampos, Vasileios Megalooikonomou

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. Review
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

2 authors.

Costas BamposComputer Engineering and Informatics Department, School of Engineering, University of Patras, Patras, Greece. costas.bampos@gmail.com.
Vasileios MegalooikonomouComputer Engineering and Informatics Department, School of Engineering, University of Patras, Patras, Greece.

Funding

European Union's Horizon Europe research and innovation programme 101072537"Flagship actions in interdisciplinary scientific areas with special interest for the connection with the productive fabric", Greece 2.0 - National Recovery and Resilience Plan. TAEDR-0539180
6 · The paper itself

Abstract

Graphical representations model complex networks by encoding entities as vertices and interactions as edges, with recurring subgraphs-or motifs-revealing fundamental organizational principles. We present a novel application of Hidden Markov Models (HMMs) to network motif detection: subgraphs are encoded as short symbolic sequences and scored with standard HMM kernels (Viterbi/Forward; optional Baum-Welch), producing graded likelihoods that tolerate missing or noisy edges. On a 253-node directed benchmark the HMM pipeline recovers known 4-node motifs with accuracy comparable to exact enumeration while providing a probabilistic, weight-aware scoring framework that enables principled model comparison. We also include a concise complexity comparison with ESU, FANMOD and G-Tries and discuss engineering choices (seed-and-filter, scoring-only workflows) that make the approach practical. To our knowledge, this is the first application of HMMs to network motif detection.

Indexed as

Baum–WelchHidden markov modelsMotif detectionViterbi

Identifiers

PMID41290858
PMCPMC12647810

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.