Feature Selection for the Promoter Recognition and Prediction Problem

Feature Selection for the Promoter Recognition and Prediction Problem

George Potamias, Alexandros Kanterakis
Copyright: © 2007 |Pages: 19
DOI: 10.4018/jdwm.2007070105
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

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.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024)
Volume 19: 6 Issues (2023)
Volume 18: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing