Paper Info
Title
Finding All Sorting Tandem Duplication Random Loss Operations
Abstract
A tandem duplication random loss (TDRL) operation duplicates a contiguous segment of genes, followed by the 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.
Year
DOI
Venue
2009
10.1007/978-3-642-02441-2_27
CPM
Keywords
Field
DocType
mitochondrial gene order,contiguous segment,tandem duplication random loss,theoretical finding,theoretical point,closed formula,evolutionary history,tdrl scenario,genome rearrangement operation,gene order,tandem duplication
Genome,Combinatorics,Gene,Gene orders,Computer science,Permutation,Genome rearrangement,Sorting,Computational biology,Tandem exon duplication,Genetics
Conference
Volume
ISSN
Citations 
5577
0302-9743
1
PageRank 
References 
Authors
0.37
11
6
Name
Order
Citations
PageRank
Matthias Bernt17711.06
Ming-chiang Chen2101.85
Daniel Merkle3383.68
Hung-Lung Wang4275.63
Kun-mao Chao583894.05
Martin Middendorf61334161.45