On the DCJ Median Problem

  • Mingfu Shao
  • Bernard M. E. Moret
Conference paper

DOI: 10.1007/978-3-319-07566-2_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8486)
Cite this paper as:
Shao M., Moret B.M.E. (2014) On the DCJ Median Problem. In: Kulikov A.S., Kuznetsov S.O., Pevzner P. (eds) Combinatorial Pattern Matching. CPM 2014. Lecture Notes in Computer Science, vol 8486. Springer, Cham

Abstract

As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data given at the leaves. When phrased as an optimization problem, this problem reduces to computing a median of three genomes under the operations (evolutionary changes) of interest. We focus on the universal rearrangement operation known as double-cut-and join (DCJ) and present three contributions to the DCJ median problem. First, we describe a new strategy to find so-called adequate subgraphs in the multiple breakpoint graph, using a seed genome. We show how to compute adequate subgraphs w.r.t. this seed genome using a network flow formulation. Second, we prove that the upper bound of the median distance computed from the triangle inequality is tight. Finally, we study the question of whether the median distance can reach its lower and upper bounds. We derive a necessary and sufficient condition for the median distance to reach its lower bound and a necessary condition for it to reach its upper bound and design algorithms to test for these conditions.

Keywords

genomic rearrangement network flow dynamic programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Mingfu Shao
    • 1
  • Bernard M. E. Moret
    • 1
  1. 1.Laboratory for Computational Biology and BioinformaticsEPFLSwitzerland

Personalised recommendations