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

Design Example: Alignment of a Road Line Using GIS01:17

Design Example: Alignment of a Road Line Using GIS

340
The alignment of a road line using Geographic Information Systems (GIS) is a critical process in civil engineering, combining advanced technology with practical decision-making. This methodology begins with the collection of geospatial data, including information on land cover, geomorphology, drainage patterns, slope, and contour details. Such data is typically acquired through satellite imagery and GIS tools, offering a comprehensive understanding of the terrain.Once the data is gathered, it...
340
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

8.0K
The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.0K
Cis-regulatory Sequences02:02

Cis-regulatory Sequences

11.6K
Cis-regulatory sequences are short fragments of non-coding DNA that are present on the same chromosomes as the genes that they regulate. These fragments serve as binding sites for transcriptional regulators, proteins that are responsible for controlling gene transcription and differential gene expression across cell types in eukaryotes. Cis-regulatory sequences can be close to the gene of interest or thousands of bases away in the DNA sequence; however, those sequences that are further away are...
11.6K
Multiple Allele Traits01:49

Multiple Allele Traits

38.0K
The Concept of Multiple Allelism
38.0K
Fast Fourier Transform01:10

Fast Fourier Transform

931
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
931
Multiple Regression01:25

Multiple Regression

3.8K
Multiple regression assesses a linear relationship between one response or dependent variable and two or more independent variables. It has many practical applications.
Farmers can use multiple regression to determine the crop yield based on more than one factor, such as water availability, fertilizer, soil properties, etc. Here, the crop yield is the response or dependent variable as it depends on the other independent variables. The analysis requires the construction of a scatter plot...
3.8K

You might also read

Related Articles

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

Sort by
Same author

Correction: Benchmarking tools for the alignment of functional noncoding DNA.

BMC bioinformatics·2004
Same author

QAlign: quality-based multiple alignments with dynamic phylogenetic analysis.

Bioinformatics (Oxford, England)·2003
Same author

Common intervals and sorting by reversals: a marriage of necessity.

Bioinformatics (Oxford, England)·2002
Same author

Simple but fundamental limitations on supertree and consensus tree methods.

Systematic biology·2002
Same author

REPuter: the manifold applications of repeat analysis on a genomic scale.

Nucleic acids research·2001
Same author

An iterative method for faster sum-of-pairs multiple sequence alignment.

Bioinformatics (Oxford, England)·2000
Same journal

Constructing regulatory networks of Rubisco post-translational modifications: a novel avenue for engineering environment adaptive plants.

Gene·2026
Same journal

Traumatic brain injury enhances fracture healing by upregulating VNN1 to activate the Wnt/β-catenin signaling pathway.

Gene·2026
Same journal

Single-cell transcriptomics reveals CCL2-mediated macrophage-endothelial cell interactions drive apoptosis in varicose veins.

Gene·2026
Same journal

Development of a gene signature related to phospholipid metabolism for prognosis and therapeutic Prediction in Osteosarcoma: Focus on VAC14.

Gene·2026
Same journal

A pilot single-case longitudinal multi-omics of canine oral melanoma characterizes endogenous mutation patterns and radiotherapy-associated responses.

Gene·2026
Same journal

Genome-wide identification and analysis of GATA genes family in maize reveals involvement of ZmGATA17 in salt stress tolerance.

Gene·2026
See all related articles

Related Experiment Video

Updated: Jan 25, 2026

Fast Inspection of Quality of Indigo Naturalis by Multiple Light Scattering
03:40

Fast Inspection of Quality of Indigo Naturalis by Multiple Light Scattering

Published on: August 18, 2023

760

A general method for fast multiple sequence alignment

U Tönges1, S W Perrey, J Stoye

  • 1Research Center for Interdisciplinary Studies on Structure Formation (RCSF), University of Bielefeld, Germany. toenges,stoye,dress@mathematik.unibielefeld.de

Gene
|June 12, 1996
PubMed
Summary
This summary is machine-generated.

A new heuristic algorithm offers fast, near-optimal multiple sequence alignment for homologous sequences. This method uses dynamic programming and a divide-and-conquer approach to efficiently align large sequence families.

More Related Videos

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation
16:02

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Published on: February 10, 2023

3.2K
Fast and Efficient Expression of Multiple Proteins in Avian Embryos Using mRNA Electroporation
09:40

Fast and Efficient Expression of Multiple Proteins in Avian Embryos Using mRNA Electroporation

Published on: June 7, 2019

7.6K

Related Experiment Videos

Last Updated: Jan 25, 2026

Fast Inspection of Quality of Indigo Naturalis by Multiple Light Scattering
03:40

Fast Inspection of Quality of Indigo Naturalis by Multiple Light Scattering

Published on: August 18, 2023

760
Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation
16:02

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Published on: February 10, 2023

3.2K
Fast and Efficient Expression of Multiple Proteins in Avian Embryos Using mRNA Electroporation
09:40

Fast and Efficient Expression of Multiple Proteins in Avian Embryos Using mRNA Electroporation

Published on: June 7, 2019

7.6K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Multiple sequence alignment (MSA) is crucial for understanding evolutionary relationships and functional similarities between biological sequences.
  • Existing MSA algorithms can be computationally intensive, especially for large datasets.

Purpose of the Study:

  • To develop a fast heuristic algorithm for multiple sequence alignment.
  • To achieve near-optimal alignment results for homologous sequences efficiently.

Main Methods:

  • The algorithm employs a standard dynamic programming procedure applied to all pairs of sequences.
  • It generates secondary matrices to identify optimal slicing points for a divide-and-conquer strategy.
  • The method recursively reduces the alignment problem into smaller subproblems.

Main Results:

  • The heuristic algorithm demonstrates efficiency and near-optimality for sufficiently homologous sequences.
  • The divide-and-conquer approach effectively reduces the complexity of aligning large sequence families.
  • The study details the method for 3 sequences and outlines its generalization for n sequences.

Conclusions:

  • The developed algorithm provides a computationally efficient and effective solution for multiple sequence alignment.
  • It offers a practical approach for analyzing large-scale genomic and proteomic data.
  • The method's performance and limitations are discussed with various test cases.