Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Fast quantum search algorithms in protein sequence comparisons: quantum bioinformatics.

L C Hollenberg1

  • 1Max-Planck-Institut für Kernphysik, Saupfercheckweg 1, Heidelberg D-69117, Germany.

Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
|December 2, 2000
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same journal

Efficient Monte Carlo simulations using a shuffled nested Weyl sequence random number generator.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2002
Same journal

Spatiotemporal dynamics of electromagnetic pulses in saturating nonlinear optical media with normal group velocity dispersion.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2002
Same journal

Soliton-breather reaction pathways.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2002
Same journal

Calculation of electromagnetic properties of regular and random arrays of metallic and dielectric cylinders.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2002
Same journal

Electromagnetic convective cells in a nonuniform dusty plasma.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2002
Same journal

Stability of neural networks and solitons of field theory.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2002
See all related articles

Quantum search algorithms offer significant speedups for protein sequence comparison. This study demonstrates a quantum approach achieving O(√N) efficiency for finding optimal protein sequence alignments in large databases.

Area of Science:

  • Bioinformatics
  • Quantum Computing
  • Computational Biology

Background:

  • Protein sequence comparison is crucial in bioinformatics for understanding protein function and evolution.
  • Classical algorithms for sequence matching in large databases can be computationally intensive, often requiring O(N) time complexity.
  • Quantum search algorithms, like Grover's, offer potential for significant speedups in search-related problems.

Purpose of the Study:

  • To explore the application of quantum search algorithms for efficient protein sequence comparison.
  • To develop and demonstrate a quantum algorithm for finding optimal protein sequence alignments in large databases.
  • To achieve a quantum speedup over classical methods for this bioinformatics task.

Main Methods:

  • Application of Grover's quantum search algorithm to an idealized case of protein sequence matching.

Related Experiment Videos

  • Development of an extended quantum algorithm, based on Boyer et al.'s work, for realistic scenarios with repeat sequences and unknown match counts.
  • Minimization of Hamming distance for optimal sequence alignment using quantum search principles.

    • Main Results:

    • Demonstrated a theoretical O(√N) speedup for exact sequence matching compared to classical O(N) methods.
    • Presented a quantum algorithm capable of finding optimal alignments by minimizing Hamming distance.
    • The extended algorithm achieves O(√N) efficiency even when exact matches are not guaranteed or the number of matches is unknown.

    Conclusions:

    • Quantum search algorithms, particularly extensions of Grover's algorithm, provide a powerful framework for accelerating protein sequence comparison.
    • The proposed quantum approach offers a significant computational advantage for identifying optimal protein sequence alignments in large-scale bioinformatics databases.
    • This research highlights the potential of quantum computing to revolutionize complex problems in computational biology.