Motivation: Understanding transcriptional regulation is one of the main challenges in computational biology. An important problem is the identification of transcription factor (TF) binding sites in promoter regions of potential TF target genes. It is typically approached by position weight matrix-based motif identification algorithms using Gibbs sampling, or heuristics to extend seed oligos. Such algorithms succeed in identifying single, relatively well-conserved binding sites, but tend to fail when it comes to the identification of combinations of several degenerate binding sites, as those often found in cis-regulatory modules. Results: We propose a new algorithm that combines the benefits of existing motif finding with the ones of support vector machines (SVMs) to find degenerate motifs in order to improve the modeling of regulatory modules. In experiments on microarray data from Arabidopsis thaliana, we were able to show that the newly developed strategy significantly improves the recognition of TF targets. Availability: The python source code (open source-licensed under GPL), the data for the experiments and a Galaxy-based web service are available at http://www.fml.mpg.de/raetsch/suppl/kirmes/ Contact: sebi@tuebingen.mpg.de Supplementary information: Supplementary data are available at Bioinformatics online.
KIRMES: kernel-based identification of regulatory modules in euchromatic sequences
Sebastian J. Schultheiss,Wolfgang Busch,J. Lohmann,O. Kohlbacher,G. Rätsch
Published 2009 in BMC Bioinformatics
ABSTRACT
PUBLICATION RECORD
- Publication year
2009
- Venue
BMC Bioinformatics
- Publication date
2009-04-23
- Fields of study
Biology, Medicine, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar, PubMed
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-47 of 47 references · Page 1 of 1
CITED BY
Showing 1-28 of 28 citing papers · Page 1 of 1