Subscribe

Los Angeles, CA

March 31, 2009 to April 2, 2009

ISBN: 978-0-7695-3507-4

pp: 820-824

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.116

ABSTRACT

Given two signed multi-chromosomal genomes Π and Γ, where gene set of Γ is the proper subset of that of Π, the problem of sorting by translocation-deletions, which is abbrebiated as STD, is to find the shortest sequence transforming Π to Γ via the two operations mentioned above only. A lower bound of the distance from Π to Γ and an asymptotically optimal algorithm has been given [1]. In this paper we present a formula to calculate the translocation-deletions distance for the first time. Moreover, we improved the existing algorithms to a new one, which is the first algorithm presenting the precise distance and the optimal translocation and deletion sequence in polynomial-time. After giving the algorithm analysis, we illustrate the performence with an example.

INDEX TERMS

sorting genomes, translocation and deletion, distance formula, precise algorithm

CITATION

Junfeng Luan,
Daming Zhu,
"Translocation-Deletions Distance Formula for Sorting Genomes",

*CSIE*, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 820-824, doi:10.1109/CSIE.2009.116