Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow Print PDF (62K) Freely available
Right arrow Supplementary Material
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 (14)
Right arrowRequest Permissions
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Bajic, V. B.
Right arrow Articles by Seah, S. H.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Bajic, V. B.
Right arrow Articles by Seah, S. H.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2003, Vol. 31, No. 13 3560-3563
© 2003 Oxford University Press

Dragon Gene Start Finder identifies approximate locations of the 5' ends of genes

Vladimir B. Bajic* and Seng Hong Seah1

Knowledge Extraction Laboratory 1 Discovery Systems Laboratory, Institute for Infocomm Research, 21 Heng Mui Keng Terrace, Singapore 119613

*To whom correspondence should be addressed. Tel: +65 68748800; Fax: +65 67748056; Email: bajicv{at}i2r.a-star.edu.sg

Recognition of gene starts is a difficult and yet unsolved problem. We present a program, Dragon Gene Start Finder (DGSF), which assesses the gene start in mammalian genomes and predicts a region which should overlap with the first exon of the gene or be in its proximity. The program has been rigorously tested on human chromosomes 4, 21 and 22, and in a strand specific search achieves an overall sensitivity of ~65% and a positive predictive value of ~78%. The sensitivity for the CpG-island related promoters is >88%. DGSF is free for academic and non-profit users at http://sdmc.lit.org.sg/promoter/dragonGSF1_0/genestart.htm; the download version of the program integrated within the TRANSPLORERTM package can be obtained from Biobase GmbH, at http://www.biobase.de/.


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
 Brief Funct Genomic ProteomicHome page
L. Narlikar and I. Ovcharenko
Identifying regulatory elements in eukaryotic genomes
Brief Funct Genomic Proteomic, June 4, 2009; (2009) elp014v1.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
R. H. Brown, S. S. Gross, and M. R. Brent
Begin at the beginning: Predicting genes with 5' UTRs
Genome Res., May 1, 2005; 15(5): 742 - 747.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
S. Burden, Y.-X. Lin, and R. Zhang
Improving promoter prediction Improving promoter prediction for the NNPP2.2 algorithm: a case study using Escherichia coli DNA sequences
Bioinformatics, March 1, 2005; 21(5): 601 - 607.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
H. Pan, L. Zuo, V. Choudhary, Z. Zhang, S. H. Leow, F. T. Chong, Y. Huang, V. W. S. Ong, B. Mohanty, S. L. Tan, et al.
Dragon TF Association Miner: a system for exploring transcription factor associations through text-mining
Nucleic Acids Res., July 1, 2004; 32(suppl_2): W230 - W234.
[Abstract] [Full Text] [PDF]

Home page
 Cold Spring Harb Symp Quant BiolHome page
M.Q. ZHANG
Prediction, Annotation, and Analysis of Human Promoters
Cold Spring Harb Symp Quant Biol, January 1, 2003; 68(0): 217 - 226.
[Abstract] [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.