Related Experiment Video
Updated: Jun 3, 2025

Peptide-based Identification of Functional Motifs and their Binding Partners
Published on: June 30, 2013
QOMIC: quantum optimization for motif identification
Hoang M Ngo1, Tamim Khatib1, My T Thai1
1Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL 32611, United States.
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.
More Related Videos
Related Concept Videos
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally...
Tagging and Fusion Proteins

