Genome aliquoting with double cut and join
Background: The genome aliquoting probem is, given an observed genome A with n copies of each gene, presumed to descend from an n-way polyploidization event from an ordinary diploid genome B, followed by a history of chromosomal rearrangements, to reconstruct the identity of the original genome B. The idea is to construct B, containing exactly one copy of each gene, so as to minimize the number of rearrangements d(A,B⊕ B⊕. .. ⊕ B)necessary to convert the observed genome B⊕ B⊕. .. ⊕ B into A.Results: In this paper we make the first attempt to define and solve the genome aliquoting problem. We present a heuristic algorithm for the problem as well the data from our experiments demonstrating its validity.Conclusions: The heuristic performs well; consistently giving a non-trivial result; The questionas to the existence or non-existence of an exact solution to this problem remains open
Robert Warren David Sankoff
School of Information Technology and Engineering, University of Ottawa, 800 King Edward Avenue, Otta Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Avenue, Ottawa, Cana
国际会议
The 7th Asia-Pacific Bioinformatics Conference(第七届亚太生物信息学大会)
北京
英文
12-21
2009-01-01（万方平台首次上网日期，不代表论文的发表时间）