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

Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

483
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...
483
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

13.9K
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.9K
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

638
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...
638
Per-Unit Sequence Models01:26

Per-Unit Sequence Models

498
An ideal Y-Y transformer, grounded through neutral impedances, displays per-unit sequence networks akin to those of a single-phase ideal transformer when subjected to balanced positive- or negative-sequence currents. These currents do not produce neutral currents, and their associated voltage drops.
Zero-sequence currents, which are identical in magnitude and phase, generate a neutral current, resulting in voltage drops across the neutral impedance and the low-voltage winding. If the...
498
Cluster Sampling Method01:20

Cluster Sampling Method

15.8K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
15.8K
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

7.3K
Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
7.3K

You might also read

Related Articles

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

Sort by
Same author

Herpes simplex virus type 1 reshapes host chromatin architecture via transcription machinery hijacking.

Nature communications·2025
Same author

CodonTransformer: a multispecies codon optimizer using context-aware neural networks.

Nature communications·2025
Same author

Mass Spectrometry Identification of Biomarkers in Extracellular Vesicles From Plasmodium vivax Liver Hypnozoite Infections.

Molecular & cellular proteomics : MCP·2022
Same author

Causality in transcription and genome folding: Insights from X inactivation.

BioEssays : news and reviews in molecular, cellular and developmental biology·2022
Same author

Chromatin and viral integration in immunity: The challenge of silencing non-self genes.

Trends in immunology·2022
Same author

Strand asymmetry influences mismatch resolution during a single-strand annealing.

Genome biology·2022
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
Same journal

Informative Relational Learning for Adverse Reaction Prediction with Enhanced Generalization to Novel Drugs.

Bioinformatics (Oxford, England)·2026
Same journal

An interpretable deep learning framework uncovers features governing CRISPR-Cas9 genome-editing efficiency.

Bioinformatics (Oxford, England)·2026
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
See all related articles

Related Experiment Video

Updated: Apr 18, 2026

BEST: Barcode Enabled Sequencing of Tetrads
12:59

BEST: Barcode Enabled Sequencing of Tetrads

Published on: May 1, 2014

10.6K

Starcode: sequence clustering based on all-pairs search.

Eduard Zorita1, Pol Cuscó1, Guillaume J Filion1

  • 1Genome Architecture, Gene Regulation, Stem Cells and Cancer Programme, Centre for Genomic Regulation (CRG), Dr. Aiguader 88, 08003 Barcelona and Universitat Pompeu Fabra (UPF), 08002 Barcelona, Spain Genome Architecture, Gene Regulation, Stem Cells and Cancer Programme, Centre for Genomic Regulation (CRG), Dr. Aiguader 88, 08003 Barcelona and Universitat Pompeu Fabra (UPF), 08002 Barcelona, Spain.

Bioinformatics (Oxford, England)
|February 2, 2015
PubMed
Summary
This summary is machine-generated.

This study introduces starcode, an exact algorithm for efficient sequence error correction. Starcode accurately identifies similar DNA barcodes, outperforming existing methods in speed and precision for computational biology applications.

More Related Videos

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

770
A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

11.7K

Related Experiment Videos

Last Updated: Apr 18, 2026

BEST: Barcode Enabled Sequencing of Tetrads
12:59

BEST: Barcode Enabled Sequencing of Tetrads

Published on: May 1, 2014

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

770
A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

11.7K

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • High-throughput sequencing generates large datasets requiring error correction.
  • Accurate sequencing is crucial for applications like DNA barcode analysis.
  • Pairwise comparison of sequences for error correction is computationally intensive.

Purpose of the Study:

  • To develop an exact algorithm for identifying sequence pairs within a specified Levenshtein distance.
  • To improve the efficiency and precision of error correction for DNA barcodes.

Main Methods:

  • Developed an exact algorithm utilizing a novel implementation of the Needleman-Wunsch algorithm (poucet search) on a trie data structure.
  • Implemented the algorithm in C and made the source code publicly available.

Main Results:

  • The starcode algorithm precisely determines sequence similarity within a given Levenshtein distance.
  • Starcode demonstrates superior speed and accuracy compared to existing sequence clustering algorithms for random barcode matching.
  • Matched similar sequences are efficiently merged into clusters for error correction and redundancy reduction.

Conclusions:

  • Starcode offers an efficient and precise solution for sequence error correction in computational biology.
  • The algorithm is particularly effective for analyzing large datasets of random DNA barcodes.
  • The poucet search on a trie provides a significant computational advantage.