Please use this identifier to cite or link to this item:
Title: DREAM2 challenge: Integrated multi-array supervised learning algorithm for BCL6 transcriptional targets prediction
Authors: Lee, W.H.
Narang, V.
Xu, H.
Lin, F.
Chin, K.C.
Sung, W.K. 
Keywords: BCL6
Gene targets
Supervised learning
Issue Date: 2009
Citation: Lee, W.H., Narang, V., Xu, H., Lin, F., Chin, K.C., Sung, W.K. (2009). DREAM2 challenge: Integrated multi-array supervised learning algorithm for BCL6 transcriptional targets prediction. Annals of the New York Academy of Sciences 1158 : 196-204. ScholarBank@NUS Repository.
Abstract: In the Dialogue for Reverse Engineering Assessments and Methods Conference (DREAM2) BCL6 target identification challenge, we were given a list of 200 genes and tasked to identify which ones are the true targets of BCL6 using an independent panel of gene-expression data. Initial efforts using conventional motif-scanning approaches to find BCL6 binding sites in the promoters of the 200 genes as a means of identifying BCL6 true targets proved unsuccessful. Instead, we performed a large-scale comparative study of multiple expression data under different conditions. Specifically, we employed a supervised learning approach that learns and models the expression patterns under different conditions and controls from a training collection of known BCL6 targets and randomly chosen decoys. Genes in the given list whose expression matches well with that of the training set of known BCL6 targets are more likely to be BCL6 targets. Using this approach, we are able to identify BCL6 targets with high accuracy, making us joint best performers of the challenge. © 2009 New York Academy of Sciences.
Source Title: Annals of the New York Academy of Sciences
ISBN: 9781573317511
ISSN: 00778923
DOI: 10.1111/j.1749-6632.2008.03755.x
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 29, 2019

Page view(s)

checked on Dec 29, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.