Tandem halving problems by DCJ

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We address the problem of reconstructing a non-duplicated ancestor to a partially duplicated genome in a model where duplicated content is caused by several tandem duplications throughout its evolution and the only allowed rearrangement operations are DCJ. As a starting point, we consider a variant of the Genome Halving Problem, aiming at reconstructing a tandem duplicated genome instead of the traditional perfectly duplicated genome. We provide a distance in O(n) time and a scenario in O(n 2) time. In an attempt to enhance our model, we consider several problems related to multiple tandem reconstruction. Unfortunately we show that although the problem of reconstructing a single tandem can be solved polynomially, it is already NP-hard for 2 tandems. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Thomas, A., Ouangraoua, A., & Varré, J. S. (2012). Tandem halving problems by DCJ. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7534 LNBI, pp. 417–429). https://doi.org/10.1007/978-3-642-33122-0_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free