Skip Navigation



Bioinformatics Advance Access published online on February 5, 2004
Bioinformatics, doi:10.1093/bioinformatics/btg467
Bioinformatics © Oxford University Press 2004; all rights reserved
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
20/5/673    most recent
btg467v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Gao, F.
Right arrow Articles by Zhang, C.-T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Gao, F.
Right arrow Articles by Zhang, C.-T.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Received September 30, 2003
Accepted September 30, 2003

Article

Comparison of various algorithms for recognizing short coding sequences of human genes

Feng Gao 1 Chun-Ting Zhang 1*

1 Department of Physics, Tianjin University, Tianjin 300072, China

* To whom correspondence should be addressed. E-mail: ctzhang{at}tju.edu.cn.


  Abstract

Motivation: Since the early eighties of the twentieth century, there has been great progress in the development of computational gene-finding algorithms. Some problems, however, have not yet been solved currently. Recognizing short genes in prokaryotes and short exons in eukaryotes is one of such problems. The paper is devoted to assessing various algorithms, including those currently available and the new ones proposed here, in order to find the best algorithm to solve the issue.

Results: The databases consisting of phase-specific coding and non-coding sequences of human genes with length of 192, 162, 129, 108, 87, 63 and 42 bp, respectively, have been established. Based on the databases and a standard benchmark, 19 algorithms were evaluated, which include the methods of Markov models with orders of 1 through 5, codon usage, hexamer usage, codon preference, amino acid usage, codon prototype, Fourier transform and eight Z curve methods with various numbers of parameters. Consequently, the Z curve methods with 69 and 189 parameters are the best ones among them, based on the databases constructed here. In addition to the highest recognition accuracy confirmed by tenfold cross-validation tests, the Z curve methods are much simpler computationally than the second best one, the 5th-order Markov chain model, in which 12,288 parameters are used. We hope that the Z curve methods presented in this paper would be beneficial to the further development of gene-finding algorithms.

Availability: The programs of various Z curve methods are available on request.


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
Y. Saeys, P. Rouze, and Y. Van de Peer
In search of the small ones: improved prediction of short exons in vertebrates, plants, fungi and protists
Bioinformatics, February 15, 2007; 23(4): 414 - 420.
[Abstract] [Full Text] [PDF]

Home page
 Brief BioinformHome page
V. Shepelev and A. Fedorov
Advances in the Exon-Intron Database (EID)
Brief Bioinform, June 1, 2006; 7(2): 178 - 185.
[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.