DFT based DNA splicing algorithms for prediction of protein coding regions

Identifying protein coding regions in DNA sequences is a fundamental step in computational recognition of genes. Traditional Discrete Fourier transform (DFT) based approaches exploit the empirical observation that the spectrum of protein coding DNA of length N nucleotides has a peak at frequency k=N/3 corresponding to the length of a DNA codon. In this paper, we prove the aforementioned and several other empirical observations attributed to DNA sequences. Our analytical results lead to faster and more accurate DFT-based algorithms for predicting coding regions. Further, our algorithm requires no prior training.