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

Improved hit criteria for DNA local alignment.

Laurent Noé1, Gregory Kucherov

  • 1LORIA/INRIA-Lorraine, Villers-lès-Nancy France. Laurent.Noe@loria.fr

BMC Bioinformatics
|October 16, 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

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

This study enhances heuristic local alignment algorithms by introducing a novel group criterion and transition-constrained seeds. These improvements boost similarity search sensitivity without increasing computational time.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Algorithm Development

Background:

  • The hit criterion is crucial for heuristic local alignment algorithms, determining method selectivity and sensitivity.
  • Existing algorithms use single-seed or double-seed approaches, each with limitations.

Purpose of the Study:

  • To improve the hit criterion in heuristic local alignment algorithms.
  • To enhance the sensitivity of similarity searches.
  • To maintain or improve computational efficiency.

Main Methods:

  • Introduction of a 'group criterion' that combines single-seed and double-seed advantages.
  • Development of 'transition-constrained seeds' to differentiate transition and transversion mismatches.
  • Implementation and experimental validation using the YASS software.

Related Experiment Videos

Main Results:

  • The proposed group criterion improves the hit criterion's effectiveness.
  • Transition-constrained seeds offer enhanced control over mismatch types.
  • Analytical and experimental data confirm the benefits of both proposed improvements.

Conclusions:

  • The novel algorithmic approaches significantly increase similarity search sensitivity.
  • These improvements are achieved without an increase in execution time.
  • The enhanced method is available in the YASS software.