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

MAP: searching large genome databases.

Tamer Kahveci1, Ambuj Singh

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

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|February 27, 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

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
Same author

Morphological profiling for drug discovery in the era of deep learning.

Briefings in bioinformatics·2024
Same journal

Trust, Reproducibility, and Progress: The Roles of Independent Blind Prediction and Assessment and Benchmarking in Computational Biology.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

The Evolving Cyberinfrastructure at the National Institutes of Health to Support Data and AI in Biomedical Research.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Applications of AI & ML in Biomanufacturing of Cell and Gene Therapies.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

AI for Health: Leveraging Artificial Intelligence to Revolutionize Healthcare.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Workshop Introduction: Advances of AI Methods in Single Cell Spatial Omics.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

DRIVE-KG: Enhancing variant-phenotype association discovery in understudied complex diseases using heterogeneous knowledge graphs.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
See all related articles

This study introduces an efficient genome string alignment technique that significantly reduces computational costs and disk I/O. The new method achieves up to 97x faster alignment compared to BLAST, improving large-scale genome comparisons.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Biological applications frequently require the comparison of large genome strings.
  • Existing methods face challenges with high disk I/O, computational costs, extensive memory usage, and large candidate sets.

Purpose of the Study:

  • To develop an efficient technique for aligning large genome strings.
  • To overcome the limitations of current genome comparison methods.

Main Methods:

  • Precomputation of associations between database and query strings to prune dissimilar pairs.
  • Utilizing hash tables for comparing unpruned string regions.
  • Implementation of a dynamic strategy to optimize hash table disk I/O and provide rapid similarity visualization.

Related Experiment Videos

Main Results:

  • The proposed technique significantly reduces computational cost and disk I/O.
  • Experimental results demonstrate alignment speeds up to 97 times faster than BLAST.
  • The method allows for quick coarse-grain visualization of similarity patterns.

Conclusions:

  • The developed technique offers a substantial improvement in the efficiency of large genome string alignment.
  • This method addresses the critical need for faster and more cost-effective genome comparison in biological applications.