ou mois
aucune période

Tous les thèmes

Voir les thèses

Voir les colloques

Voir les autres événements

Voir la page des groupes

Accéder à l'intranet

Algorithmic and Compact Data Structures for NGR and NGS
du groupe BioInformatique et Visualisation

Date 2012-12-13  11:00-12:00
TitreAlgorithmic and Compact Data Structures for NGR and NGS 
RésuméIn this talk, we will address two different topics. In a first part, we will present some algorithmic results on the "Next Generation Radiotherapies". Radiation therapy is one of the commonly used cancer therapies. The radiation treatment poses a tuning problem: the radiation needs to be effective enough to destroy the tumor, but it should maintain the functionality of the organs close to the tumor (organs at risk). Towards this goal, the design of radiation treatment has to be customized for each patient. We will mainly focus on Intensity Modulated Radiation Therapy using Multi-Leaf Collimator and on Brachytherapy and give some algorithmic results we recently achieved. In a second part, we will present the succinct data structure of wavelet tree and its usefulness for "Next Generation Sequencing". Wavelet tree is a succinct data structure used to efficiently store strings over an alphabet sigma in compressed space that support Access(x), Rank(y,x) and Select(y,x) operations in O(log(|sigma|)) time. Access(x) returns the character at position x while Rank(y,x) returns the number of occurences of character y before position x. Finally, Select(y,x) returns the position of the xth occurence of character y. After presenting the basics of wavelet trees, we will show how it can be used to efficiently index reads for assembly purpose. 
OrateurGuillaume Blin 

Aucun document lié à cet événement.

Retour à l'index