05.11.2012 Views

Abstracts Keynote & Plenary

Abstracts Keynote & Plenary

Abstracts Keynote & Plenary

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

conformations may convert to each other via phosphorylation and dephosphrylation.<br />

[1] Nathaniel J. Traaseth, Lei Shi, Raffaello Verardi et al. PNAS 2009 106 10165<br />

[2] Becucci L, Cembran A, Karim CB et al. Biophys J. 2009 96 L60<br />

[3] Kim T, Lee J. Im W Proteins 2009 76 86<br />

PO-036<br />

Support vector machines for identification of DNA-binding residues in proteins using<br />

a hybrid feature<br />

Yi Xiong1,2, Juan Liu1<br />

and Dong-Qing Wei2<br />

1School of Computer, Wuhan University, Wuhan<br />

430079<br />

2 College of Life Science and Biotechnology, Shanghai Jiaotong<br />

University, Shanghai<br />

200240<br />

Protein–DNA<br />

interactions are crucial for a variety of essential biological activities. An automatic and<br />

reliable identification of DNA-binding residues in DNA-binding proteins is important for site-directed<br />

mutagenesis and functional annotation. Toward this end, a pattern recognition method can be<br />

developed using the distinguished features derived from the increasing number of determined<br />

structures of protein–DNA complexes in Protein Data Bank. Here, we developed a series of classifiers<br />

using support vector machines to identify DNA-binding residues in proteins with different<br />

combinations of various features, which are comprised of evolutionary information of the amino acid<br />

sequence, residue solvent accessibility, electrostatic potential and secondary structure. In addition, we<br />

designed a heuristic undersampling scheme for preprocessing the training datasets and a novel<br />

encoding strategy for the solvent accessibility feature. Our results indicate that the best classification<br />

performance was obtained by a SVM classifier that utilizes a combination of evolutionary information,<br />

residue solvent accessibility and second structure information. Finally, we applied our method in a<br />

dataset of 62 protein–DNA complexes in comparison with other published studies. The observation<br />

suggests that our method achieved a higher performance with an overall accuracy 84.5% on a 10-fold<br />

cross validation test.<br />

Keywords: Protein–DNA<br />

Interaction; DNA-binding Residue; Support Vector Machine<br />

PO-037<br />

Inferring gene regulatory networks from ChIP-chip, TF knock-out and expression data<br />

Lihua Jiang and Qi Liu<br />

Department of Bioinformatics<br />

and Biostatistics, College of Life Sciences and Biotechnology, Shanghai<br />

Jiao Tong University, Shanghai, P. R. China, 200240<br />

Uncovering the underlying regulatory mechanism remains<br />

a challenge in bioinformatics<br />

studies. With the availability of various kinds of high-throughput biological data,<br />

researchers are trying to reconstruct the gene regulatory networks on a genomic scale.<br />

Since each single data source provides only partial and complementary information of the<br />

regulatory relationships, combining diverse data sources is expected to get more reliable<br />

networks.<br />

Here we present<br />

a method to infer the regulatory networks by combining ChIP-chip, TF (transcription<br />

factor) knock-out and expression data. Our method is the first approach to combine these three kinds of<br />

data. ChIP-chip and TF knock-out data provide direct and complementary evidence on transcriptional<br />

regulation. We use these two kinds of data to find the core regulatory module and then we refine the<br />

module by the indirect evidence inferred from the expression data. The results are validated by the<br />

YEASTRACT, high quality ChIP-chip datasets, literatures and Gene Ontology enrichment analysis.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!