Sorting by cuts, joins and whole chromosome duplications

Ron Zeira, Ron Shamir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Genome rearrangement problems have been extensively studied due to their importance in biology. Most studied models assumed a single copy per gene. However, in reality duplicated genes are common, most notably in cancer. Here we make a step towards handling duplicated genes by considering a model that allows the atomic operations of cut, join and whole chromosome duplication. Given two linear genomes, Γ with one copy per gene, and Δ with two copies per gene, we give a linear time algorithm for computing a shortest sequence of operations transforming Γ into Δ such that all intermediate genomes are linear. We also show that computing an optimal sequence with fewest duplications is NP-hard.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings
EditorsUgo Vaccaro, Ely Porat, Ferdinando Cicalese
PublisherSpringer Verlag
Pages396-409
Number of pages14
ISBN (Print)9783319199283
DOIs
StatePublished - 2015
Event26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 - Ischia Island, Italy
Duration: 29 Jun 20151 Jul 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9133
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015
Country/TerritoryItaly
CityIschia Island
Period29/06/151/07/15

Keywords

  • Computational genomics
  • Genome rearrangements
  • SCJ

Fingerprint

Dive into the research topics of 'Sorting by cuts, joins and whole chromosome duplications'. Together they form a unique fingerprint.

Cite this