Locating protein coding regions in human DNA using a decision tree algorithm.
Genes in eukaryotic DNA cover hundreds or thousands of base pairs, while the regions of those genes that code for proteins may occupy only a small percentage of the sequence. Identifying the coding regions is of vital importance in understanding these genes. Many recent research efforts have studied computational methods for distinguishing between coding and noncoding regions, and several promising results have been reported. We describe here a new approach, using a machine learning system that builds decision trees from the data. This approach combines several coding measures to produce classifiers with consistently higher accuracies than previous methods, on DNA sequences ranging from 54 to 162 base pairs in length. The algorithm is very efficient, and it can easily be adapted to different sequence lengths. Our conclusion is that decision trees are a highly effective tool for identifying protein coding regions.
Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, USA.
S
S
Salzberg
D000465:Algorithms; D003062:Codon / Q000235:genetics; D004247:DNA / Q000145:classification / Q000235:genetics*; D003663:Decision Trees; D005091:Exons; D005796:Genes; D006801:Humans; D011506:Proteins / Q000235:genetics*
D003062:Codon; D011506:Proteins; D004247:DNA