Skip to Main content Skip to Navigation

Approches Combinatoires pour le Consensus d'Arbres et de Séquences

Sylvain Guillemot 1
1 MAB - Méthodes et Algorithmes pour la Bioinformatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : This thesis studies from an algorithmic point of view various consensus methods on collections of labeled objects. The problems under study involve labeled objects without repetition of labels ; these objects may be rooted trees or sequences, with applications to bioinformatics. For instance, the problems on trees considered in this thesis may find applications to the estimation of congruence between phylogenies, the construction of supertrees, and the identification of horizontal gene transfers. For their part, the problems on sequences considered in this thesis have potential applications for the computation of genomic distances based on gene orders. Overall, this work relies on the theories of parameterized complexity and approximability to obtain algorithms and hardness results for the problems studied.
Document type :
Complete list of metadatas
Contributor : Martine Peridier <>
Submitted on : Friday, July 3, 2009 - 11:03:02 AM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 6:00:13 PM


  • HAL Id : tel-00401456, version 1



Sylvain Guillemot. Approches Combinatoires pour le Consensus d'Arbres et de Séquences. Informatique [cs]. Université Montpellier II - Sciences et Techniques du Languedoc, 2008. Français. ⟨tel-00401456⟩



Record views


Files downloads