An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree
- Cite this paper as:
- Bernt M., Merkle D., Middendorf M. (2008) An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree. In: Nelson C.E., Vialette S. (eds) Comparative Genomics. RECOMB-CG 2008. Lecture Notes in Computer Science, vol 5267. Springer, Berlin, Heidelberg
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, ) 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.
Unable to display preview. Download preview PDF.