Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Overview of Transposition and Recombination

Overview of Transposition and Recombination

Transposons make up a significant part of genomes of various organisms. Therefore, it is believed that transposition played a major evolutionary role in speciation by changing genome sizes and modifying gene expression patterns. For example, in bacteria, transposition can lead to conferring antibiotic resistance. Movement of transposable elements within the genetic pool of pathogenic bacteria can aid in transfer of antibiotic-resistant genetic elements. In eukaryotes, transposons can carry out...

Transposons

Transposons

Transposons, or "jumping genes," are small mobile genetic elements (MGEs) that range from 700 to 40,000 base pairs in length. They are found in all organisms and can move within the same chromosome or transfer to different chromosomes. In some cases, transposons can also jump between different host DNA molecules, such as plasmids or viruses, contributing to genetic variability.Barbara McClintock first discovered these mobile genetic elements in the 1940s while studying maize genetics, and she...

DNA-only Transposons

DNA-only Transposons

DNA-only transposons are called autonomous transposons since they code for the enzyme transposase that is required for the transposition mechanism. Insertion of transposons can alter gene functions in multiple ways. They can mutate the gene, alter gene expression by introducing a novel promoter or insulator sequence, introduce new splice sites, and change the mRNA transcripts produced, or remodel chromatin structure.
The donor site from where the transposon is excised is either degraded or...

Convolution Properties I

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:

Kendall's Tau Test

Kendall's Tau Test

Kendall's tau test, also known as the Kendall rank coefficient test, is a nonparametric method for assessing association between two variables. This test is particularly useful for identifying significant correlations when the distributions of the sample and population are unknown. Developed in 1938 by the British statistician Sir Maurice George Kendall, the tau coefficient (denoted as τ) serves as a rank correlation coefficient, with values ranging from -1 to +1.
A τ value of +1 indicates that...

Application of Linearization and Approximation

Application of Linearization and Approximation

A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...

You might also read

Related Articles

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

Sort by

Same author

ORANGE: a machine learning approach for modeling tissue-specific aging from transcriptomic data.

Briefings in bioinformatics·2026

Same author

A universal indel filtering workflow for both long-read and short-read NGS data.

BMC research notes·2026

Same author

Quantifying pathological progression from single-cell transcriptomic data with scPSS.

Genome research·2026

Same author

Revisiting motif finding: do bi-objective metaheuristics surpass single-objective metaheuristics?

BMC bioinformatics·2025

Same author

GraphAge: Unleashing the power of graph neural network to decode epigenetic aging.

PNAS nexus·2025

Same author

PRIEST: predicting viral mutations with immune escape capability of SARS-CoV-2 using temporal evolutionary information.

Briefings in bioinformatics·2024

Search research articles

Related Experiment Video

Updated: May 31, 2026

RBDT: A Computerized Task System based in Transposition for the Continuous Analysis of Relational Behavior Dynamics in Humans

RBDT: A Computerized Task System based in Transposition for the Continuous Analysis of Relational Behavior Dynamics in Humans

Published on: July 17, 2021

The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time.

Jesun Sahariar Firoz¹, Masud Hasan, Ashik Zinnat Khan

¹Department of CSE, BUET, Dhaka, Bangladesh.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology

|June 28, 2011

Summary

This study enhances the sorting by transpositions algorithm, a key bioinformatics problem. We achieved a faster running time for the best approximation algorithm, improving computational efficiency.

More Related Videos

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

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

Published on: February 13, 2014

Determination of the Optimal Chromosomal Location(s) for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Determination of the Optimal Chromosomal Location(s) for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Published on: September 11, 2017

Related Experiment Videos

Last Updated: May 31, 2026

RBDT: A Computerized Task System based in Transposition for the Continuous Analysis of Relational Behavior Dynamics in Humans

RBDT: A Computerized Task System based in Transposition for the Continuous Analysis of Relational Behavior Dynamics in Humans

Published on: July 17, 2021

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

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

Published on: February 13, 2014

Determination of the Optimal Chromosomal Location(s) for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Determination of the Optimal Chromosomal Location(s) for a DNA Element in Escherichia coli Using a Novel Transposon-mediated Approach

Published on: September 11, 2017

Area of Science:

Bioinformatics
Computational Biology
Algorithm Analysis

Background:

Sorting a permutation by transpositions (SPbT) is a critical problem in bioinformatics.
Efficient algorithms are needed for analyzing genomic rearrangements and evolutionary histories.

Purpose of the Study:

To improve the running time of the existing approximation algorithm for SPbT.
To enhance computational efficiency for permutation sorting in biological sequence analysis.

Main Methods:

Analysis of the current best-known approximation algorithm for SPbT.
Development and implementation of algorithmic improvements to reduce computational complexity.

Main Results:

Achieved a significant improvement in the running time of the SPbT approximation algorithm.
Demonstrated enhanced performance compared to previous methods.

Conclusions:

The improved algorithm offers a more efficient solution for the SPbT problem.
This advancement has implications for faster and more scalable bioinformatics analyses.