The accuracy of promoter recognition depends upon not only the appropriate representation of the promoter sequence but also the essential features of the sequence. These two important issues are addressed in this paper. Firstly, a promoter sequence is captured in form of a Chaos Game Representation (CGR). Then, based on the concept of Mahalanobis distance, a new statistical feature extraction is introduced to select a set of the most significant pixels from the CGR. The recognition is performed by a supervised neural network. This proposed technique achieved 100% accuracy when it is tested with the E.coli promoter sequences using a leave-one-out method. Our approach also outperforms other techniques. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Tinnungwattana, O., & Lursinsap, C. (2006). Statistical feature selection from chaos game representation for promoter recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3992 LNCS-II, pp. 838–845). Springer Verlag. https://doi.org/10.1007/11758525_112
Mendeley helps you to discover research relevant for your work.