Skip Navigation


Bioinformatics Advance Access originally published online on September 25, 2006
Bioinformatics 2006 22(22):2722-2728; doi:10.1093/bioinformatics/btl482
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
22/22/2722    most recent
btl482v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Xie, X.
Right arrow Articles by Yan, H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Xie, X.
Right arrow Articles by Yan, H.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

PromoterExplorer: an effective promoter identification method based on the AdaBoost algorithm

Xudong Xie 1,2, Shuanhu Wu 1,3, Kin-Man Lam 4 and Hong Yan 1,5,*

1 Department of Electronic Engineering, City University of Hong Kong Hong Kong
2 Department of Electronic Engineering, Tsinghua University Beijing, China
3 School of Computer Science and Technology, Yantai University China
4 Department of Electronic and Information Engineering, The Hong Kong Polytechnic University Hong Kong
5 School of Electronic and Information Engineering, University of Sydney NSW 2006, Australia

*To whom correspondence should be addressed.

Motivation: Promoter prediction is important for the analysis of gene regulations. Although a number of promoter prediction algorithms have been reported in literature, significant improvement in prediction accuracy remains a challenge. In this paper, an effective promoter identification algorithm, which is called PromoterExplorer, is proposed. In our approach, we analyze the different roles of various features, that is, local distribution of pentamers, positional CpG island features and digitized DNA sequence, and then combine them to build a high-dimensional input vector. A cascade AdaBoost-based learning procedure is adopted to select the most ‘informative’ or ‘discriminating’ features to build a sequence of weak classifiers, which are combined to form a strong classifier so as to achieve a better performance. The cascade structure used for identification can also reduce the false positive.

Results: PromoterExplorer is tested based on large-scale DNA sequences from different databases, including the EPD, DBTSS, GenBank and human chromosome 22. Experimental results show that consistent and promising performance can be achieved.

Contact: h.yan{at}cityu.edu.hk


Received on July 12, 2006; revised on August 28, 2006; accepted on September 11, 2006

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
T. Abeel, Y. Saeys, P. Rouze, and Y. Van de Peer
ProSOM: core promoter prediction based on unsupervised clustering of DNA physical profiles
Bioinformatics, July 1, 2008; 24(13): i24 - i31.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
T. Abeel, Y. Saeys, E. Bonnet, P. Rouze, and Y. Van de Peer
Generic eukaryotic core promoter prediction using structural features of DNA
Genome Res., February 1, 2008; 18(2): 310 - 323.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.