Finding genes in DNA using decision trees and dynamic programming.
This study demonstrates the use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programming algorithm that finds the optimal segmentation of a DNA sequence into coding and non-coding regions (exons and introns). The optimality property is dependent on a separate scoring function that takes a subsequence and assigns to it a score reflecting the probability that the sequence is an exon. In this study, the scoring functions were sets of decision trees and rules that were combined to give the probability estimate. Experimental results on a newly collected database of human DNA sequences are encouraging, and some new observations about the structure of classifiers for the gene-finding problem have emerged from this study. We also provide descriptions of a new probability chain model that produces very accurate filters to find donor and acceptor sites.
Salzberg
S
S
Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, USA. salzberg@cs.jhu.edu,ken@gdb.org
Chen
X
X
Henderson
J
J
Fasman
K
K
D000465:Algorithms; D002877:Chromosomes, Human / Q000737:chemistry*; D003663:Decision Trees; D005091:Exons; D015698:Genomic Library; D006801:Humans; D007438:Introns; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software