Sciweavers

Share
BIOINFORMATICS
2011

Algorithms for sorting unsigned linear genomes by the DCJ operations

8 years 8 months ago
Algorithms for sorting unsigned linear genomes by the DCJ operations
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both linear and circular (uni- and multi-) chromosomes is well studied, the only known result for the NP-complete unsigned DCJ distance problem is an approximation algorithm for unsigned linear unichromosomal genomes. In this paper, we study the problem of computing the DCJ distance on two unsigned linear multichromosomal genomes (abbreviated as UDCJ).
Haitao Jiang, Binhai Zhu, Daming Zhu
Added 12 May 2011
Updated 12 May 2011
Type Journal
Year 2011
Where BIOINFORMATICS
Authors Haitao Jiang, Binhai Zhu, Daming Zhu
Comments (0)
books