This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Translocation-Deletions Distance Formula for Sorting Genomes
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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:
Fanchang Hao, Junfeng Luan, Daming Zhu, "Translocation-Deletions Distance Formula for Sorting Genomes," csie, vol. 4, pp.820-824, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.