CoChat

Continuous-Time Quantum Walk on Biological Network

Open access
Revythi, Maria, Koukiou, Georgia, Anastassopoulos, Vassilis · 2025 · IEEE Access

The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.

Abstract

Disease gene prioritization is a computational strategy that assigns scores to genes or proteins to estimate their likelihood of being associated with a specific disease, helping reduce the cost and effort of experimental validation. Given the large number of candidate genes and limited laboratory resources, effective prioritization techniques are essential for focusing experimental efforts on the most promising targets. In this study, we introduce a novel disease gene prioritization method based on continuous-time quantum walks applied to a heterogeneous biological network comprising both gene and disease nodes. This heterogeneous formulation enables a more comprehensive representation of biological interactions compared to traditional homogeneous models. By propagating quantum amplitudes through the network, the proposed framework captures complex structural patterns and interaction dynamics that classical approaches may overlook. To assess its effectiveness, we perform two types of evaluation: (i) comparison of our predictions with established findings reported in the literature, and (ii) benchmarking against a widely used classical prioritization technique. Experimental results show that our quantum walk-based model consistently outperforms the classical baseline, achieving an area under the curve (AUC) of 0.912 versus 0.804. These results demonstrate the potential of quantum-inspired algorithms to enhance accuracy in disease gene discovery and highlight their value for advancing computational methods in omics research.We further validated the robustness of our approach by incorporating the Precision–Recall AUC, which confirmed the superior predictive performance of the quantum walk model across multiple seed genes.

Overview

Integrity signals

Registry

Crossref · 10.1109/access.2025.3644962

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 43 references

Research works printed but not linked: 1

  1. Csárdi, 2006, The IGRAPH software package for complex network research, Inter. J. Complex Syst., 2006, 1695

Cited by

See all 1

Metadata

Authors
Revythi, M., Koukiou, G., & Anastassopoulos, V.
Affiliations
  • University of Patras (GR)
  • Physics Department, Electronics Laboratory, University of Patras, Patras, Greece
Venue
IEEE Access
Published
2025
Volume
13
Pages
212856-212866
ISSN
2169-3536 (ISSN-L)
OpenAlex
W4417438798
Cited by
1
References
40
Citations by year
2026: 1
FWCI
0.30
Type
journal article
Language
en
Open access
Locations
IEEE Access (publishedVersion, cc-by)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
  • Life Sciences › Pharmacology, Toxicology and Pharmaceutics › Drug Discovery › Computational Drug Discovery Methods
  • Health Sciences › Medicine › Health Informatics › Biomedical Text Mining and Ontologies
Keywords
continuous-time quantum walks, disease gene prioritization, heterogeneous biological networks, gene-disease networks, quantum-inspired algorithms, disease gene discovery

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Continuous-Time Quantum Walk on Biological Network. https://app.cochat.ai/papers/10.1109/access.2025.3644962
The paper
Revythi, M., Koukiou, G., & Anastassopoulos, V. (2025). Continuous-Time Quantum Walk on Biological Network. IEEE Access. https://doi.org/10.1109/access.2025.3644962

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.