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 Concept Videos

Hückel's Rule Diagram of π MOs: Frost Circle01:08

Hückel's Rule Diagram of π MOs: Frost Circle

6.3K
The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...
6.3K
¹H NMR Chemical Shift Equivalence: Homotopic and Heterotopic Protons01:03

¹H NMR Chemical Shift Equivalence: Homotopic and Heterotopic Protons

5.1K
Protons in identical electronic environments within a molecule are chemically equivalent and have the same chemical shift. The replacement test is a useful tool to identify chemical equivalence and predict NMR spectra. A substituent replaces each of the protons being examined and the resulting molecules are compared. If the same molecule is obtained, the protons are equivalent or homotopic. Replacement of any hydrogens in ethane by chlorine yields chloroethane because all six protons are...
5.1K
Modern Molecular Taxonomy01:29

Modern Molecular Taxonomy

837
Advancements in molecular biology have revolutionized the identification and characterization of bacteria, with multiple methods leveraging DNA sequencing for enhanced precision. As sequencing technologies improve and costs decline, these approaches are increasingly used in clinical, environmental, and evolutionary studies.Multilocus Sequence Typing (MLST) examines several housekeeping genes, essential chromosomal genes encoding cellular functions, to distinguish strains. Approximately...
837
Mismatch Repair01:20

Mismatch Repair

7.0K
Organisms are capable of detecting and fixing nucleotide mismatches that occur during DNA replication. This sophisticated process requires identifying the new strand and replacing the erroneous bases with correct nucleotides. Mismatch repair is coordinated by many proteins in both prokaryotes and eukaryotes.
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
7.0K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Domain-specific adaptation for MR image synthesis with text-guided diffusion.

Physics in medicine and biology·2026
Same author

Automated system of analysis to quantify pediatric hip morphology.

Computers in biology and medicine·2025
Same author

Automatic Segmentation of the Paediatric Femoral Head.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2023
Same author

Evolutionary Modification of Echinoid Sperm Correlates with Developmental Mode: (direct development/evolution of development/sea urchins/sperm morphology/genome size).

Development, growth & differentiation·2023
Same author

Using an Ensemble to Identify and Classify Macroalgae Antimicrobial Peptides.

Interdisciplinary sciences, computational life sciences·2021
Same author

Recurrent autonomous autoencoder for intelligent DDoS attack mitigation within the ISP domain.

International journal of machine learning and cybernetics·2021
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: Apr 4, 2026

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

757

Approximate k-Mer Matching Using Fuzzy Hash Maps.

John Healy, Desmond Chambers

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |September 11, 2015
    PubMed
    Summary
    This summary is machine-generated.

    We developed a fast fuzzy technique for approximate k-mer matching. This method combines hashing speed with dynamic programming sensitivity for efficient sequence analysis.

    More Related Videos

    A Practical Guide to Phylogenetics for Nonexperts
    12:00

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    36.3K
    Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens
    09:14

    Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

    Published on: June 28, 2018

    7.6K

    Related Experiment Videos

    Last Updated: Apr 4, 2026

    A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
    10:23

    A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

    Published on: July 11, 2025

    757
    A Practical Guide to Phylogenetics for Nonexperts
    12:00

    A Practical Guide to Phylogenetics for Nonexperts

    Published on: February 5, 2014

    36.3K
    Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens
    09:14

    Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

    Published on: June 28, 2018

    7.6K

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Genomics

    Background:

    • Approximate k-mer matching is crucial for analyzing biological sequences.
    • Existing methods often involve a trade-off between speed and accuracy.
    • Hashing and dynamic programming are common but separate approaches.

    Purpose of the Study:

    • To present a novel fuzzy technique for approximate k-mer matching.
    • To integrate the speed of hashing with the sensitivity of dynamic programming.
    • To achieve efficient and accurate sequence comparison.

    Main Methods:

    • Developed a fuzzy technique for approximate k-mer matching.
    • Utilized the collision detection mechanism inherent in hash maps.
    • Unified the 'seed and extend' phases into a single operation.

    Main Results:

    • The proposed method achieves approximate k-mer matching.
    • The technique combines the speed of hashing with the sensitivity of dynamic programming.
    • The unified operation executes in approximately O(1) average time.

    Conclusions:

    • This fuzzy technique offers a significant improvement in the efficiency of approximate k-mer matching.
    • The approach provides a balance between computational speed and matching sensitivity.
    • The method is well-suited for large-scale genomic data analysis.