By Topic

A graph algorithm for extracting features from transcription factor binding sites

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chunmei Liu ; Dept. of Systems and Computer Science, Howard University, Washington DC, 20059 ; Junfeng Qu ; Yinglei Song ; Anietie U. Andy

Transcription factors play important roles in gene regulation. An accurate model that can describe the binding site of a transcription factor in the promoter region of a gene is thus the key for understanding the regulation of the gene. In this paper, we develop a new graph theoretical approach that can efficiently extract features from the binding sites of a transcription factor. These features contain the dependencies among different positions in the binding site and thus can provide a more accurate description of binding sites than models based on the conventional position specific scoring matrix (PSSM). Based on these features, statistical models can be constructed to describe the binding sites of a transcriptional factor. Our testing results showed that models constructed with our approach can find important features for binding sites and achieve significantly improved accuracy for predicting the locations of binding sites in DNA genomes.

Published in:

Bioinformatics and Biomedicine Workshop, 2009. BIBMW 2009. IEEE International Conference on

Date of Conference:

1-4 Nov. 2009