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

On approximate string matching of unique oligonucleotides.

H Hyyrö1, M Vihinen, M Juhola

  • 1Department of Computer and Information Sciences, 33014 University of Tampere, Finland. Heikki.Hyyro@uta.fi

Studies in Health Technology and Informatics
|October 18, 2001
PubMed
Summary

This study explores approximate string matching for DNA sequences, crucial for bioinformatics. Researchers tested and developed algorithms, focusing on efficiency for large datasets.

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

Substitution scanning identifies a novel, catalytically active ibrutinib-resistant BTK cysteine 481 to threonine (C481T) variant.

Leukemia·2016
Same author

Application of a modified two-point backward difference to sequential event detection in surface electromyography.

Journal of medical engineering & technology·2009
Same author

Somatic mutation databases as tools for molecular epidemiology and molecular pathology of cancer: proposed guidelines for improving data collection, distribution, and integration.

Human mutation·2008
Same author

Modelling stabilograms with hidden Markov models.

Journal of medical engineering & technology·2008
Same author

Differential cancer predisposition in Lynch syndrome: insights from molecular analysis of brain and urinary tract tumors.

Carcinogenesis·2008
Same author

Recommendations for locus-specific databases and their curation.

Human mutation·2007

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Approximate string matching is vital for analyzing DNA sequences.
  • Bioinformatics relies on efficient algorithms for large biological datasets.

Purpose of the Study:

  • To evaluate existing approximate string matching algorithms for DNA sequence analysis.
  • To develop a novel, efficient algorithm tailored for DNA data.

Main Methods:

  • Comparative analysis of multiple approximate string matching algorithms.
  • Development and implementation of a new algorithm optimized for DNA sequences.
  • Performance evaluation based on runtime for large-scale datasets.

Main Results:

  • Identified the most effective existing algorithms for DNA sequence matching.

Related Experiment Videos

  • Demonstrated the performance of the newly developed algorithm.
  • Highlighted the critical impact of algorithm runtime on large DNA datasets.

    • Conclusions:

    • The developed algorithm offers an efficient solution for approximate string matching in DNA sequences.
    • Efficient algorithm selection and development are key to advancing bioinformatics computations.
    • Runtime performance is a critical factor in handling massive biological data.