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 Concept Videos

Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
Multi-species Conserved Sequences02:51

Multi-species Conserved Sequences

Next-generation sequencing technologies have created large genomic databases of a variety of animals and plants. Ever since the human genome project was completed, scientists studied the genome of primates, mammals, and other phylogenetically distant living beings. Such large-scale  studies have provided new insights into the evolutionary relationship between organisms.
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
From DNA to Protein03:06

From DNA to Protein

The flow of genetic information in cells from DNA to mRNA to protein is described by the central dogma, which states that genes specify the sequence of mRNAs, which in turn specify the sequence of amino acids making up all proteins. The decoding of one molecule to another is performed by specific proteins and RNAs. Because the information stored in DNA is so central to cellular function, it makes intuitive sense that the cell would make mRNA copies of this information for protein synthesis...
Genome Annotation and Assembly03:36

Genome Annotation and Assembly

The genome refers to all of the genetic material in an organism. It can range from a few million base pairs in microbial cells to several billion base pairs in many eukaryotic organisms. Genome assembly refers to the process of taking the DNA sequencing data and putting it all back together in a correct order to create a close representation of the original genome. This is followed by the identification of functional elements on the newly assembled genome, a process called genome annotation.
Leaky Scanning02:28

Leaky Scanning

During most eukaryotic translation processes, the small 40S ribosome subunit scans an mRNA from its 5' end until it encounters the first start AUG codon. The large 60S ribosomal subunit then joins the smaller one to initiate protein synthesis. The location of the translation initiation is largely determined by the nucleotides near the start codon as there may be multiple translation initiation sites present on the mRNA.  Marilyn Kozak discovered that the sequence RCCAUGG (where R stands for...

You might also read

Related Articles

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

Sort by
Same author

Panaln: indexing pangenome for read alignment.

Bioinformatics (Oxford, England)·2025
Same author

An efficient Burrows-Wheeler transform-based aligner for short read mapping.

Computational biology and chemistry·2024
Same author

CIndex: compressed indexes for fast retrieval of FASTQ files.

Bioinformatics (Oxford, England)·2021
Same author

Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections.

IEEE/ACM transactions on computational biology and bioinformatics·2020
Same author

A new algorithm for DNA motif discovery using multiple sample sequence sets.

Journal of bioinformatics and computational biology·2019
Same author

SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets.

BMC bioinformatics·2018
Same journal

Novel Gene Discovery in the Human Malaria Parasite using Nucleosome Positioning Data.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2014
Same journal

Proceedings of Computational Systems Bioinformatics 2008. August 26-29, 2008. Palo Alto, California, USA.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Graph wavelet alignment kernels for drug virtual screening.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Fast multisegment alignments for temporal expression profiles.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Knowledge representation and data mining for biological imaging.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Efficient haplotype inference from pedigrees with missing data using linear systems with disjoint-set data structures.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
See all related articles

Related Experiment Video

Updated: Jun 21, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

A probabilistic coding based quantum genetic algorithm for multiple sequence alignment.

Hongwei Huo1, Qiaoluan Xie, Xubang Shen

  • 1School of Computer Science and Technology, Xidian University, Xi'an, Shaanxi 710071, P.R. China. hwhuo@mail.xidian.edu.cn

Computational Systems Bioinformatics. Computational Systems Bioinformatics Conference
|August 1, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a Quantum Genetic algorithm for Multiple Sequence Alignment (QGMALIGN), enhancing computational efficiency. This novel approach effectively aligns biological sequences and reduces running time.

More Related Videos

An Integrated Approach for Microprotein Identification and Sequence Analysis
09:37

An Integrated Approach for Microprotein Identification and Sequence Analysis

Published on: July 12, 2022

Related Experiment Videos

Last Updated: Jun 21, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

An Integrated Approach for Microprotein Identification and Sequence Analysis
09:37

An Integrated Approach for Microprotein Identification and Sequence Analysis

Published on: July 12, 2022

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Quantum Computing

Background:

  • Multiple sequence alignment (MSA) is crucial for understanding protein evolution and function.
  • Existing MSA algorithms face challenges with scalability and accuracy for large datasets.
  • Integrating quantum computing principles offers potential for improved MSA efficiency.

Purpose of the Study:

  • To develop a novel Quantum Genetic Algorithm for Multiple Sequence Alignment (QGMALIGN).
  • To enhance computational efficiency and accuracy in biological sequence alignment.
  • To leverage quantum mechanics features for improved optimization.

Main Methods:

  • A hybrid approach combining a genetic algorithm with quantum computation principles.
  • Development of a quantum probabilistic coding for representing multiple sequence alignments.
  • Implementation of a quantum rotation gate as a mutation operator.
  • Design of six genetic operators to refine solutions during evolution.

Main Results:

  • QGMALIGN demonstrates effective performance on benchmark datasets (BAliBASE2.0).
  • Comparative analysis shows QGMALIGN performs competitively against established methods like CLUSTALX and SAGA.
  • The integration of genetic operators with the quantum algorithm reduced overall computation time.

Conclusions:

  • QGMALIGN offers an efficient and accurate method for multiple sequence alignment.
  • The hybrid quantum-genetic approach successfully exploits parallelism and superposition for optimization.
  • Further development of quantum-inspired algorithms holds promise for advancing bioinformatics.