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

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 value between...
Signal Sequences and Sorting Receptors01:41

Signal Sequences and Sorting Receptors

Signal sequences are short amino acid sequences that guide newly synthesized proteins to their proper location within the cell. Classical signal sequences are fifteen to sixty amino acids long and present at the N-terminus of a polypeptide chain. Each signal sequence has a conserved segment of basic residues towards their N terminus, a hydrophobic core, and a C-terminus rich in polar residues. The C-terminus also contains a signal cleavage site and features a -3 -1 sequence motif. The -3-1...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

The Wald-Wolfowitz test, also known as the runs test, is a nonparametric statistical test used to assess the randomness of a sequence of two different types of elements (e.g., positive/negative values, successes/failures). It examines whether the order of the elements in a sequence is random or if there is a pattern or trend present. This nonparametric test applies to any ordered data despite the population and sample data distribution, even if a higher sample size is available.
The test works...
Sampling Theorem01:15

Sampling Theorem

In signal processing, the analysis of continuous-time signals, denoted as x(t), often involves sampling techniques to convert these signals into discrete-time signals. This process is essential for digital representation and manipulation. A critical component in sampling is the train of impulses, characterized by the sampling interval and the sampling frequency. The relationship between these parameters and the original signal's properties dictates the success of the sampling process.
Introduction to the Sign Test01:10

Introduction to the Sign Test

The sign test is an important tool in nonparametric statistics, offering a straightforward yet effective method for analyzing matched pairs, nominal data, or hypotheses concerning the median of a population. It transforms data points into positive or negative signs, avoiding the need for assumptions about data distribution and instead focusing on the direction of change. It is particularly valuable when data does not conform to the normal distribution requirements of many parametric tests. For...

You might also read

Related Articles

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

Sort by
Same author

From parasite biology to predictive metabolic models.

Trends in parasitology·2026
Same author

LLMs are ideological chameleons: personalized echo chambers in the Brazilian political context.

Scientific reports·2026
Same author

Differences in tumor mutational burden assessment: a national ring trial.

Acta oncologica (Stockholm, Sweden)·2026
Same author

Production of polyhydroxyalkanoates by Halomonas sp. HG01, a halophilic bacterium from northern Peru, using various carbon sources: metabolic and genomic analysis.

International journal of biological macromolecules·2025
Same author

Time-series visual representations for sleep stages classification.

PloS one·2025
Same author

Integrating Transformers and AutoML for Protein Function Prediction.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2025
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
Same journal

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: May 21, 2026

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

Sampling solution traces for the problem of sorting permutations by signed reversals.

Christian Baudet1, Zanoni Dias, Marie-France Sagot

  • 1Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, Villeurbanne, UMR5558, France. christian.baudet@univ-lyon1.fr.

Algorithms for Molecular Biology : AMB
|June 19, 2012
PubMed
Summary
This summary is machine-generated.

We developed three new algorithms (RA, DFALT, SWA) to sample optimal solutions for genome rearrangements, addressing limitations of existing methods for large permutations. These algorithms efficiently enumerate traces, preserving key characteristics of the solution space.

More Related Videos

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Related Experiment Videos

Last Updated: May 21, 2026

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

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • Traditional algorithms for sorting by signed reversals yield single optimal solutions, insufficient for large datasets.
  • The space of optimal solutions can be vast; traces offer a compact representation.
  • Complete enumeration of traces is computationally expensive, limiting its use to small permutations.

Purpose of the Study:

  • To develop and evaluate novel algorithms for partial enumeration (sampling) of traces for large permutations.
  • To create methods that preserve characteristics of the complete solution space.
  • To enable the study of evolutionary scenarios in large genomes.

Main Methods:

  • Randomized algorithm (RA) using random reversal selection.
  • Modified complete enumeration algorithm (DFALT).
  • Sliding window strategy algorithm (SWA) for improved enumeration.

Main Results:

  • All three algorithms successfully enumerated traces for permutations up to 200 elements.
  • RA and SWA showed a tendency to miss traces with high average reversal length.
  • DFALT and SWA produced distributions approximating complete enumeration for testable sizes.

Conclusions:

  • The developed algorithms offer practical approaches for sampling optimal solutions in genome rearrangement problems.
  • DFALT and SWA provide good approximations of reversal length distributions, crucial for understanding genome evolution.
  • Partial enumeration is a viable strategy for analyzing large genomic datasets.