Candidate gene prioritization by genomic data fusion

author: Yves Moreau, Department of Electrical Engineering, KU Leuven
published: Nov. 20, 2007,   recorded: September 2007,   views: 664
Categories
You might be experiencing some problems with Your Video player.

Slides

Slides
0:00 - Genomic data fusion for candidate gene prioritization - Announcement
1:21 Genomic data fusion for candidate gene prioritization
2:33 Beyond the hairball
4:06 Multisource networks
5:10 Array CGH: from diagnosis to gene discovery
8:08 Deletion del(22) - 1
8:42 Deletion del(22) - 2
10:19 Candidate gene prioritization
13:05 Prioritization by example
15:37 Multiple sources of information
16:59 Data fusion with order statistics
18:25 Training of an attribute submodel
19:41 Training of a vector submodel
20:26 Training of a set submodel
21:17 Other submodels
22:07 Order statistics
24:26 OMIM & GO cross-validation
24:53 Cross-validation
25:34 Rank ROC curves
26:35 Evaluation on monogenic diseases + text model
27:41 Complex disease
27:57 Evaluation on monogenic diseases + text model
28:03 Complex disease
28:49 Endeavour - 1
29:01 Endeavour - 2
29:03 Endeavour - 3
29:08 Endeavour architecture
29:49 DiGeorge candidate
32:14 YPEL1
33:21 Kernel-based novelty detection
34:10 Prioritization as machine learning
35:20 Kernel-based novelty detection - 1
36:36 Kernel-based novelty detection - 2
37:23 Kernel-based novelty detection - 3
38:35 Which representation, which similarity?
39:23 Kernel-based data fusion - 1
40:02 The kernel trick - 1
40:26 The kernel trick - 2
40:37 Kernel-based data fusion - 2
41:21 Kernel-based data fusion - 3
42:10 Kernel-based data fusion - 4
42:37 Global strategy
43:18 Experimental results - 1
44:07 Experimental results - 2
44:52 Experimental results - 3
45:35 Experimental results - 4
45:43 Reflections on prioritization as a machine learning problem
47:39 Prioritization as machine learning
48:05 Learning from a single data point?
49:19 Incremental learning - 1
49:30 Incremental learning - 2
49:38 Incremental learning - 3
49:41 Incremental learning - 4
49:43 Incremental learning - 5
49:48 Incremental learning - 6
50:03 - Questions

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.
 
    Delicious Bibliography

Description

The overwhelming amount of biological data makes the assignment of candidate genes to diseases and biological pathways a formidable challenge. We present ENDEAVOUR, a generally applicable computational methodology to prioritize candidate genes based on their similarity to case-specific reference gene sets. Unlike previous methods, ENDEAVOUR is capable of flexibly utilizing multiple data sets from diverse sources. It allows the modular incorporation of de novo generated data sets and integrates distinct prioritizations into a global ranking by applying order statistics. We first validate the overallperformance in a statistical cross validation of 29 diseases and 3 biological pathways. We validate a novel candidate for DiGeorge syndrome in a zebrafish model and present several new candidates for congenital heart disease. We extend the basic ENDEAVOUR methodology using data from multiple species (human, mouse, rat, drosophila and C. elegans). We also present an alternative machine learning methodology for gene prioritization using kernel methods for novelty detection that outperforms our previous results.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: