Open AccessIdentification of coding and non-coding sequences using local Holder exponent formalism
Author(s) -
Onkar C. Kulkarni,
Vigneshwar Ramakrishnan,
Vaidyanathan Jayaraman,
B. D. Kulkarni
Publication year - 2005
Publication title -
computer applications in the biosciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1460-2059
pISSN - 0266-7061
DOI - 10.1093/bioinformatics/bti639
Subject(s) - coding (social sciences) , exploit , computer science , theoretical computer science , exponent , formalism (music) , scaling law , genome , computational biology , scaling , gene , mathematics , genetics , biology , statistics , geometry , musical , linguistics , art , visual arts , philosophy , computer security
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom