DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2013.76
Sanjeev N. Sharma , Samrat Ashok Technological Institute, Vidisha
Rajiv Saxena , Jaypee University of Engineering and Technology, Raghogarh, Guna
Devendra K. Shakya , Samrat Ashok Technological Institute, Vidisha
Signal processing based algorithms for identification of coding sequences (CDS) in eukaryotes are non-data driven, and exploit the presence of three-base periodicity in these regions for their detection. Three-base periodicity is commonly detected using Short Time Fourier Transform (STFT) that uses a window function of fixed length. As the length of the protein coding and non-coding regions varies widely, the identification accuracy of STFT-based algorithms is poor. In this paper, a novel signal processing based algorithm is developed by enabling the window length adaptation in STFT of DNA sequences for improving the identification of three-base periodicity. The length of window function has been made adaptive in coding regions to maximize the magnitude of period-3 measure, whereas in the non-coding regions the window length is tailored to minimize this measure. Simulation results on bench mark data sets demonstrate the advantage of this algorithm when compared with other non-data driven methods for CDS prediction.
Signal processing, Bioinformatics (genome or protein) databases
Sanjeev N. Sharma, Rajiv Saxena, Devendra K. Shakya, "An Adaptive Window Length Strategy For Eukaryotic CDS Prediction", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. , no. , pp. 0, 5555, doi:10.1109/TCBB.2013.76