Identification of coding and non-coding sequences using local holder exponent formalism

Kulkarni, Onkar C. ; Vigneshwar, R. ; Jayaraman, Valadi K. ; Kulkarni, Bhaskar D. (2005) Identification of coding and non-coding sequences using local holder exponent formalism Bioinformatics, 21 (20). pp. 3818-3823. ISSN 1367-4803

[img]
Preview
PDF - Publisher Version
180kB

Official URL: http://bioinformatics.oxfordjournals.org/content/2...

Related URL: http://dx.doi.org/10.1093/bioinformatics/bti639

Abstract

Motivation: Accurate prediction of genes in genomes has always been a challenging task for bioinformaticians and computational biologists. The discovery of existence of distinct scaling relations in coding and non-coding sequences has led to new perspectives in the understanding of the DNA sequences. This has motivated us to exploit the differences in the local singularity distributions for characterization and classification of coding and non-coding sequences. Results: The local singularity density distribution in the coding and non-coding sequences of four genomes was first estimated using the wavelet transform modulus maxima methodology. Support vector machines classifier was then trained with the extracted features. The trained classifier is able to provide an average test accuracy of 97.7%. The local singularity features in a DNA sequence can be exploited for successful identification of coding and non-coding sequences.

Item Type:Article
Source:Copyright of this article belongs to Oxford University Press.
ID Code:17219
Deposited On:16 Nov 2010 08:11
Last Modified:17 May 2016 01:53

Repository Staff Only: item control page