Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

German Conference on Bioinformatics P-136, 158-167 (2008).

Gesellschaft für Informatik, Bonn


Andreas Beyer (ed.), Michael Schroeder (ed.)

Copyright © Gesellschaft für Informatik, Bonn


KIRMES: kernel-based identification of regulatory modules in euchromatic sequences

Sebastian J. Schulthei , Wolfgang Busch , Jan Lohmann , Oliver Kohlbacher and Gunnar Rätsch


Motivation: Understanding transcriptional regulation is one of the main challenges in computational biology. An important problem is the identification of transcription factor binding sites in promoter regions of potential transcription factor target genes. It is typically approached by position weight matrix-based motif identification algorithms using Gibbs sampling or heuristics for extending 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 transcription factor targets. Availability: The PYTHON source code (open source-licensed under GPL), the data for the experiments and a web-service are available at http://www.fml.mpg. de/raetsch/projects/kirmes. Contact:

Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-226-0

Last changed 04.10.2013 18:19:04