Reversal and Transposition Medians
Artikel i vetenskaplig tidskrift, 2007

In determining phylogenetic trees using gene order information, medians provide a powerful alternative to pairwise distances. On the other hand, both breakpoint and reversal medians are NP-hard to compute and the use of medians has been limited to relatively closely related genomes. In this paper, we show that in spite of the greater non-uniqueness of reversal medians, compared to breakpoint medians, medians of moderately distant genomes are often widely spread. This means that regardless of which approximation algorithms one may devise for computing reversal medians, the genomes need to be closely related for phylogenetic tree computations to be successful. To show this, we use results on transposition medians, which behave similarly, and also support our claims with simulations and a real data example with widely spread medians.



Genome rearrangement



Niklas Eriksen

Göteborgs universitet

Chalmers, Matematiska vetenskaper

Theoretical Computer Science

Vol. 374 111-126


Datavetenskap (datalogi)

Diskret matematik

Mer information