Genome Halving under DCJ Revisited
The Genome Halving Problem is the following: Given a rearranged duplicated genome, find a perfectly duplicated genome such that the rearrangement distance between these genomes is minimal with respect to a particular model of genome rearrangement. Recently, Warren and Sankoff studied this problem under the general DCJ model where the pre-duplicated genome contains both, linear and circular chromosomes. In this paper, we revisit the Genome Halving Problem for the DCJ distance and we propose a genome model such that constraints for linear genomes, as well as the ones for circular genomes are taken into account. Moreover, we correct an error in the original paper.
Julia Mixtacki
International NRW Graduate School in Bioinformatics and Genome Research,Universitat Bielefeld, Germany
国际会议
The 4th Annual International Computing and Combinatorics Conference,COCOON 2008(第14届国际计算和组合会议)
大连
英文
276-286
2008-06-01（万方平台首次上网日期，不代表论文的发表时间）