BMC Genomics | |
Genomic duplication problems for unrooted gene trees | |
Proceedings | |
Jarosław Paszek1  Paweł Górecki1  | |
[1] University of Warsaw, Institute of Informatics, Banacha 2, 02-097, Warsaw, Poland; | |
关键词: Genomic duplication; Duplication episode; Reconciliation; Unrooted gene tree; Species tree; | |
DOI : 10.1186/s12864-015-2308-4 | |
来源: Springer | |
【 摘 要 】
BackgroundDiscovering the location of gene duplications and multiple gene duplication episodes is a fundamental issue in evolutionary molecular biology. The problem introduced by Guigó et al. in 1996 is to map gene duplication events from a collection of rooted, binary gene family trees onto theirs corresponding rooted binary species tree in such a way that the total number of multiple gene duplication episodes is minimized. There are several models in the literature that specify how gene duplications from gene families can be interpreted as one duplication episode. However, in all duplication episode problems gene trees are rooted. This restriction limits the applicability, since unrooted gene family trees are frequently inferred by phylogenetic methods.ResultsIn this article we show the first solution to the open problem of episode clustering where the input gene family trees are unrooted. In particular, by using theoretical properties of unrooted reconciliation, we show an efficient algorithm that reduces this problem into the episode clustering problems defined for rooted trees. We show theoretical properties of the reduction algorithm and evaluation of empirical datasets.ConclusionsWe provided algorithms and tools that were successfully applied to several empirical datasets. In particular, our comparative study shows that we can improve known results on genomic duplication inference from real datasets.
【 授权许可】
CC BY
© Paszek and Górecki. 2015
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO202311093481219ZK.pdf | 1036KB | download | |
12864_2017_3487_Article_IEq58.gif | 1KB | Image | download |
12864_2017_3655_Article_IEq6.gif | 1KB | Image | download |
12864_2017_3492_Article_IEq18.gif | 1KB | Image | download |
12864_2017_3492_Article_IEq20.gif | 1KB | Image | download |
12864_2017_4320_Article_IEq2.gif | 1KB | Image | download |
12864_2017_4227_Article_IEq1.gif | 1KB | Image | download |
12864_2017_4269_Article_IEq5.gif | 1KB | Image | download |
12864_2017_4269_Article_IEq6.gif | 1KB | Image | download |
12864_2017_3655_Article_IEq12.gif | 1KB | Image | download |
12864_2017_3655_Article_IEq14.gif | 1KB | Image | download |
12864_2017_3742_Article_IEq1.gif | 1KB | Image | download |
12864_2017_3655_Article_IEq16.gif | 1KB | Image | download |
12864_2017_3601_Article_IEq1.gif | 1KB | Image | download |
12864_2017_3655_Article_IEq17.gif | 1KB | Image | download |
12864_2017_3821_Article_IEq4.gif | 1KB | Image | download |
12864_2016_3440_Article_IEq23.gif | 1KB | Image | download |
12864_2015_2198_Article_IEq28.gif | 1KB | Image | download |
12864_2017_3655_Article_IEq21.gif | 1KB | Image | download |
12864_2015_2198_Article_IEq30.gif | 1KB | Image | download |
【 图 表 】
12864_2015_2198_Article_IEq30.gif
12864_2017_3655_Article_IEq21.gif
12864_2015_2198_Article_IEq28.gif
12864_2016_3440_Article_IEq23.gif
12864_2017_3821_Article_IEq4.gif
12864_2017_3655_Article_IEq17.gif
12864_2017_3601_Article_IEq1.gif
12864_2017_3655_Article_IEq16.gif
12864_2017_3742_Article_IEq1.gif
12864_2017_3655_Article_IEq14.gif
12864_2017_3655_Article_IEq12.gif
12864_2017_4269_Article_IEq6.gif
12864_2017_4269_Article_IEq5.gif
12864_2017_4227_Article_IEq1.gif
12864_2017_4320_Article_IEq2.gif
12864_2017_3492_Article_IEq20.gif
12864_2017_3492_Article_IEq18.gif
12864_2017_3655_Article_IEq6.gif
12864_2017_3487_Article_IEq58.gif
【 参考文献 】
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]
- [25]
- [26]
- [27]
- [28]
- [29]
- [30]
- [31]
- [32]
- [33]
- [34]
- [35]
- [36]
- [37]
- [38]
- [39]
- [40]