Finding All sorting tandem duplication random loss operations

Matthias Bernt*, Ming Chiang Chen, Daniel Merkle, Hung Lung Wang, Kun Mao Chao, Martin Middendorf

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

1 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
主出版物標題Combinatorial Pattern Matching - 20th Annual Symposium, CPM 2009, Proceedings
頁面301-313
頁數13
DOIs
出版狀態已發佈 - 2009
對外發佈
事件20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009 - Lille, 法国
持續時間: 2009 六月 222009 六月 24

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5577 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

會議

會議20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009
國家/地區法国
城市Lille
期間2009/06/222009/06/24

ASJC Scopus subject areas

  • 理論電腦科學
  • 電腦科學(全部)

指紋

深入研究「Finding All sorting tandem duplication random loss operations」主題。共同形成了獨特的指紋。

引用此