Locating Protein Coding Regions in Human DNA Using a Decision Tree Algorithm

Research output: Contribution to journalArticlepeer-review

44 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)473-485
Number of pages13
JournalJournal of Computational Biology
Issue number3
StatePublished - 1995


  • coding regions
  • decision trees
  • exons
  • machine learning

ASJC Scopus subject areas

  • Modeling and Simulation
  • Molecular Biology
  • Genetics
  • Computational Mathematics
  • Computational Theory and Mathematics


Dive into the research topics of 'Locating Protein Coding Regions in Human DNA Using a Decision Tree Algorithm'. Together they form a unique fingerprint.

Cite this