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

480
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...
480
Naming Enantiomers02:21

Naming Enantiomers

28.2K
The naming of enantiomers employs the Cahn–Ingold–Prelog rules that involve assigning priorities to different substituent groups at a chiral center. Each enantiomer, being a distinct molecule, is assigned a unique name by the Cahn–Ingold–Prelog (CIP) rules, also called the R–S system. The prefix R- or S- attached to the chiral centers in an enantiomer is dependent on the spatial arrangement of the four substituents on the chiral center. The R–S system...
28.2K
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

4.2K
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...
4.2K
Summation Notation01:25

Summation Notation

349
Sigma notation, also known as summation notation, provides a concise method for representing the sum of a sequence of terms that follow a regular pattern. It utilizes the uppercase Greek letter sigma (∑), A typical expression is:In this form, k the index of summation is 1, the starting value, and n the ending value. The term ak​ represents the general term of the sequence.For example, the increasing sequence 5, 7, 9, ..., 23 over 10 terms can be expressed as:This simplifies the...
349
Real Number Operations01:27

Real Number Operations

479
The concept of real numbers includes all the values that can be represented on a continuous number line. The system began with basic counting values used for enumeration. It later expanded to include values that represent the absence of quantity and opposites of the counting values. When situations required expressing parts of a whole or dividing quantities evenly, values capable of representing such proportions were developed. When written using decimal notation, these values can end or repeat...
479
Chirality at Nitrogen, Phosphorus, and Sulfur02:30

Chirality at Nitrogen, Phosphorus, and Sulfur

7.5K
Chirality is most prevalent in carbon-based tetrahedral compounds, but this important facet of molecular symmetry extends to sp3-hybridized nitrogen, phosphorus and sulfur centers, including trivalent molecules with lone pairs. Here, the lone pair behaves as a functional group in addition to the other three substituents to form an analogous tetrahedral center that can be chiral.
A consequence of chirality is the need for enantiomeric resolution. While this is theoretically possible for all...
7.5K

You might also read

Related Articles

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

Sort by
Same author

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

Scientific reports·2026
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 author

SUPERMAGO: Protein Function Prediction Based on Transformer Embeddings.

Proteins·2024
Same author

Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions.

IEEE transactions on computational biology and bioinformatics·2024
Same author

TEMPROT: protein function annotation using transformers embeddings and homology search.

BMC bioinformatics·2023
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: Apr 15, 2026

Sorting of Streptomyces Cell Pellets Using a Complex Object Parametric Analyzer and Sorter
07:37

Sorting of Streptomyces Cell Pellets Using a Complex Object Parametric Analyzer and Sorter

Published on: February 13, 2014

11.6K

Sorting signed permutations by short operations.

Gustavo Rodrigues Galvão1, Orlando Lee1, Zanoni Dias1

  • 1Institute of Computing, University of Campinas, Av. Albert Einstein, 1251, Campinas, 13083-852 Brazil.

Algorithms for Molecular Biology : AMB
|April 4, 2015
PubMed
Summary
This summary is machine-generated.

This study introduces efficient algorithms for sorting signed permutations using short genomic operations like reversals and transpositions. It provides polynomial-time solutions for small operations and approximation algorithms for larger ones, crucial for comparative genomics.

Keywords:
Genome rearrangementShort reversalsShort transpositions

More Related Videos

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
Step-specific Sorting of Mouse Spermatids by Flow Cytometry
06:31

Step-specific Sorting of Mouse Spermatids by Flow Cytometry

Published on: December 31, 2015

11.3K

Related Experiment Videos

Last Updated: Apr 15, 2026

Sorting of Streptomyces Cell Pellets Using a Complex Object Parametric Analyzer and Sorter
07:37

Sorting of Streptomyces Cell Pellets Using a Complex Object Parametric Analyzer and Sorter

Published on: February 13, 2014

11.6K
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
Step-specific Sorting of Mouse Spermatids by Flow Cytometry
06:31

Step-specific Sorting of Mouse Spermatids by Flow Cytometry

Published on: December 31, 2015

11.3K

Area of Science:

  • Computational Biology
  • Genomics
  • Bioinformatics

Background:

  • Genomic rearrangements (mutations) like reversals and transpositions alter gene order and orientation during evolution.
  • Sorting a genome (signed permutation) using a minimum number of operations is vital for comparative genomics.
  • Existing methods often overlook the length of operations, yet short operations are evolutionarily prevalent.

Purpose of the Study:

  • Investigate sorting signed permutations using short genomic operations (reversals and transpositions).
  • Develop efficient algorithms for specific short operation constraints (lengths 2 and 3).
  • Analyze the performance and approximation ratios of developed algorithms.

Main Methods:

  • Developed polynomial-time algorithms for sorting signed permutations by reversals of length at most 2.
  • Designed polynomial-time algorithms for sorting signed permutations by reversals and transpositions of length at most 2.
  • Created approximation algorithms for sorting by reversals of length at most 3 (5-approximation) and by reversals/transpositions of length at most 3 (3-approximation).

Main Results:

  • Achieved polynomial-time solutions for sorting by short reversals (≤2) and short reversals/transpositions (≤2).
  • Established a 5-approximation algorithm for sorting by reversals (≤3) and a 3-approximation for reversals/transpositions (≤3).
  • Demonstrated that the 3-approximation algorithm is tight, with experimental results showing approximation ratios cannot be smaller than 3.

Conclusions:

  • Efficient algorithms exist for sorting genomes with short evolutionary operations.
  • The developed approximation algorithms provide practical solutions for complex genomic sorting problems.
  • The tight 3-approximation for reversals/transpositions of length at most 3 offers a benchmark for future research in genome rearrangements.