Feature Selection for the Promoter Recognition and Prediction Problem

View Sample PDF

Author(s): George Potamias (Institute of Computer Science, FORTH, Greece)and Alexandros Kanterakis (Institute of Computer Science, FORTH, Greece)
Copyright: 2008
Pages: 15
Source title: Data Warehousing and Mining: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-59904-951-9.ch132

Keywords: Data Mining and Databases / Data Warehousing / Information Science Reference / Library & Information Science

Purchase

View Feature Selection for the Promoter Recognition and Prediction Problem on the publisher's website for pricing and purchasing information.

Abstract

With the completion of various whole genomes, one of the fundamental bioinformatics tasks is the identification of functional regulatory regions, such as promoters, and the computational discovery of genes from the produced DNA sequences. Confronted with huge amounts of DNA sequences, the utilization of automated computational sequence analysis methods and tools is more than demanding. In this article, we present an efficient feature selection to the promoter recognition, prediction, and localization problem. The whole approach is implemented in a system called MineProm. The basic idea underlying our approach is that each position-nucleotide pair in a DNA sequence is represented by a distinct binary-valued feature—the binary position base value (BPBV). A hybrid filter-wrapper, featuredeletion (or addition) algorithmic process is called for in order to select those BPBVs that best discriminate between two DNA sequences target classes (i.e., promoter vs. nonpromoter). MineProm is tested on two widely used benchmark data sets. Assessment of results demonstrates the reliability of the approach.

The IRMA Community

Research IRM

Feature Selection for the Promoter Recognition and Prediction Problem

Purchase

Abstract

Related Content

IRMA Sponsors