An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree

Given the mitochondrial gene orders and the phylogenetic relationship of a set of unichromosomal taxa, we study the problem of finding a plausible and parsimonious assignment of genomic rearrangement events to the edges of the given phylogenetic tree. An algorithm called algorithm TreeREx (tree rearrangement explorer) is proposed for solving this problem heuristically. TreeREx is based on an extended version of algorithm CREx (common interval rearrangement explorer, [4]) that heuristically computes pairwise rearrangement scenarios for gene order data. As phylogenetic events in such scenarios reversals, transpositions, reverse transpositions, and tandem duplication random loss (TDRL) operations are considered. CREx can detect such events as patterns in the signed strong interval tree, a data structure representing gene groups that appear consecutively in a set of two gene orders. TreeREx then tries to assign events to the edges of the phylogenetic tree, such that the pairwise scenarios are reflected on the paths of the tree. It is shown that TreeREx can automatically infer the events and the ancestral gene orders for realistic biological examples of mitochondrial gene orders. In an analysis of gene order data for teleosts, algorithm TreeREx is able to identify a yet undocumented TDRL towards species Bregmaceros nectabanus.

[1]  Alberto Caprara.  The Reversal Median Problem , 2003, INFORMS J. Comput..

[2]  Jens Stoye,et al.  Algorithms for Finding Gene Clusters , 2001, WABI.

[3]  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.

[4]  Takeaki Uno,et al.  Fast Algorithms to Enumerate All Common Intervals of Two Permutations , 1997, Algorithmica.

[5]  D. Littlewood,et al.  The interrelationships of the echinoderm classes: morphological and molecular evidence , 1997 .

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

[7]  D. Sankoff,et al.  Gene Order Breakpoint Evidence in Animal Mitochondrial Phylogeny , 1999, Journal of Molecular Evolution.

[8]  Hao Zhao,et al.  Recovering True Rearrangement Events on Phylogenetic Trees , 2007, RECOMB-CG.

[9]  Stefano Leonardi,et al.  Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.

[10]  A. Arndt,et al.  Mitochondrial gene rearrangement in the sea cucumber genus Cucumaria. , 1998, Molecular biology and evolution.

[11]  Rita Casadio,et al.  Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, WABI.

[12]  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.

[13]  Laxmi Parida,et al.  Using PQ Structures for Genomic Rearrangement Phylogeny , 2006, J. Comput. Biol..

[14]  D Sankoff,et al.  Analytical approaches to genomic evolution. , 1993, Biochimie.

[15]  J. Inoue,et al.  Major patterns of higher teleostean phylogenies: a new perspective based on 100 complete mitochondrial DNA sequences. , 2003, Molecular phylogenetics and evolution.

[16]  Michael J. Smith,et al.  Complete mitochondrial genome DNA sequence for two ophiuroids and a holothuroid: the utility of protein gene sequence and gene maps in the analyses of deep deuterostome phylogeny. , 2004, Molecular phylogenetics and evolution.

[17]  P. Stadler,et al.  Evolution of Mitochondrial Gene Orders in Echinoderms , 2022 .

[18]  C. Paul,et al.  Perfect Sorting by Reversals Is Not Always Difficult , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

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

[20]  Mathieu Raffinot,et al.  Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs , 2005, ESA.

[21]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..