Evidence map›Paper›PMID 39801778›Full record

ArticleBioinformatics advances2025

QOMIC: quantum optimization for motif identification.

Hoang M Ngo, Tamim Khatib, My T Thai, Tamer Kahveci

Abstract read
In one paragraph

Article in Bioinformatics advances, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed, 1 pooled it
–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

3 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. 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

4 authors.

Hoang M NgoDepartment of Computer and Information Science and Engineering, University of Florida, Gainesville, FL 32611, United States.ORCID https://orcid.org/0009-0000-9647-7011
Tamim KhatibDepartment of Computer and Information Science and Engineering, University of Florida, Gainesville, FL 32611, United States.
My T ThaiDepartment of Computer and Information Science and Engineering, University of Florida, Gainesville, FL 32611, United States.
Tamer KahveciDepartment of Computer and Information Science and Engineering, University of Florida, Gainesville, FL 32611, United States.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Motivation: Network motif identification (MI) problem aims to find topological patterns in biological networks. Identifying disjoint motifs is a computationally challenging problem using classical computers. Quantum computers enable solving high complexity problems which do not scale using classical computers. In this article, we develop the first quantum solution, called QOMIC (Quantum Optimization for Motif IdentifiCation), to the MI problem. QOMIC transforms the MI problem using a integer model, which serves as the foundation to develop our quantum solution. We develop and implement the quantum circuit to find motif locations in the given network using this model. Results: Our experiments demonstrate that QOMIC outperforms the existing solutions developed for the classical computer, in term of motif counts. We also observe that QOMIC can efficiently find motifs in human regulatory networks associated with five neurodegenerative diseases: Alzheimer's, Parkinson's, Huntington's, Amyotrophic Lateral Sclerosis, and Motor Neurone Disease. Availability and implementation: Our implementation can be found in https://github.com/ngominhhoang/Quantum-Motif-Identification.git.

Identifiers

PMID39801778
PMCPMC11725347

What OpenQuestion holds

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