Skip to Main content Skip to Navigation
Conference papers

Preserving Inversion Phylogeny Reconstruction

Matthias Bernt 1 Kun-Mao Chao 2 Jyun-Wei Kao 2 Martin Middendorf 1 Eric Tannier 3, 4 
4 BEAGLE - Artificial Evolution and Computational Biology
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information, Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
Abstract : Tractability results are rare in the comparison of gene orders for more than two genomes. Here we present a linear-time algorithm for the small parsimony problem (inferring ancestral genomes given a phylogeny on an arbitrary number of genomes) in the case gene orders are permutations, that evolve by inversions not breaking common gene intervals, and these intervals are organised in a linear structure. We present two examples where this allows to reconstruct the ancestral gene orders in phylogenies of several γ-Proteobacteria species and Burkholderia strains, respectively.We prove in addition that the large parsimony problem (where the phylogeny is output) remains NP-complete.
Complete list of metadata
Contributor : Eric Tannier Connect in order to contact the contributor
Submitted on : Tuesday, September 18, 2012 - 10:52:53 AM
Last modification on : Monday, May 16, 2022 - 3:00:06 PM



Matthias Bernt, Kun-Mao Chao, Jyun-Wei Kao, Martin Middendorf, Eric Tannier. Preserving Inversion Phylogeny Reconstruction. WABI 2012 - 12th International Workshop on Algorithms in Bioinformatics, Sep 2012, Ljubljana, Slovenia. pp.1-13, ⟨10.1007/978-3-642-33122-0_1⟩. ⟨hal-00733188⟩



Record views