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

Even and Odd Signals01:17

Even and Odd Signals

An even signal, whether in continuous-time or discrete-time, is defined by its symmetry with its time-reversed version. Mathematically, this is represented as
Transformations of Functions III01:20

Transformations of Functions III

Transformations modify the graphical representation of a function without changing its fundamental form. One common transformation is reflection, which flips the graph across a designated axis. When the vertical coordinates of all points are multiplied by the negative one, the entire graph is mirrored over the horizontal axis. This transformation reverses the vertical orientation of peaks and troughs, akin to signal inversion in electrical systems, where a waveform is flipped, but the timing of...
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...
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...
Basic Operations on Signals01:22

Basic Operations on Signals

Basic signal operations include time reversal, time scaling, time shifting, and amplitude transformations. These operations are fundamental in signal processing and analysis.
Time Reversal mirrors a continuous-time signal about the vertical axis at t=0. This is achieved by substituting t with −t. For example, if a signal x(t) is considered, the time-reversed signal is x(−t). This operation can be graphically represented, showing the mirrored signal.
Convolution Properties I01:20

Convolution Properties I

Convolution computations can be simplified by utilizing their inherent properties.
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:

You might also read

Related Articles

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

Sort by
Same author

End-to-end approach for the characterization and control of product-related impurities in T cell bispecific antibody preparations.

International journal of pharmaceutics: X·2023
Same author

Author Correction: Behaviour reactions of bottlenose dolphins (Tursiops truncatus) to multirotor Unmanned Aerial Vehicles (UAVs).

Scientific reports·2020
Same author

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.

Algorithms for molecular biology : AMB·2020
Same author

Behaviour reactions of bottlenose dolphins (Tursiops truncatus) to multirotor Unmanned Aerial Vehicles (UAVs).

Scientific reports·2019
Same author

Developability assessment during the selection of novel therapeutic antibodies.

Journal of pharmaceutical sciences·2015
Same author

Combined inhibition of tumor necrosis factor α and interleukin-17 as a therapeutic opportunity in rheumatoid arthritis: development and characterization of a novel bispecific antibody.

Arthritis & rheumatology (Hoboken, N.J.)·2014
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

Related Experiment Videos

Fast algorithms for transforming back and forth between a signed permutation and its equivalent simple permutation.

Simon Gog1, Martin Bader

  • 1Faculty of Engineering and Computer Sciences, Ulm University, Ulm, Germany. simon.gog@uni-ulm.de

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|September 11, 2008
PubMed
Summary
This summary is machine-generated.

This study introduces faster algorithms for transforming signed permutations into simple ones, crucial for genome rearrangement problems. These new methods significantly improve the efficiency of sorting by reversals. Keywords: genome rearrangement, sorting by reversals, signed permutations, simple permutations.

Related Experiment Videos

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Algorithm Analysis

Background:

  • The problem of sorting signed permutations by reversals is fundamental in computational biology.
  • Existing algorithms often rely on transforming permutations into simple ones, with current methods having quadratic running times.
  • Efficient transformation algorithms are crucial for advancing genome rearrangement research.

Purpose of the Study:

  • To develop faster algorithms for transforming signed permutations into equivalent simple permutations.
  • To improve the efficiency of the back-transformation process for sorting sequences.
  • To facilitate further research in genome rearrangement problems.

Main Methods:

  • Developed a linear time algorithm for permutation transformation.
  • Designed an O(n log n) algorithm for the back-transformation of sorting sequences.

Main Results:

  • Achieved a linear time complexity for transforming permutations into simple permutations.
  • Established an O(n log n) complexity for the back-transformation of sorting sequences.
  • These results offer significant speedups compared to previous quadratic time algorithms.

Conclusions:

  • The presented algorithms provide substantial improvements in computational efficiency for key tasks in sorting by reversals.
  • These advancements are expected to accelerate research and development in genome rearrangement analysis.
  • The new methods address a critical bottleneck in computational biology.