Kernel methods for genomic data fusion
published: Oct. 23, 2012, recorded: September 2012, views: 4065
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Despite significant advances in omics techniques, the identification of genes causing rare genetic diseases and the understanding of the molecular networks underlying those disorders remains difficult. Gene prioritization attempts to integrate multiple, heterogeneous data sources to identify candidate genes most likely to be associated with or causative for a disorder. Such strategies are useful both to support clinical genetic diagnosis and to speed up biological discovery. Genomic data fusion algorithms are rapidly maturing statistical and machine learning techniques have emerged that integrate complex, heterogeneous information (such as sequence similarity, interaction networks, expression data, annotation, or biomedical literature) towards prioritization, clustering, or prediction. In this talk, we will focus in particular on kernel methods and will propose several strategies for prioritization and clustering in particular. We also go beyond learning methods as such by addressing how such strategies can be embedded into the daily practice of geneticists, mostly through collaborative knowledge bases that integrate tightly with prioritization and network analysis methods.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !