Sequence-Based Classification Using Discriminatory Motif Feature Selection
Authors:
Open Access
- 10 November 2011
- journal article
- research article
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 6 (11) , e27382
Abstract
Most existing methods for sequence-based classification use exhaustive feature generation, employing, for example, all -mer patterns. The motivation behind such (enumerative) approaches is to minimize the potential for overlooking important features. However, there are shortcomings to this strategy. First, practical constraints limit the scope of exhaustive feature generation to patterns of length , such that potentially important, longer ( ) predictors are not considered. Second, features so generated exhibit strong dependencies, which can complicate understanding of derived classification rules. Third, and most importantly, numerous irrelevant features are created. These concerns can compromise prediction and interpretation. While remedies have been proposed, they tend to be problem-specific and not broadly applicable. Here, we develop a generally applicable methodology, and an attendant software pipeline, that is predicated on discriminatory motif finding. In addition to the traditional training and validation partitions, our framework entails a third level of data partitioning, a discovery partition. A discriminatory motif finder is used on sequences and associated class labels in the discovery partition to yield a (small) set of features. These features are then used as inputs to a classifier in the training partition. Finally, performance assessment occurs on the validation partition. Important attributes of our approach are its modularity (any discriminatory motif finder and any classifier can be deployed) and its universality (all data, including sequences that are unaligned and/or of unequal length, can be accommodated). We illustrate our approach on two nucleosome occupancy datasets and a protein solubility dataset, previously analyzed using enumerative feature generation. Our method achieves excellent performance results, with and without optimization of classifier tuning parameters. A Python pipeline implementing the approach is available at http://www.epibiostat.ucsf.edu/biostat/sen/dmfs/.Keywords
This publication has 51 references indexed in Scilit:
- FIMO: scanning for occurrences of a given motifBioinformatics, 2011
- MOODS: fast search for position weight matrix matches in DNA sequencesBioinformatics, 2009
- KIRMES: kernel-based identification of regulatory modules in euchromatic sequencesBioinformatics, 2009
- POIMs: positional oligomer importance matrices—understanding support vector machine-based signal detectorsBioinformatics, 2008
- A high-resolution atlas of nucleosome occupancy in yeastNature Genetics, 2007
- The Universal Protein Resource (UniProt)Nucleic Acids Research, 2006
- RASE: recognition of alternatively spliced exons in C.elegansBioinformatics, 2005
- Assessing computational tools for the discovery of transcription factor binding sitesNature Biotechnology, 2005
- The Protein Data BankNucleic Acids Research, 2000
- Gapped BLAST and PSI-BLAST: a new generation of protein database search programsNucleic Acids Research, 1997