License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.WABI.2017.24
URN: urn:nbn:de:0030-drops-76604
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7660/
Go to the corresponding LIPIcs Volume Portal


Simonaitis, Pijus ; Swenson, Krister M.

Finding Local Genome Rearrangements

pdf-format:
LIPIcs-WABI-2017-24.pdf (0.9 MB)


Abstract

The Double Cut and Join (DCJ) model of genome rearrangement is well studied due to its mathematical simplicity and power to account for the many events that transform genome architecture. These studies have mostly been devoted to the understanding of minimum length scenarios transforming one genome into another. In this paper we search instead for DCJ rearrangement scenarios that minimize the number of rearrangements whose breakpoints are unlikely due to some biological criteria. We establish a link between this Minimum Local Scenario (MLS) problem and the problem of finding a Maximum Edge-disjoint Cycle Packing (MECP) on an undirected graph. This link leads us to a 3/2-approximation for MLS, as well as an exact integer linear program. From a practical perspective, we briefly report on the applicability of our methods and the potential for computation of distances using a more general DCJ cost function.

BibTeX - Entry

@InProceedings{simonaitis_et_al:LIPIcs:2017:7660,
  author =	{Pijus Simonaitis and Krister M. Swenson},
  title =	{{Finding Local Genome Rearrangements}},
  booktitle =	{17th International Workshop on Algorithms in Bioinformatics (WABI 2017)},
  pages =	{24:1--24:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-050-7},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{88},
  editor =	{Russell Schwartz and Knut Reinert},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7660},
  URN =		{urn:nbn:de:0030-drops-76604},
  doi =		{10.4230/LIPIcs.WABI.2017.24},
  annote =	{Keywords: genome rearrangement, double cut and join, maximum edge-disjoint cycle packing, Hi-C, NP-complete, approximation algorithm}
}

Keywords: genome rearrangement, double cut and join, maximum edge-disjoint cycle packing, Hi-C, NP-complete, approximation algorithm
Seminar: 17th International Workshop on Algorithms in Bioinformatics (WABI 2017)
Issue Date: 2017
Date of publication: 03.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI