Email updates

Keep up to date with the latest news and content from BMC Bioinformatics and BioMed Central.

This article is part of the supplement: Seventh International Conference on Bioinformatics (InCoB2008)

Open Access Research

Extracting transcription factor binding sites from unaligned gene sequences with statistical models

Chung-Chin Lu1, Wei-Hao Yuan2 and Te-Ming Chen1*

Author Affiliations

1 Department of Electrical Engineering, National Tsing Hua University, Hsinchu 30013, Taiwan

2 Alpha Imaging Technology Corp., Jubei City, Hsinchu 302, Taiwan

For all author emails, please log on.

BMC Bioinformatics 2008, 9(Suppl 12):S7  doi:10.1186/1471-2105-9-S12-S7

Published: 12 December 2008

Abstract

Background

Transcription factor binding sites (TFBSs) are crucial in the regulation of gene transcription. Recently, chromatin immunoprecipitation followed by cDNA microarray hybridization (ChIP-chip array) has been used to identify potential regulatory sequences, but the procedure can only map the probable protein-DNA interaction loci within 1–2 kb resolution. To find out the exact binding motifs, it is necessary to build a computational method to examine the ChIP-chip array binding sequences and search for possible motifs representing the transcription factor binding sites.

Results

We developed a program to find out accurate motif sites from a set of unaligned DNA sequences in the yeast genome. Compared with MDscan, the prediction results suggest that, overall, our algorithm outperforms MDscan since the predicted motifs are more consistent with previously known specificities reported in the literature and have better prediction ranks. Our program also outperforms the constraint-less Cosmo program, especially in the elimination of false positives.

Conclusion

In this study, an improved sampling algorithm is proposed to incorporate the binomial probability model to build significant initial candidate motif sets. By investigating the statistical dependence between base positions in TFBSs, the method of dependency graphs and their expanded Bayesian networks is combined. The results show that our program satisfactorily extract transcription factor binding sites from unaligned gene sequences.