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

Reducing storage requirements for biological sequence comparison.

Michael Roberts1, Wayne Hayes, Brian R Hunt

  • 1Institute for Physical Science and Technology, University of Maryland, College Park, MD 20742-2431, USA.

Bioinformatics (Oxford, England)
|July 17, 2004
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

Biodegradable cross-linked flavone networks featuring either ester or carbamate linkages for controlled delivery of anti-cancer agents.

RSC advances·2026
Same author

Detection of a sequence feature for recursive splicing.

bioRxiv : the preprint server for biology·2026
Same author

Ambiguity in identifying parameters of an SIR model when fitting epidemic incidence data.

Mathematical biosciences and engineering : MBE·2026
Same author

Low-molecular weight organogel matrices as crystallisation media for active pharmaceutical ingredients.

Journal of materials chemistry. B·2026
Same author

A Complex Ear Reconstruction.

Dermatologic surgery : official publication for American Society for Dermatologic Surgery [et al.]·2025
Same author

Polymerisation processes and computational methods to control structure: general discussion.

Faraday discussions·2025
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
Same journal

SpaMFG: a Spatial Multi-omics Integration Method based on Feature Grouping.

Bioinformatics (Oxford, England)·2026
Same journal

CSCN: Inference of Cell-Specific Causal Networks Using Single-Cell RNA-Seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

Sparse CCA-Based Mediation Analysis with High-Dimensional Exposures and Mediators.

Bioinformatics (Oxford, England)·2026
Same journal

Enhancing Cross-Context Generalization in Drug Perturbation Prediction with a Multimodal Conditional Diffusion Framework.

Bioinformatics (Oxford, England)·2026
Same journal

Primer Design through Submodular Function Estimation.

Bioinformatics (Oxford, England)·2026
See all related articles

Storing fewer sequence seeds speeds up bioinformatics searches. A new method using "minimizers" significantly accelerates string matching by reducing the number of seeds that need to be catalogued and stored.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Sequence comparison is crucial in bioinformatics.
  • The seed-and-extend method is dominant for string matching.
  • Large sequence databases exceed single-computer RAM capacity, slowing searches.

Purpose of the Study:

  • To address the memory limitations of seed-and-extend algorithms.
  • To improve the efficiency of large-scale sequence matching.

Main Methods:

  • Implementing a "minimizer" approach to seed selection.
  • Storing only a small fraction of potential seeds.

Main Results:

  • The minimizer method significantly speeds up string matching.

Related Experiment Videos

  • This approach retains most matches found using all seeds.
  • Memory requirements are substantially reduced.

    • Conclusions:

    • Minimizers offer an efficient alternative for large-scale sequence analysis.
    • This method enhances the practicality of seed-and-extend for massive datasets.