Finding all sorting tandem duplication random loss operations

详细信息    查看全文

• 作者：Matthias Bernt^a ; ^{bernt@informatik.uni-leipzig.de} ; Kuan-Yu Chen^b ; ^{d94004@csie.ntu.edu.tw} ; Ming-Chiang Chen^b ; ^{d93003@csie.ntu.edu.tw} ; An-Chiang Chu^b ; ^{anchiang@gmail.com} ; Daniel Merkle^c ; ^{daniel@imada.sdu.dk} ; Hung-Lung Wang^b ; ^{r92085@csie.ntu.edu.tw} ; Kun-Mao Chao^b ; ^{kmchao@csie.ntu.edu.tw} ; Martin Middendorf^a ; ^{middendorf@informatik.uni-leipzig.de}
• 关键词：Genome rearrangement ; Tandem duplication random loss ; TDRL ; Permutation
• 刊名：Journal of Discrete Algorithms
• 出版年：2011
• 出版时间：March 2011
• 年：2011
• 卷：9
• 期：1
• 页码：32-48
• 全文大小：552 K

文摘

A tandem duplication random loss (TDRL) operation duplicates a contiguous segment of genes, followed by the random loss of one copy of each of the duplicated genes. Although the importance of this operation is founded by several recent biological studies, it has been investigated only rarely from a theoretical point of view. Of particular interest are sorting TDRLs which are TDRLs that, when applied to a permutation representing a genome, reduce the distance towards another given permutation. The identification of sorting genome rearrangement operations in general is a key ingredient of many algorithms for reconstructing the evolutionary history of a set of species. In this paper we present methods to compute all sorting TDRLs for two given gene orders. In addition, a closed formula for the number of sorting TDRLs is derived and further properties of sorting TDRLs are investigated. It is also shown that the theoretical findings are useful for identifying unique sorting TDRL scenarios for mitochondrial gene orders.