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

A table-driven, full-sensitivity similarity search algorithm.

Gene Myers1, Richard Durbin

  • 1Department of Computer Science, University of California, Berkeley, Berkeley, CA 94720-1776, USA. gene@cs.berkeley.edu

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|June 14, 2003
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 author

A new phased assembly of the Antarctic spiny plunderfish provides novel insights into the evolution of the notothenioid radiation.

bioRxiv : the preprint server for biology·2026
Same author

Cryptic Diversity and Impacts of Domestication in the Black Soldier Fly (Hermetia illucens) Genome.

Genome biology and evolution·2026
Same author

A trio-binned, haplotype-resolved genome sequence of the zebrafish, <i>Danio rerio</i> Hamilton 1822, SAT strain.

Wellcome open research·2026
Same author

Pangenome-guided sequence assembly via binary optimization.

Briefings in bioinformatics·2026
Same author

The Genomics of Convergent Adaptation to Intertidal Gravel Beaches in Mediterranean Clingfishes.

Genome biology and evolution·2026
Same author

The Earth BioGenome Project Phase II: illuminating the eukaryotic tree of life.

Frontiers in science·2026
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

This study presents a novel query preprocessing method to accelerate local sequence alignment searches. The approach significantly speeds up database searches using dynamic programming, offering the fastest implementation to date.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Algorithm Analysis

Background:

  • Local sequence alignment is crucial for biological data analysis.
  • Existing dynamic programming algorithms, like Smith-Waterman, are computationally intensive.
  • Affine gap costs and scoring schemes (e.g., PAM120, BLOSUM62) present computational challenges.

Purpose of the Study:

  • To improve the efficiency of local alignment searches in large databases.
  • To overcome the computational bottlenecks associated with dynamic programming in sequence alignment.
  • To develop a faster software implementation for local alignment.

Main Methods:

  • Developed a query preprocessing step involving building specialized tables.
  • Utilized these tables to prune the dynamic programming matrix.

Related Experiment Videos

  • Enabled multi-step computations via single table lookups.

    • Main Results:

    • Significantly reduced the portion of the dynamic programming matrix requiring computation.
    • Achieved a complexity dependent on sparse matrix features.
    • Resulted in the fastest software implementation for local alignment searches to date.

    Conclusions:

    • The query preprocessing method offers a practical speedup for local alignment.
    • This approach enhances the efficiency of sequence similarity searches.
    • The developed algorithm provides a new benchmark for computational speed in bioinformatics.