On pairwise distances and median score of three genomes under DCJ
Sergey Aganezov, Jr., Max A. Alekseyev

TL;DR
This paper investigates the relationship between pairwise genomic distances and the median score under DCJ rearrangements, revealing that they are less correlated than previously thought and providing bounds and properties of the median score.
Contribution
It establishes new theoretical insights into the relationship between pairwise distances and median score, including bounds and the impact of strong rearrangements under the DCJ model.
Findings
Strong rearrangements can increase pairwise distance sum without affecting median score.
Median score equals the lower bound for genomes derived from a single genome with strong rearrangements.
The difference between median score and its lower bound is unbounded.
Abstract
In comparative genomics, the rearrangement distance between two genomes (equal the minimal number of genome rearrangements required to transform them into a single genome) is often used for measuring their evolutionary remoteness. Generalization of this measure to three genomes is known as the median score (while a resulting genome is called median genome). In contrast to the rearrangement distance between two genomes which can be computed in linear time, computing the median score for three genomes is NP-hard. This inspires a quest for simpler and faster approximations for the median score, the most natural of which appears to be the halved sum of pairwise distances which in fact represents a lower bound for the median score. In this work, we study relationship and interplay of pairwise distances between three genomes and their median score under the model of Double-Cut-and-Join…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
