TWThomas Wilhelm

Thomas Wilhelm

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Thomas Wilhelm has a total of 16 co-authors. Here are the top co-authors by number of shared publications:

  • Swetlana Nikolajewa

    Biocomputing Group, Leibniz Institute for Age Research – Fritz Lipmann Institute, Jena Centre for Bioinformatics, Beutenbergstr. 11, 2Systems Biology/Bioinformatics Group, Leibniz Institute for Natural Product Research and Infection Biology – Hans Knöll Institute, Jena Centre for Bioinformatics, Beutenbergstr. 11a, 07745 Jena, Germany and 3Theoretical Systems Biology, Institute of Food Research, Norwich Research Park, Colney, Norwich NR4 7UA, UK

    3 shared publications
  • Jens Hollunder

    Department of Plant Systems Biology, VIB, 9052 Ghent, Belgium

    2 shared publications
  • Jürgen Sühnel

    Biocomputing Group, Leibniz Institute for Age Research – Fritz Lipmann Institute, Jena Centre for Bioinformatics, Beutenbergstr. 11, 2Systems Biology/Bioinformatics Group, Leibniz Institute for Natural Product Research and Infection Biology – Hans Knöll Institute, Jena Centre for Bioinformatics, Beutenbergstr. 11a, 07745 Jena, Germany and 3Theoretical Systems Biology, Institute of Food Research, Norwich Research Park, Colney, Norwich NR4 7UA, UK

    2 shared publications
  • Maik Friedel

    Department of Plant Systems Biology, VIB, 2 Department of Molecular Genetics, Ghent University, Technologiepark 927, B-9052 Gent, Belgium, 3 Biocomputing Group, Leibniz Institute for Age Research – Fritz Lipmann Institute, Beutenbergstrasse 11, 07745 Jena, Germany and 4 Theoretical Systems Biology, Institute of Food Research, Norwich Research Park, Colney, Norwich NR4 7UA, UK

    2 shared publications
  • Maik Friedel

    Biocomputing Group, Leibniz Institute for Age Research – Fritz Lipmann Institute, Jena Centre for Bioinformatics, Beutenbergstr. 11, 2Systems Biology/Bioinformatics Group, Leibniz Institute for Natural Product Research and Infection Biology – Hans Knöll Institute, Jena Centre for Bioinformatics, Beutenbergstr. 11a, 07745 Jena, Germany and 3Theoretical Systems Biology, Institute of Food Research, Norwich Research Park, Colney, Norwich NR4 7UA, UK

    2 shared publications
  • Dirk Koczan

    Institute for Immunology, University of Rostock, Rostock, Germany

    1 shared publication

Latest Publications

  • Open Access

    The ancient mammalian KRAB zinc finger gene cluster on human chromosome 8q24.3 illustrates principles of C2H2 zinc finger evolution associated with unique expression profiles in human tissues

    by Peter Lorenz, Sabine Dietmann, Thomas Wilhelm, Dirk Koczan, Sandra Autran, Sophie Gad, Gaiping Wen, Guohui Ding, Yixue Li, Marie-Françoise Rousseau-Merck, et al.

    Background: Expansion of multi-C2H2 domain zinc finger (ZNF) genes, including the Krüppel-associated box (KRAB) subfamily, paralleled the evolution of tetrapodes, particularly in mammalian lineages. Advances in their cataloging and characterization suggest that the functions of the KRAB-ZNF gene family contributed to mammalian speciation. Results: Here, we characterized the human 8q24.3 ZNF cluster on the genomic, the phylogenetic, the structural and the transcriptome level. Six (ZNF7, ZNF34, ZNF250, ZNF251, ZNF252, ZNF517) of the seven locus members contain exons encoding KRAB domains, one (ZNF16) does not. They form a paralog group in which the encoded KRAB and ZNF protein domains generally share more similarities with each other than with other members of the human ZNF superfamily. The closest relatives with respect to their DNA-binding domain were ZNF7 and ZNF251. The analysis of orthologs in therian mammalian species revealed strong conservation and purifying selection of the KRAB-A and zinc finger domains. These findings underscore structural/functional constraints during evolution. Gene losses in the murine lineage (ZNF16, ZNF34, ZNF252, ZNF517) and potential protein truncations in primates (ZNF252) illustrate ongoing speciation processes. Tissue expression profiling by quantitative real-time PCR showed similar but distinct patterns for all tested ZNF genes with the most prominent expression in fetal brain. Based on accompanying expression signatures in twenty-six other human tissues ZNF34 and ZNF250 revealed the closest expression profiles. Together, the 8q24.3 ZNF genes can be assigned to a cerebellum, a testis or a prostate/thyroid subgroup. These results are consistent with potential functions of the ZNF genes in morphogenesis and differentiation. Promoter regions of the seven 8q24.3 ZNF genes display common characteristics like missing TATA-box, CpG island-association and transcription factor binding site (TFBS) modules. Common TFBS modules partly explain the observed expression pattern similarities. Conclusions: The ZNF genes at human 8q24.3 form a relatively old mammalian paralog group conserved in eutherian mammals for at least 130 million years. The members persisted after initial duplications by undergoing subfunctionalizations in their expression patterns and target site recognition. KRAB-ZNF mediated repression of transcription might have shaped organogenesis in mammalian ontogeny.


  • Open Access

    DASS-GUI: a user interface for identification and analysis of significant patterns in non-sequential data

    by Jens Hollunder, Maik Friedel, Martin Kuiper, Thomas Wilhelm

    Summary: Many large ‘omics’ datasets have been published and many more are expected in the near future. New analysis methods are needed for best exploitation. We have developed a graphical user interface (GUI) for easy data analysis. Our discovery of all significant substructures (DASS) approach elucidates the underlying modularity, a typical feature of complex biological data. It is related to biclustering and other data mining approaches. Importantly, DASS-GUI also allows handling of multi-sets and calculation of statistical significances. DASS-GUI contains tools for further analysis of the identified patterns: analysis of the pattern hierarchy, enrichment analysis, module validation, analysis of additional numerical data, easy handling of synonymous names, clustering, filtering and merging. Different export options allow easy usage of additional tools such as Cytoscape. Availability: Source code, pre-compiled binaries for different systems, a comprehensive tutorial, case studies and many additional datasets are freely available at http://www.ifr.ac.uk/dass/gui/. DASS-GUI is implemented in Qt. Contact: jehol@psb.vib-ugent.be; thomas.wilhelm@bbsrc.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.


  • Open Access

    The smallest chemical reaction system with bistability

    by Thomas Wilhelm

    Bistability underlies basic biological phenomena, such as cell division, differentiation, cancer onset, and apoptosis. So far biologists identified two necessary conditions for bistability: positive feedback and ultrasensitivity.


  • Open Access

    DiProGB: the dinucleotide properties genome browser

    by Maik Friedel, Swetlana Nikolajewa, Jürgen Sühnel, Thomas Wilhelm

    Motivation: DiProGB is an easy to use new genome browser that encodes the primary nucleotide sequence by thermodynamical and geometrical dinucleotide properties. The nucleotide sequence is thus converted into a sequence graph. This visualization, supported by different graph manipulation options, facilitates genome analyses, because the human brain can process visual information better than textual information. Also, DiProGB can identify genomic regions where certain physical properties are more conserved than the nucleotide sequence itself. Most of the DiProGB tools can be applied to both, the primary nucleotide sequence and the sequence graph. They include motif and repeat searches as well as statistical analyses. DiProGB adds a new dimension to the common genome analysis approaches by taking into account the physical properties of DNA and RNA. Availability and Implementation: Source code and binaries are freely available for download at http://diprogb.fli-leibniz.de, implemented in C++ and supported on MS Windows and Linux (using e.g. WineHQ). Contact:maikfr@fli-leibniz.de; thomas.wilhelm@bbsrc.ac.uk


  • Open Access

    DiProDB: a database for dinucleotide properties

    by Maik Friedel, Swetlana Nikolajewa, Jürgen Sühnel, Thomas Wilhelm

    DiProDB (http://diprodb.fli-leibniz.de) is a database of conformational and thermodynamic dinucleotide properties. It includes datasets both for DNA and RNA, as well as for single and double strands. The data have been shown to be important for understanding different aspects of nucleic acid structure and function, and they can also be used for encoding nucleic acid sequences. The database is intended to facilitate further applications of dinucleotide properties. A number of property datasets is highly correlated. Therefore, the database comes with a correlation analysis facility. Authors having determined new sets of dinucleotide property values are invited to submit these data to DiProDB.


  • The Decomposition Tree for analyses of Boolean functions

    by Maik Friedel, Swetlana Nikolajewa, Thomas Wilhelm

    We present a new data structure, called a Decomposition Tree (DT), for analysing Boolean functions, and demonstrate a variety of applications. In each node of the DT, appropriate bit-string decomposition fragments are combined by a logical operator. The DT has 2 k nodes in the worst case, which implies exponential complexity for problems where the whole tree has to be considered. However, it is important to note that many problems are simpler. We show that these can be handled in an efficient way using the DT. Nevertheless, many problems are of exponential complexity and cannot be made any simpler: for example, the calculation of prime implicants. Using our general DT structure, we present a new worst case algorithm to compute all prime implicants. This algorithm has a lower time complexity than the well-known Quine–McCluskey algorithm and is the fastest corresponding worst case algorithm so far.