Due to the non-uniform distribution of codons in coding regions, a three-periodicity is present in most of genome coding regions which, after a previous numeric conversion, show a notable peak at frequency component N/3 when calculating the Fourier Transform. Taking into account the veracity of this result, the Short Time Fourier Transform has been applied to large DNA sequences to predict coding regions. This paper presents a new approach to reduce the computational burden associated with STFT computation, for coding regions detection purposes. Experimental results show significant savings in computation time when the proposed algorithm is employed.

Identifying protein coding regions in DNA sequences is a basic step in the location of genes. Several approaches based on signal processing tools have been applied to solve this problem, trying to achieve more accurate predictions. This paper presents a new predictor that improves the efficacy of three ones that use the Fourier Transform to predict coding regions, and that could be computed using an algorithm that reduces the computation load. ROC curves are used to demonstrate the efficacy of the proposed predictor, based on the computation of 25 DNA sequences from three different organisms.

No abstract

No abstract