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

Speeding up whole-genome alignment by indexing frequency vectors.

Tamer Kahveci1, Vebjorn Ljosa, Ambuj K Singh

  • 1Department of Computer Science, University of California, Santa Barbara, Santa Barbara, CA 93106-5110, USA. tamer@cs.ucsb.edu

Bioinformatics (Oxford, England)
|April 10, 2004
PubMed
Summary

This study introduces an efficient method for comparing large genome strings, significantly reducing computational costs. The new technique accelerates local alignment tasks, outperforming existing tools like BLAST.

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

MOSAIC: MOtif Set with mAximal InfluenCe on network.

IEEE transactions on computational biology and bioinformatics·2026
Same author

STORM: spatial transcriptomics optimization by resolution via matrix factorization.

Briefings in bioinformatics·2026
Same author

SPACT: A clustering-driven multi-modal framework for survival prediction using genomic and histopathology data.

Medical image analysis·2026
Same author

Differential causal networks highlight sex-based differences in human tissues.

Briefings in bioinformatics·2025
Same author

OLTA: Optimizing bait seLection for TArgeted sequencing.

Bioinformatics (Oxford, England)·2025
Same author

QOMIC: quantum optimization for motif identification.

Bioinformatics advances·2025

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Biological applications frequently necessitate the comparison of extensive genome strings.
  • Existing comparison methodologies incur substantial computational and input/output (I/O) expenses.

Purpose of the Study:

  • To develop an efficient technique for the local alignment of large genome strings.
  • To address the high computational and I/O costs associated with current genome comparison methods.

Main Methods:

  • A space-efficient index is constructed for one genome string.
  • The second genome string is compared against this index to efficiently prune dissimilar substring pairs.
  • Remaining candidate pairs are processed by a hash-table-based tool (e.g., BLAST) for detailed alignment.

Related Experiment Videos

  • A dynamic strategy optimizes disk seek operations for hash table access.
  • Coarse-grained similarity pattern visualization is provided prior to the main search.

    • Main Results:

    • The proposed technique achieves local alignment of genome strings up to two orders of magnitude faster than BLAST.
    • The method effectively prunes dissimilar substrings, reducing the search space for alignment tools.
    • The technique offers rapid, coarse-grained visualization of similarity patterns.

    Conclusions:

    • The developed technique offers a significant speedup for local alignment of large genome strings.
    • This approach can accelerate various search tools in bioinformatics.
    • The method provides a valuable tool for analyzing large-scale genomic data efficiently.