Suppr超能文献

EqualTDRL:说明等效串联重复随机丢失重排。

EqualTDRL: illustrating equivalent tandem duplication random loss rearrangements.

机构信息

Swarm Intelligence and Complex Systems Group, Faculty of Mathematics and Computer Science, Leipzig University, Augustusplatz 10, Leipzig, D-04109, Germany.

Helmholtz Centre for Environmental Research - UFZ, Permoserstraße 15, Leipzig, D-04318, Germany.

出版信息

BMC Bioinformatics. 2018 May 30;19(1):192. doi: 10.1186/s12859-018-2170-x.

Abstract

BACKGROUND

To study the differences between two unichromosomal circular genomes, e.g., mitochondrial genomes, under the tandem duplication random loss (TDRL) rearrangement it is important to consider the whole set of potential TDRL rearrangement events that could have taken place. The reason is that for two given circular gene orders there can exist different TDRL rearrangements that transform one of the gene orders into the other. Hence, a TDRL event cannot always be reconstructed only from the knowledge of the circular gene order before a TDRL event and the circular gene order after it.

RESULTS

We present the program EqualTDRL that computes and illustrates the complete set of TDRLs for pairs of circular gene orders that differ by only one TDRL. EqualTDRL considers the circularity of the given genomes and certain restrictions on the TDRL rearrangements. Examples for the latter are sequences of genes that have to be conserved during a TDRL or pairs of genes that frame intergenic regions which might represent remnants of duplicated genes. Additionally, EqualTDRL allows to determine the set of TDRLs that are minimum with respect to the number of duplicated genes.

CONCLUSION

EqualTDRL supports scientists to study the complete set of TDRLs that possibly could have taken place in the evolution of mitochondrial genomes. EqualTDRL is implemented in C++ using the ggplot2 package of the open source programming language R and is freely available from http://pacosy.informatik.uni-leipzig.de/equaltdrl .

摘要

背景

在串联重复随机丢失(TDRL)重排的情况下,研究两个单染色体环状基因组(例如线粒体基因组)之间的差异,重要的是要考虑可能发生的整套潜在 TDRL 重排事件。原因是对于两个给定的环状基因顺序,可以存在将一个基因顺序转换为另一个基因顺序的不同 TDRL 重排。因此,TDRL 事件不能仅从 TDRL 事件之前和之后的环状基因顺序的知识来重建。

结果

我们提出了程序 EqualTDRL,该程序计算并说明了仅通过一个 TDRL 差异的两个环状基因顺序的完整 TDRL 集。EqualTDRL 考虑了给定基因组的环状性以及 TDRL 重排的某些限制。后者的示例是在 TDRL 期间必须保留的基因序列或框定基因间区域的基因对,这些区域可能代表复制基因的残余物。此外,EqualTDRL 允许确定相对于重复基因数量最小的 TDRL 集。

结论

EqualTDRL 支持科学家研究可能在线粒体基因组进化中发生的完整 TDRL 集。EqualTDRL 是使用开源编程语言 R 的 ggplot2 包在 C++中实现的,可从 http://pacosy.informatik.uni-leipzig.de/equaltdrl 免费获得。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/85dd/5975268/76d946434fe3/12859_2018_2170_Fig1_HTML.jpg

相似文献

1
EqualTDRL: illustrating equivalent tandem duplication random loss rearrangements.
BMC Bioinformatics. 2018 May 30;19(1):192. doi: 10.1186/s12859-018-2170-x.
2
Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes.
IEEE/ACM Trans Comput Biol Bioinform. 2018 Jan-Feb;15(1):83-95. doi: 10.1109/TCBB.2016.2613522. Epub 2016 Sep 26.
3
CREx: inferring genomic rearrangements based on common intervals.
Bioinformatics. 2007 Nov 1;23(21):2957-8. doi: 10.1093/bioinformatics/btm468. Epub 2007 Sep 25.
5
A hotspot of gene order rearrangement by tandem duplication and random loss in the vertebrate mitochondrial genome.
Mol Biol Evol. 2006 Jan;23(1):227-34. doi: 10.1093/molbev/msj025. Epub 2005 Sep 21.

引用本文的文献

本文引用的文献

1
An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements.
IEEE/ACM Trans Comput Biol Bioinform. 2019 Jan-Feb;16(1):52-62. doi: 10.1109/TCBB.2018.2831661. Epub 2018 Apr 30.
2
Mitochondrial phylogenomics and genome rearrangements in the barklice (Insecta: Psocodea).
Mol Phylogenet Evol. 2018 Feb;119:118-127. doi: 10.1016/j.ympev.2017.10.014. Epub 2017 Oct 24.
3
Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes.
IEEE/ACM Trans Comput Biol Bioinform. 2018 Jan-Feb;15(1):83-95. doi: 10.1109/TCBB.2016.2613522. Epub 2016 Sep 26.
4
GenBank.
Nucleic Acids Res. 2017 Jan 4;45(D1):D37-D42. doi: 10.1093/nar/gkw1070. Epub 2016 Nov 28.
5
Infernal 1.1: 100-fold faster RNA homology searches.
Bioinformatics. 2013 Nov 15;29(22):2933-5. doi: 10.1093/bioinformatics/btt509. Epub 2013 Sep 4.
6
Genetic aspects of mitochondrial genome evolution.
Mol Phylogenet Evol. 2013 Nov;69(2):328-38. doi: 10.1016/j.ympev.2012.10.020. Epub 2012 Nov 7.
7
MITOS: improved de novo metazoan mitochondrial genome annotation.
Mol Phylogenet Evol. 2013 Nov;69(2):313-9. doi: 10.1016/j.ympev.2012.08.023. Epub 2012 Sep 7.
8
HMMER web server: interactive sequence similarity searching.
Nucleic Acids Res. 2011 Jul;39(Web Server issue):W29-37. doi: 10.1093/nar/gkr367. Epub 2011 May 18.
9
The solution space of sorting by DCJ.
J Comput Biol. 2010 Sep;17(9):1145-65. doi: 10.1089/cmb.2010.0109.
10
Exploring the solution space of sorting by reversals, with experiments and an application to evolution.
IEEE/ACM Trans Comput Biol Bioinform. 2008 Jul-Sep;5(3):348-56. doi: 10.1109/TCBB.2008.16.

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验