EqualTDRL: illustrating equivalent tandem duplication random loss rearrangements

BackgroundTo 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.ResultsWe 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.ConclusionEqualTDRL 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.

[1]  P. Stadler,et al.  Genetic aspects of mitochondrial genome evolution. , 2013, Molecular phylogenetics and evolution.

[2]  Jens Stoye,et al.  The Solution Space of Sorting by DCJ , 2010, J. Comput. Biol..

[3]  Satish Rao,et al.  On the tandem duplication-random loss model of genome rearrangement , 2006, SODA '06.

[4]  Jens Stoye,et al.  A Unifying View of Genome Rearrangements , 2006, WABI.

[5]  J. Inoue,et al.  Evolution of the deep-sea gulper eel mitochondrial genomes: large-scale gene rearrangements originated within the eels. , 2003, Molecular biology and evolution.

[6]  Matthias Bernt,et al.  Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes , 2018, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[7]  P. Stadler,et al.  MITOS: improved de novo metazoan mitochondrial genome annotation. , 2013, Molecular phylogenetics and evolution.

[8]  Wayne P. Maddison,et al.  Macclade: Analysis of Phylogeny and Character Evolution/Version 3 , 1992 .

[9]  D. Maddison,et al.  MacClade 4: analysis of phy-logeny and character evolution , 2003 .

[10]  Matthias Bernt,et al.  An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree , 2008, RECOMB-CG.

[11]  Adam C. Siepel.  An Algorithm to Enumerate Sorting Reversals for Signed Permutations , 2003, J. Comput. Biol..

[12]  Marie-France Sagot,et al.  Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution , 2008, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[13]  Matthias Bernt,et al.  CREx: inferring genomic rearrangements based on common intervals , 2007, Bioinform..

[14]  Marie-France Sagot,et al.  The Solution Space of Sorting by Reversals , 2007, ISBRA.

[15]  David P. Mindell,et al.  MacClade: Analysis of Phylogeny and Character Evolution. Version 3.0 Wayne P. Maddison David R. Maddison , 1994 .

[16]  Tzvika Hartman,et al.  On the Properties of Sequences of Reversals that Sort a Signed Permutation , 2002 .

[17]  Maria Emilia M. T. Walter,et al.  Reversal Distance of Signed Circular Chromosomes , 2000 .

[18]  D. Sankoff,et al.  Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families" , 2000 .

[19]  David L. Wheeler,et al.  GenBank , 2015, Nucleic Acids Res..

[20]  Tatiana Tatusova,et al.  NCBI Reference Sequence (RefSeq): a curated non-redundant sequence database of genomes, transcripts and proteins , 2004, Nucleic Acids Res..

[21]  J. Boore.  The duplication/random loss model for gene rearrangement exemplified by mitochondrial genomes of deu , 2000 .

[22]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[23]  Sean R. Eddy,et al.  Infernal 1.1: 100-fold faster RNA homology searches , 2013, Bioinform..

[24]  Robert D. Finn,et al.  HMMER web server: interactive sequence similarity searching , 2011, Nucleic Acids Res..

[25]  J. Boore,et al.  Complete mtDNA sequences of two millipedes suggest a new model for mitochondrial gene rearrangements: duplication and nonrandom loss. , 2002, Molecular biology and evolution.

[26]  Kevin P. Johnson,et al.  Mitochondrial phylogenomics and genome rearrangements in the barklice (Insecta: Psocodea). , 2018, Molecular phylogenetics and evolution.

[27]  R. Zardoya,et al.  A hotspot of gene order rearrangement by tandem duplication and random loss in the vertebrate mitochondrial genome. , 2005, Molecular biology and evolution.

[28]  Richard Friedberg,et al.  Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..

[29]  Matthias Bernt,et al.  An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements , 2019, IEEE/ACM Transactions on Computational Biology and Bioinformatics.