Thomas Dandekar

Prof. Thomas Dandekar

Department of Bioinformatics, Biozentrum, Universität Würzburg, Am Hubland, D-97074 Wuerzburg, Germany
orcid

Research Focus & Metrics

Academic Career Length

42Years (1985-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 1998 in Trends in Biochemical Sciences
Verified
Journal Article
Closed access
Thomas DandekarThomas Dandekar
Thomas Dandekar
BSB Snel
B Snel
MHM Huynen
M Huynen
PBP Bork
P Bork

1 March 2000 in Nature Biotechnology
Verified
Journal Article
Closed access
PDF file
SSStefan Schuster
Stefan Schuster
DFDavid Fell
David Fell
Thomas DandekarThomas Dandekar
Thomas Dandekar

1 July 2008 in Bioinformatics
Verified
Journal Article
Open access
PDF file
MDMarcus T. Dittrich
Marcus T. Dittrich
GKGunnar Klau
Gunnar Klau
ARAndreas Rosenwald
Andreas Rosenwald
Thomas DandekarThomas Dandekar
Thomas Dandekar
TMTobias Müller
Tobias Müller
Motivation: With the exponential growth of expression and protein–protein interaction (PPI) data, the frontier of research in systems biology shifts more and more to the integrated analysis of these large datasets. Of particular interest is the identification of functional modules in PPI networks, sharing common cellular function beyond the scope of classical pathways, by means of detecting differentially expressed regions in PPI networks. This requires on the one hand an adequate scoring of the nodes in the network to be identified and on the other hand the availability of an effective algorithm to find the maximally scoring network regions. Various heuristic approaches have been proposed in the literature. Results: Here we present the first exact solution for this problem, which is based on integer-linear programming and its connection to the well-known prize-collecting Steiner tree problem from Operations Research. Despite the NP-hardness of the underlying combinatorial problem, our method typically computes provably optimal subnetworks in large PPI networks in a few minutes. An essential ingredient of our approach is a scoring function defined on network nodes. We propose a new additive score with two desirable properties: (i) it is scalable by a statistically interpretable parameter and (ii) it allows a smooth integration of data from various sources. We apply our method to a well-established lymphoma microarray dataset in combination with associated survival data and the large interaction network of HPRD to identify functional modules by computing optimal-scoring subnetworks. In particular, we find a functional interaction module associated with proliferation over-expressed in the aggressive ABC subtype as well as modules derived from non-malignant by-stander cells. Availability: Our software is available freely for non-commercial purposes at http://www.planet-lisa.net. Contact:tobias.mueller@biozentrum.uni-wuerzburg.de

10 May 2010 in Nature Reviews Microbiology
Verified
Journal Article
Closed access
WEWolfgang Eisenreich
Wolfgang Eisenreich
Thomas DandekarThomas Dandekar
Thomas Dandekar
JHJürgen Heesemann
Jürgen Heesemann
WGWerner Goebel
Werner Goebel

1 February 2009 in Gene
Verified
Journal Article
Closed access
Alexander KellerAlexander Keller
Alexander Keller
TSTina Schleicher
Tina Schleicher
JSJörg Schultz
Jörg Schultz
TMTobias Müller
Tobias Müller
Thomas DandekarThomas Dandekar
Thomas Dandekar
MWMatthias Wolf
Matthias Wolf

17 February 2016 in Science Translational Medicine
Verified
Journal Article
Closed access
PDF file
JVJanika Viereck
Janika Viereck
RKRegalla Kumarswamy
Regalla Kumarswamy
AFAriana Foinquinos
Ariana Foinquinos
KXKe Xiao
Ke Xiao
PAPetros Avramopoulos
Petros Avramopoulos
Thomas ThumThomas Thum
Thomas Thum
Inhibition of the long noncoding RNA Chast prevents pressure overload–induced cardiac remodeling in mice.