Skip to main content
Conference Proceedings

Single Tandem Halving by Block Interchange

Communications in Computer and Information Science (2013) 357 CCIS 162-174
DOI: 10.1007/978-3-642-38256-7_11
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We address the problem of finding the minimal number of block interchanges required to transform a duplicated unilinear genome into a single tandem duplicated unilinear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem. This is the extended version of [1]. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Thomas, A., Ouangraoua, A., & Varré, J. S. (2013). Single Tandem Halving by Block Interchange. In Communications in Computer and Information Science (Vol. 357 CCIS, pp. 162–174). Springer Verlag. https://doi.org/10.1007/978-3-642-38256-7_11

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