A linear time algorithm for the inversion median problem in circular bacterial genomes

Authors:
Enno Ohlebusch;Mohamed I. Abouelhoda;Kathrin Hockel
Affiliations:
Faculty of Engineering and Computer Sciences, University of Ulm, 89069 Ulm, Germany;Faculty of Engineering and Computer Sciences, University of Ulm, 89069 Ulm, Germany;Faculty of Engineering and Computer Sciences, University of Ulm, 89069 Ulm, Germany
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 6
Cited 1

Formulations and hardness of multiple sorting by reversals

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

SIAM Journal on Computing
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Edit Distances for Genome Comparisons Based on Non-Local Operations

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
The median problem for the reversal distance in circular bacterial genomes

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Sorting genomes using almost-symmetric inversions

Proceedings of the 27th Annual ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the median problem, we are given a distance or dissimilarity measure d, three genomes G"1,G"2, and G"3, and we want to find a genome G (a median) such that the sum @?"i"="1^3d(G,G"i) is minimized. The median problem is a special case of the multiple genome rearrangement problem, where one wants to find a phylogenetic tree describing the most ''plausible'' rearrangement scenario for multiple species. The median problem is NP-hard for both the breakpoint and the reversal distance. To the best of our knowledge, there is no approach yet that takes biological constraints on genome rearrangements into account. In this paper, we make use of the fact that in circular bacterial genomes the predominant mechanism of rearrangement are inversions that are centered around the origin or the terminus of replication and single gene inversions. These constraints simplify the median problem significantly. More precisely, we show that the median problem for the reversal distance can be solved in linear time for circular bacterial genomes.