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

Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

13.6K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
13.6K
Multi-species Conserved Sequences02:51

Multi-species Conserved Sequences

4.9K
Next-generation sequencing technologies have created large genomic databases of a variety of animals and plants. Ever since the human genome project was completed, scientists studied the genome of primates, mammals, and other phylogenetically distant living beings. Such large-scale  studies have provided new insights into the evolutionary relationship between organisms.
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...
4.9K
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

464
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
464
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

595
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
595
Sequences01:29

Sequences

408
Sequences are fundamental mathematical objects consisting of ordered lists of numbers that follow a specific rule or pattern. Sequences are critical in various mathematical concepts, including calculus, series, and number theory. They can model real-world phenomena such as population growth, financial investments, and physical processes like the diminishing height of a bouncing ball.Each number in a sequence is referred to as a term. Typically, the terms are denoted as a1, a2, a3,…, where...
408
Conservation of Protein Domains Over Different Proteins02:26

Conservation of Protein Domains Over Different Proteins

15.0K
Protein domains are small structurally independent units that are part of a single amino acid chain.  Although these domains are often structurally independent, they may rely on synergistic effects to perform their functions as part of a larger protein. Protein domains may be conserved within the same organism, as well as across different organisms.
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to...
15.0K

You might also read

Related Articles

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

Sort by
Same author

Revolutionizing Transcriptomics: From Single-Cell Insights to RNA-based Interventions.

SLAS technology·2026
Same author

Personalized Hearing Loss Care Using SNOMED CT-Aligned Ontology and Random Forest Machine Learning: A Hybrid Decision-Support Framework.

Audiology research·2026
Same author

HyMSS-GAD: a hybrid multi-stage framework for multi-view graph anomaly detection with structural, contextual, and geometric reasoning.

Scientific reports·2026
Same author

Unified representation and scoring framework for anomaly detection in attributed networks with emphasis on structural consistency and attribute integrity.

Scientific reports·2025
Same author

UMI-Varcal: A Low-Frequency Variant Caller for UMI-Tagged Paired-End Sequencing Data.

Methods in molecular biology (Clifton, N.J.)·2022
Same author

Special Issue of the 1st International Applied Bioinformatics Conference (iABC'21).

Journal of integrative bioinformatics·2021
Same journal

DiffGRN: differential gene regulatory network analysis.

International journal of data mining and bioinformatics·2019
Same journal

Integration of multi-omics data for integrative gene regulatory network inference.

International journal of data mining and bioinformatics·2018
Same journal

The development of non-coding RNA ontology.

International journal of data mining and bioinformatics·2016
Same journal

Learning multiple distributed prototypes of semantic categories for named entity recognition.

International journal of data mining and bioinformatics·2015
Same journal

Weighted fusion regularisation and predicting microbial interactions with vector autoregressive model.

International journal of data mining and bioinformatics·2015
Same journal

Application of consensus string matching in the diagnosis of allelic heterogeneity involving transposition mutation.

International journal of data mining and bioinformatics·2015
See all related articles

Related Experiment Video

Updated: Mar 30, 2026

DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling
08:04

DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling

Published on: October 8, 2019

9.2K

A fast Boyer-Moore type pattern matching algorithm for highly similar sequences.

Nadia Ben Nsira, Thierry Lecroq, Mourad Elloumi

    International Journal of Data Mining and Bioinformatics
    |November 10, 2015
    PubMed
    Summary
    This summary is machine-generated.

    Next-generation sequencing (NGS) generates vast amounts of similar DNA data. We developed an efficient algorithm, extending Boyer-Moore, for fast exact pattern matching in these large genomic datasets.

    More Related Videos

    A Protocol for Computer-Based Protein Structure and Function Prediction
    16:41

    A Protocol for Computer-Based Protein Structure and Function Prediction

    Published on: November 3, 2011

    70.1K
    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

    752

    Related Experiment Videos

    Last Updated: Mar 30, 2026

    DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling
    08:04

    DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling

    Published on: October 8, 2019

    9.2K
    A Protocol for Computer-Based Protein Structure and Function Prediction
    16:41

    A Protocol for Computer-Based Protein Structure and Function Prediction

    Published on: November 3, 2011

    70.1K
    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

    752

    Area of Science:

    • Genomics
    • Bioinformatics
    • Computational Biology

    Background:

    • Next-generation sequencing (NGS) has revolutionized biology and medicine, enabling rapid and cost-effective acquisition of genomic data.
    • NGS technologies facilitate the collection of numerous highly similar DNA sequences (genes, exomes, genomes) within the same species, with >99% identity.
    • The abundance of similar genomic data necessitates efficient algorithms for indexing and pattern matching.

    Purpose of the Study:

    • To address the need for efficient algorithms for pattern matching in large sets of highly similar DNA sequences.
    • To propose a novel algorithm for exact pattern matching optimized for datasets generated by next-generation sequencing.

    Main Methods:

    • The study extends variants of the Boyer-Moore exact string matching algorithm.
    • The proposed algorithm is designed for exact pattern matching in sets of highly similar DNA sequences.
    • The algorithm allows for pre-processing of the pattern to enhance matching speed.

    Main Results:

    • Experimental results demonstrate superior performance of the proposed algorithm.
    • The algorithm achieves high efficiency in exact pattern matching for similar DNA sequence sets.
    • The method offers practical advantages in speed and performance for genomic data analysis.

    Conclusions:

    • The developed algorithm provides an efficient solution for exact pattern matching in large, highly similar genomic datasets.
    • This advancement is crucial for handling the data deluge from next-generation sequencing technologies.
    • The algorithm offers practical benefits for various bioinformatics applications requiring fast sequence analysis.