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 unifying framework for seed sensitivity and its application to subset seeds.

Gregory Kucherov1, Laurent Noé, Mikhail Roytberg

  • 1LIFL/CNRS, Bât. M3, 59655 Villeneuve d'Ascq, France. Gregory.Kucherov@lifl.fr

Journal of Bioinformatics and Computational Biology
|July 5, 2006
PubMed
Summary

We developed a novel method to compute seed sensitivity for various seed types, enhancing similarity search performance. This approach efficiently designs sensitive subset seeds, outperforming traditional methods in biological sequence analysis.

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

Efficient and robust search of microbial genomes via phylogenetic compression.

Nature methods·2025
Same author

Efficient and Robust Search of Microbial Genomes via Phylogenetic Compression.

bioRxiv : the preprint server for biology·2023
Same author

Porechop_ABI: discovering unknown adapters in Oxford Nanopore Technology sequencing reads for downstream trimming.

Bioinformatics advances·2023
Same author

Space-efficient representation of genomic k-mer count tables.

Algorithms for molecular biology : AMB·2022
Same author

Set-Min Sketch: A Probabilistic Map for Power-Law Distributions with Application to <i>k</i>-Mer Annotation.

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

Simplitigs as an efficient and scalable representation of de Bruijn graphs.

Genome biology·2021

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Sequence Analysis

Background:

  • Seed-based methods are crucial for biological sequence similarity searches.
  • Existing seed sensitivity computation methods have limitations in flexibility and efficiency.
  • Developing adaptable and efficient seed models is essential for improving search accuracy.

Purpose of the Study:

  • To introduce a general and flexible approach for computing seed sensitivity.
  • To apply this approach to a novel concept of subset seeds.
  • To demonstrate the efficiency and effectiveness of the proposed method in similarity searches.

Main Methods:

  • Decomposition of seed sensitivity computation into three distinct components: target alignments, probability distribution, and seed model.

Related Experiment Videos

  • Specification of each component using separate finite automata.
  • Development of an efficient automaton construction for subset seeds.

    • Main Results:

    • The proposed general approach successfully computes seed sensitivity for different seed definitions.
    • An efficient automaton construction for subset seeds was developed.
    • Experimental results show that sensitive subset seeds designed with this approach improve similarity search results compared to ordinary spaced seeds.

    Conclusions:

    • The developed approach provides a flexible and efficient framework for seed sensitivity computation.
    • Subset seeds designed using this method offer enhanced performance in biological sequence similarity searches.
    • This work advances the design and application of seed models in bioinformatics.