Evènement pour le groupe BioInformatique et Visualisation
|Date|| 2015-10-15 11:00-12:30|
|Titre||All [I know] about common and conserved nested intervals |
|Résumé||In this talk I will first recall the notion of common and conserved intervals or permutations. Then I will explain how to easily compute gene clusters formalized by generalized nested common or conserved intervals between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of size |I| is either an interval of size 1 or contains another b-nested common (resp. conserved) interval of size at least |I|-b. When b=1, this corresponds to the original notion of nested interval. I will exhibit two simple algorithms to output all b-nested common or conserved intervals between K permutations in O(Kn+nocc) time, where nocc is the total number of such intervals. I will eventually explain how to count all b-nested intervals in O(Kn) time.
Joint work with Fabien de Mongolfier (LIAFA, Paris-7) and Irena Rusu (LINA, Univ. of Nantes). |
|Lieu||salle 178, LaBRI |
|Orateur||Mathieu Raffinot |
Aucun document lié à cet événement.RetourRetour à l'index