Related Experiment Video
Updated: Jun 27, 2026

Genome-wide Surveillance of Transcription Errors in Eukaryotic Organisms
Published on: September 13, 2018
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Martin Bader1, Mohamed I Abouelhoda, Enno Ohlebusch
1Institute of Theoretical Computer Science, University of Ulm, Ulm, Germany. martin.bader@uni-ulm.de
This study introduces a new heuristic algorithm for phylogenetic tree reconstruction using weighted reversal and transposition distances. This method generates more biologically realistic evolutionary scenarios than previous approaches.
Area of Science:
- Genomics
- Computational Biology
- Bioinformatics
Background:
- Genome sequencing advancements provide extensive data for phylogenetic reconstruction.
- Phylogenetic reconstruction using genome rearrangement distances is computationally challenging.
- Existing methods for breakpoint and reversal distances are NP-hard, even for small datasets.
Purpose of the Study:
- To develop a novel heuristic algorithm for direct phylogenetic tree construction.
- To incorporate weighted reversal and transposition distances into phylogenetic analysis.
- To address the computational complexity of phylogenetic reconstruction.
Main Methods:
- A new heuristic algorithm was developed for phylogenetic tree construction.
- The algorithm directly utilizes weighted reversal and transposition distances.
- The approach was evaluated on existing biological datasets.
Main Results:
- Phylogenetic trees constructed using the new algorithm showed improved accuracy.
- The new method outperformed trees based solely on reversal distance.
- The algorithm demonstrated effectiveness with weighted reversal and transposition distances.
Conclusions:
- Direct construction of phylogenetic trees with weighted reversal and transposition distances yields more biologically realistic evolutionary models.
- The developed algorithm efficiently handles complex biological datasets.
- This approach offers a significant advancement in computational phylogenetics.
Related Concept Videos
Overview of Transposition and Recombination
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Gene Conversion
Gene Conversion
Exon Recombination
Exon shuffling follows “splice frame rules.” Each exon has three reading...
Gene Evolution - Fast or Slow?
In contrast, regions which code...

