Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Thomas Lengauer is active.

Publication


Featured researches published by Thomas Lengauer.


Nature Genetics | 2007

A genome-wide association scan of nonsynonymous SNPs identifies a susceptibility variant for Crohn disease in ATG16L1.

Jochen Hampe; Andre Franke; Philip Rosenstiel; Andreas Till; Markus Teuber; Klaus Huse; Mario Albrecht; Gabriele Mayr; Francisco M. De La Vega; Jason Briggs; Simone Günther; Natalie J. Prescott; Clive M. Onnie; Robert Häsler; Bence Sipos; Ulrich R. Fölsch; Thomas Lengauer; Matthias Platzer; Christopher G. Mathew; Michael Krawczak; Stefan Schreiber

We performed a genome-wide association study of 19,779 nonsynonymous SNPs in 735 individuals with Crohn disease and 368 controls. A total of 7,159 of these SNPs were informative. We followed up on all 72 SNPs with P ≤ 0.01 with an allele-based disease association test in 380 independent Crohn disease trios, 498 Crohn disease singleton cases and 1,032 controls. Disease association of rs2241880 in the autophagy-related 16-like 1 gene (ATG16L1) was replicated in these samples (P = 4.0 × 10−8) and confirmed in a UK case-control sample (P = 0.0004). By haplotype and regression analysis, we found that marker rs2241880, a coding SNP (T300A), carries virtually all the disease risk exerted by the ATG16L1 locus. The ATG16L1 gene encodes a protein in the autophagosome pathway that processes intracellular bacteria. We found a statistically significant interaction with respect to Crohn disease risk between rs2241880 and the established CARD15 susceptibility variants (P = 0.039). Together with the lack of association between rs2241880 and ulcerative colitis (P > 0.4), these data suggest that the underlying biological process may be specific to Crohn disease.


Bioinformatics | 2005

ROCR: visualizing classifier performance in R

Tobias Sing; Oliver Sander; Niko Beerenwinkel; Thomas Lengauer

UNLABELLED ROCR is a package for evaluating and visualizing the performance of scoring classifiers in the statistical language R. It features over 25 performance measures that can be freely combined to create two-dimensional performance curves. Standard methods for investigating trade-offs between specific performance measures are available within a uniform framework, including receiver operating characteristic (ROC) graphs, precision/recall plots, lift charts and cost curves. ROCR integrates tightly with Rs powerful graphics capabilities, thus allowing for highly adjustable plots. Being equipped with only three commands and reasonable default values for optional parameters, ROCR combines flexibility with ease of usage. AVAILABILITY http://rocr.bioinf.mpi-sb.mpg.de. ROCR can be used under the terms of the GNU General Public License. Running within R, it is platform-independent. CONTACT [email protected].


Bioinformatics | 2006

Improved scoring of functional groups from gene expression data by decorrelating GO graph structure

Adrian Alexa; Jörg Rahnenführer; Thomas Lengauer

MOTIVATION The result of a typical microarray experiment is a long list of genes with corresponding expression measurements. This list is only the starting point for a meaningful biological interpretation. Modern methods identify relevant biological processes or functions from gene expression data by scoring the statistical significance of predefined functional gene groups, e.g. based on Gene Ontology (GO). We develop methods that increase the explanatory power of this approach by integrating knowledge about relationships between the GO terms into the calculation of the statistical significance. RESULTS We present two novel algorithms that improve GO group scoring using the underlying GO graph topology. The algorithms are evaluated on real and simulated gene expression data. We show that both methods eliminate local dependencies between GO terms and point to relevant areas in the GO graph that remain undetected with state-of-the-art algorithms for scoring functional terms. A simulation study demonstrates that the new methods exhibit a higher level of detecting relevant biological terms than competing methods.


Archive | 1990

Combinatorial algorithms for integrated circuit layout

Thomas Lengauer

Feel lonely? What about reading books? Book is one of the greatest friends to accompany while in your lonely time. When you have no friends and activities somewhere and sometimes, reading book can be a great choice. This is not only for spending the time, it will increase the knowledge. Of course the b=benefits to take will relate to what kind of book that you are reading. And now, we will concern you to try reading combinatorial algorithms for integrated circuit layout as one of the reading material to finish quickly.


Bioinformatics | 2008

Computing topological parameters of biological networks

Yassen Assenov; Fidel Ramírez; Sven-Eric Schelhorn; Thomas Lengauer; Mario Albrecht

UNLABELLED Rapidly increasing amounts of molecular interaction data are being produced by various experimental techniques and computational prediction methods. In order to gain insight into the organization and structure of the resultant large complex networks formed by the interacting molecules, we have developed the versatile Cytoscape plugin NetworkAnalyzer. It computes and displays a comprehensive set of topological parameters, which includes the number of nodes, edges, and connected components, the network diameter, radius, density, centralization, heterogeneity, and clustering coefficient, the characteristic path length, and the distributions of node degrees, neighborhood connectivities, average clustering coefficients, and shortest path lengths. NetworkAnalyzer can be applied to both directed and undirected networks and also contains extra functionality to construct the intersection or union of two networks. It is an interactive and highly customizable application that requires no expert knowledge in graph theory from the user. AVAILABILITY NetworkAnalyzer can be downloaded via the Cytoscape web site: http://www.cytoscape.org


Proteins | 1999

Evaluation of the FLEXX incremental construction algorithm for protein-ligand docking.

Bernd Kramer; Matthias Rarey; Thomas Lengauer

We report on a test of FLEXX, a fully automatic docking tool for flexible ligands, on a highly diverse data set of 200 protein–ligand complexes from the Protein Data Bank. In total 46.5% of the complexes of the data set can be reproduced by a FLEXX docking solution at rank 1 with an rms deviation (RMSD) from the observed structure of less than 2 Å. This rate rises to 70% if one looks at the entire generated solution set. FLEXX produces reliable results for ligands with up to 15 components which can be docked in 80% of the cases with acceptable accuracy. Ligands with more than 15 components tend to generate wrong solutions more often. The average runtime of FLEXX on this test set is 93 seconds per complex on a SUN Ultra‐30 workstation. In addition, we report on “cross‐docking” experiments, in which several receptor structures of complexes with identical proteins have been used for docking all cocrystallized ligands of these complexes. In most cases, these experiments show that FLEXX can acceptably dock a ligand into a foreign receptor structure. Finally we report on screening runs of ligands out of a library with 556 entries against ten different proteins. In eight cases FLEXX is able to find the original inhibitor within the top 7% of the total library. Proteins 1999;37:228–241. ©1999 Wiley‐Liss, Inc.


ACM Transactions on Programming Languages and Systems | 1979

A fast algorithm for finding dominators in a flowgraph

Thomas Lengauer; Robert Endre Tarjan

A fast algorithm for finding dominators in a flowgraph is presented. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in <italic>O</italic>(<italic>m</italic> log <italic>n</italic>) time, where <italic>m</italic> is the number of edges and <italic>n</italic> is the number of vertices in the problem graph. A more sophisticated implementation runs in <italic>O</italic>(<italic>m</italic>α(<italic>m</italic>, <italic>n</italic>)) time, where α(<italic>m</italic>, <italic>n</italic>) is a functional inverse of Ackermanns function. Both versions of the algorithm were implemented in Algol W, a Stanford University version of Algol, and tested on an IBM 370/168. The programs were compared with an implementation by Purdom and Moore of a straightforward <italic>O</italic>(<italic>mn</italic>)-time algorithm, and with a bit vector algorithm described by Aho and Ullman. The fast algorithm beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tested.


Nature Genetics | 2004

Genetic variation in DLG5 is associated with inflammatory bowel disease

Monika Stoll; Brit Corneliussen; Christine M. Costello; Georg H. Waetzig; Bjorn Mellgard; W. Andreas Koch; Philip Rosenstiel; Mario Albrecht; Peter J. P. Croucher; Dirk Seegert; Susanna Nikolaus; Jochen Hampe; Thomas Lengauer; Stefan Pierrou; Ulrich R. Foelsch; Christopher G. Mathew; Maria Lagerstrom-Fermer; Stefan Schreiber

Crohn disease and ulcerative colitis are two subphenotypes of inflammatory bowel disease (IBD), a complex disorder resulting from gene-environment interaction. We refined our previously defined linkage region for IBD on chromosome 10q23 and used positional cloning to identify genetic variants in DLG5 associated with IBD. DLG5 encodes a scaffolding protein involved in the maintenance of epithelial integrity. We identified two distinct haplotypes with a replicable distortion in transmission (P = 0.000023 and P = 0.004 for association with IBD, P = 0.00012 and P = 0.04 for association with Crohn disease). One of the risk-associated DLG5 haplotypes is distinguished from the common haplotype by a nonsynonymous single-nucleotide polymorphism 113G→A, resulting in the amino acid substitution R30Q in the DUF622 domain of DLG5. This mutation probably impedes scaffolding of DLG5. We stratified the study sample according to the presence of risk-associated CARD15 variants to study potential gene-gene interaction. We found a significant difference in association of the 113A DLG5 variant with Crohn disease in affected individuals carrying the risk-associated CARD15 alleles versus those carrying non-risk-associated CARD15 alleles. This is suggestive of a complex pattern of gene-gene interaction between DLG5 and CARD15, reflecting the complex nature of polygenic diseases. Further functional studies will evaluate the biological significance of DLG5 variants.


BMC Bioinformatics | 2006

A new measure for functional similarity of gene products based on Gene Ontology.

Andreas Schlicker; Francisco S. Domingues; Jörg Rahnenführer; Thomas Lengauer

BackgroundGene Ontology (GO) is a standard vocabulary of functional terms and allows for coherent annotation of gene products. These annotations provide a basis for new methods that compare gene products regarding their molecular function and biological role.ResultsWe present a new method for comparing sets of GO terms and for assessing the functional similarity of gene products. The method relies on two semantic similarity measures; simReland funSim. One measure (simRel) is applied in the comparison of the biological processes found in different groups of organisms. The other measure (funSim) is used to find functionally related gene products within the same or between different genomes. Results indicate that the method, in addition to being in good agreement with established sequence similarity approaches, also provides a means for the identification of functionally related proteins independent of evolutionary relationships. The method is also applied to estimating functional similarity between all proteins in Saccharomyces cerevisiae and to visualizing the molecular function space of yeast in a map of the functional space. A similar approach is used to visualize the functional relationships between protein families.ConclusionThe approach enables the comparison of the underlying molecular biology of different taxonomic groups and provides a new comparative genomics tool identifying functionally related gene products independent of homology. The proposed map of the functional space provides a new global view on the functional relationships between gene products or protein families.


german conference on bioinformatics | 2000

Engineering support vector machine kernels that recognize translation initiation sites

Alexander Zien; Gunnar Rätsch; Sebastian Mika; Bernhard Schölkopf; Thomas Lengauer; Klaus-Robert Müller

MOTIVATION In order to extract protein sequences from nucleotide sequences, it is an important step to recognize points at which regions start that code for proteins. These points are called translation initiation sites (TIS). RESULTS The task of finding TIS can be modeled as a classification problem. We demonstrate the applicability of support vector machines for this task, and show how to incorporate prior biological knowledge by engineering an appropriate kernel function. With the described techniques the recognition performance can be improved by 26% over leading existing approaches. We provide evidence that existing related methods (e.g. ESTScan) could profit from advanced TIS recognition.

Collaboration


Dive into the Thomas Lengauer's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Christoph Bock

Austrian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Jörg Rahnenführer

Technical University of Dortmund

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Stefan Zeuzem

Goethe University Frankfurt

View shared research outputs
Top Co-Authors

Avatar

Daniel Hoffmann

University of Duisburg-Essen

View shared research outputs
Top Co-Authors

Avatar

Andre Altmann

University College London

View shared research outputs
Top Co-Authors

Avatar

Hauke Walter

University of Erlangen-Nuremberg

View shared research outputs
Researchain Logo
Decentralizing Knowledge