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

Optimization Problems01:26

Optimization Problems

79
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
79
Design Example: Alignment of a Road Line Using GIS01:17

Design Example: Alignment of a Road Line Using GIS

351
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...
351
Optimal Foraging00:48

Optimal Foraging

13.9K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
13.9K
Fast Fourier Transform01:10

Fast Fourier Transform

960
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...
960
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

765
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
765
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

8.2K
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.2K

You might also read

Related Articles

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

Sort by
Same author

Conserved fragments of transposable elements in intergenic regions: evidence for widespread recruitment of MIR- and L2-derived sequences within the mouse and human genomes.

Genetical research·2003
Same author

The efficient computation of position-specific match scores with the fast fourier transform.

Journal of computational biology : a journal of computational molecular cell biology·2002
Same author

Improving the accuracy of PSI-BLAST protein database searches with composition-based statistics and other refinements.

Nucleic acids research·2001
Same author

Lineage-specific gene expansions in bacterial and archaeal genomes.

Genome research·2001
Same author

Candidate regulatory sequence elements for cell cycle-dependent transcription in Saccharomyces cerevisiae.

Genome research·1999
Same author

A practical method for simultaneously determining the effective burst sizes and cycle times of viruses.

Proceedings of the National Academy of Sciences of the United States of America·1999
Same journal

DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.

Computer applications in the biosciences : CABIOS·1998
Same journal

Two applications to facilitate the viewing of database search result files on the Macintosh.

Computer applications in the biosciences : CABIOS·1998
Same journal

BioWish: a molecular biology command extension to Tcl/Tk.

Computer applications in the biosciences : CABIOS·1998
Same journal

The Sequence Alerting Server--a new WEB server.

Computer applications in the biosciences : CABIOS·1998
Same journal

A software tool for the analysis of mass spectrometric disulfide mapping experiments.

Computer applications in the biosciences : CABIOS·1998
Same journal

SAMBA: hardware accelerator for biological sequence comparison.

Computer applications in the biosciences : CABIOS·1998
See all related articles

Related Experiment Video

Updated: Feb 10, 2026

Early Detection of Cyanobacterial Blooms and Associated Cyanotoxins using Fast Detection Strategy
07:13

Early Detection of Cyanobacterial Blooms and Associated Cyanotoxins using Fast Detection Strategy

Published on: February 25, 2021

4.5K

Fast optimal alignment.

J L Spouge1

  • 1National Center for Biotechnology Information, National Library of Medicine, Bethesda, MD 20894.

Computer Applications in the Biosciences : CABIOS
|January 1, 1991
PubMed
Summary
This summary is machine-generated.

New sequence alignment algorithms leverage inequalities to speed computation by focusing on promising subalignments. These novel methods, particularly for indel costs and end-gaps, demonstrate significant speed improvements over existing techniques.

More Related Videos

Using an Automated Hirschberg Test App to Evaluate Ocular Alignment
05:40

Using an Automated Hirschberg Test App to Evaluate Ocular Alignment

Published on: March 24, 2020

15.9K
Assembly, Loading, and Alignment of an Analytical Ultracentrifuge Sample Cell
11:36

Assembly, Loading, and Alignment of an Analytical Ultracentrifuge Sample Cell

Published on: November 5, 2009

23.2K

Related Experiment Videos

Last Updated: Feb 10, 2026

Early Detection of Cyanobacterial Blooms and Associated Cyanotoxins using Fast Detection Strategy
07:13

Early Detection of Cyanobacterial Blooms and Associated Cyanotoxins using Fast Detection Strategy

Published on: February 25, 2021

4.5K
Using an Automated Hirschberg Test App to Evaluate Ocular Alignment
05:40

Using an Automated Hirschberg Test App to Evaluate Ocular Alignment

Published on: March 24, 2020

15.9K
Assembly, Loading, and Alignment of an Analytical Ultracentrifuge Sample Cell
11:36

Assembly, Loading, and Alignment of an Analytical Ultracentrifuge Sample Cell

Published on: November 5, 2009

23.2K

Area of Science:

  • Computational biology
  • Bioinformatics algorithms

Background:

  • Sequence alignment is fundamental in bioinformatics, often achieved by minimizing computational cost.
  • Existing efficient algorithms, like Fickett's and Ukkonen's, accelerate alignment by pruning suboptimal subalignments.
  • The efficiency of these algorithms is rooted in the principle of using inequalities to guide computations.

Purpose of the Study:

  • To introduce and evaluate novel sequence alignment algorithms.
  • To explore the application of inequalities in directing alignment computations.
  • To present algorithms optimized for single indel costs and weighted end-gaps.

Main Methods:

  • Development of new sequence alignment algorithms based on inequality principles.
  • Analysis of inequalities for various gap cost models, including unweighted end-gaps and affine/concave gap weights.
  • Empirical evaluation of the performance of the new algorithms against established methods.

Main Results:

  • The proposed algorithms effectively utilize inequalities to identify and pursue promising subalignments.
  • Empirical results indicate that the new algorithms offer substantial speedups compared to existing algorithms under specific conditions.
  • Performance gains are particularly notable for sequence alignments involving single indel costs and weighted end-gaps.

Conclusions:

  • Inequalities provide a powerful framework for designing efficient sequence alignment algorithms.
  • The newly developed algorithms present a faster alternative for specific sequence alignment tasks.
  • Further research can explore broader applications of inequality-guided computations in bioinformatics.