Title :
Combining Gene-Finding Programs by Using Dempster-Shafer Theory of Evidence for Gene Prediction
Author :
Weng, Yang ; Zhu, Yunmin
Author_Institution :
Dept. of Math., Sichuan Univ., Chengdu
Abstract :
Although the computational gene-finding programs have been greatly improved in recent years, our ultimate goal is far to be met. Even the best program cannot be used automatically to identify genes and other genomic elements. Fortunately, there are only a tiny number of exons completely missed by all programs. Therefore the combination of predictions from the gene-finding programs is a convenient way to improve gene prediction. In this paper we motivate the use of the Dempster-Shafer theory of evidence as an appropriate theory for modelling combination of gene predictions, and give the mathematical framework for combining gene predictions of gene-finding programs by using Dempster-Shafer combination rule. The most notable strength of our method lies in the fact that we can combine results of multiple gene-finding programs, in which each of them has provided reliable exon scores. In comparison with an individual program, our method proves an improvement of predictive accuracy both on nucleotide level and exon level, the exon level in particular
Keywords :
biology computing; case-based reasoning; genetics; Dempster-Shafer theory; evidence theory; gene prediction; gene-finding program; mathematical framework; Accuracy; Bioinformatics; Biology; Genomics; Hidden Markov models; Mathematical model; Mathematics; Predictive models; Sensitivity and specificity; Sequences;
Conference_Titel :
Computational Intelligence and Security, 2006 International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
1-4244-0605-6
Electronic_ISBN :
1-4244-0605-6
DOI :
10.1109/ICCIAS.2006.294118