scispace - formally typeset
Search or ask a question
Author

Hans-Peter Lenhof

Other affiliations: Max Planck Society
Bio: Hans-Peter Lenhof is an academic researcher from Saarland University. The author has contributed to research in topics: Macromolecular docking & Autoantibody. The author has an hindex of 44, co-authored 164 publications receiving 6046 citations. Previous affiliations of Hans-Peter Lenhof include Max Planck Society.


Papers
More filters
01 Jan 1996
TL;DR: This bibliography neglects several other areas of computational molecular biology, like most of the literature on the proteinfolding problem, as well as databases for molecular and genetic data, and geneticmapping algorithms.
Abstract: Computational Molecular BiologyMartin VingronDeutsches Krebsforschungszentrum, HeidelbergHans Peter LenhofMax-Planck-Institut f ur Informatik, Saarbr uckenPetra MutzelMax-Planck-Institut f ur Informatik, Saarbr uckenContents1Books and Surveys2Sequence Alignment and Evolution21Pairwise SequenceAlignment22Multiple SequenceAlignment23Evolutionary Trees24Trees and Alignment3Tree Comparison4Genome Rearrangements5Sequencing and Mapping51Sequence Assembly52Sequencing by Hybridization53Digest Mapping54Mapping Using Hybridization Data6Protein Threading and Lattice Models61Threading62LatticeModelsComputational Biology is a fairly new sub ject that arose in resp onse to thecomputational problems p osed by the analysis and the pro cessing of biomolecularsequence and structure data The eld was initiated in the late 60's and early 70'slargely by pioneers working in the life sciences Physicists and mathematicians enteredthe eld in the 70's and 80's, while Computer Science b ecame involved with the newbiological problems in the late 1980's Computational problems have gained furtherimp ortance in molecular biology through the various genome pro jects which pro duceenormous amounts of dataFor this bibliographywe fo cus on those areas of computational molecular biologythat involve discrete algorithms or discrete optimization Wethus neglect several otherareas of computational molecular biology, like most of the literature on the proteinfolding problem, as well as databases for molecular and genetic data, and geneticmapping algorithms Due to the availability of review pap ers and a bibliography from1984 some older pap ers will not b e explicitel y mentioned in this bibliography1

135 citations

Journal ArticleDOI
01 Sep 2000
TL;DR: It is shown in an example that the implementation of complex methods is greatly simplified when using the data structures and functionality provided by BALL.
Abstract: Motivation: Rapid software prototyping can significantly reduce development times in the field of computational molecular biology and molecular modeling. Biochemical Algorithms Library (BALL) is an application framework in C++ that has been specifically designed for this purpose. Results: BALL provides an extensive set of data structures as well as classes for molecular mechanics, advanced solvation methods, comparison and analysis of protein structures, file import/export, and visualization. BALL has been carefully designed to be robust, easy to use, and open to extensions. Especially its extensibility which results from an object-oriented and generic programming approach distinguishes it from other software packages. BALL is well suited to serve as a public repository for reliable data structures and algorithms. We show in an example that the implementation of complex methods is greatly simplified when using the data structures and functionality provided by BALL. Availability: BALL is available via internet from http: // www.mpi-sb.mpg.de/ BALL/ . It may be used free of charge for research and teaching. Commercial licenses are available upon request. Contact: O.Kohlbacher, oliver@mpi-sb.mpg.de

113 citations

Journal ArticleDOI
TL;DR: It is demonstrated that the distribution of paralogs in large gene families contains in itself sufficient phylogenetic signal to infer fully resolved species phylogenies, and genome-wide data sets are sufficient to generate fully resolved phylogenetic trees, even in the presence of horizontal gene transfer.
Abstract: Phylogenomics heavily relies on well-curated sequence data sets that comprise, for each gene, exclusively 1:1 orthologos. Paralogs are treated as a dangerous nuisance that has to be detected and removed. We show here that this severe restriction of the data sets is not necessary. Building upon recent advances in mathematical phylogenetics, we demonstrate that gene duplications convey meaningful phylogenetic information and allow the inference of plausible phylogenetic trees, provided orthologs and paralogs can be distinguished with a degree of certainty. Starting from tree-free estimates of orthology, cograph editing can sufficiently reduce the noise to find correct event-annotated gene trees. The information of gene trees can then directly be translated into constraints on the species trees. Although the resolution is very poor for individual gene families, we show that genome-wide data sets are sufficient to generate fully resolved phylogenetic trees, even in the presence of horizontal gene transfer.

112 citations

Journal ArticleDOI
TL;DR: A bioinformatics tool ‘GraBCas’ is presented that provides score-based prediction of potential cleavage sites for the caspases 1–9 and granzyme B including an estimation of the fragment size and its usefulness for protein sequence analysis is tested.
Abstract: Caspases and granzyme B are proteases that share the primary specificity to cleave at the carboxyl terminal of aspartate residues in their substrates. Both, caspases and granzyme B are enzymes that are involved in fundamental cellular processes and play a central role in apoptotic cell death. Although various targets are described, many substrates still await identification and many cleavage sites of known substrates are not identified or experimentally verified. A more comprehensive knowledge of caspase and granzyme B substrates is essential to understand the biological roles of these enzymes in more detail. The relatively high variability in cleavage site recognition sequence often complicates the identification of cleavage sites. As of yet there is no software available that allows identification of caspase and/or granzyme with cleavage sites differing from the consensus sequence. Here, we present a bioinformatics tool ‘GraBCas’ that provides score-based prediction of potential cleavage sites for the caspases 1–9 and granzyme B including an estimation of the fragment size. We tested GraBCas on already known substrates and showed its usefulness for protein sequence analysis. GraBCas is available at http://wwwalt.med-rz.uniklinik-saarland.de/med_fak/humangenetik/software/index.html.

108 citations

Journal ArticleDOI
TL;DR: EDISON-WMW is developed, a new approach to calculate the exact permutation of the two-tailed unpaired WMW test without any corrections required and allowing for ties, which can be applied to high-throughput omics datasets, where hundreds or thousands of features are included.

108 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: The survey will help tool designers/developers and experienced end users understand the underlying algorithms and pertinent details of particular tool categories/tools, enabling them to make the best choices for their particular research interests.
Abstract: Functional analysis of large gene lists, derived in most cases from emerging high-throughput genomic, proteomic and bioinformatics scanning approaches, is still a challenging and daunting task. The gene-annotation enrichment analysis is a promising high-throughput strategy that increases the likelihood for investigators to identify biological processes most pertinent to their study. Approximately 68 bioinformatics enrichment tools that are currently available in the community are collected in this survey. Tools are uniquely categorized into three major classes, according to their underlying enrichment algorithms. The comprehensive collections, unique tool classifications and associated questions/issues will provide a more comprehensive and up-to-date view regarding the advantages, pitfalls and recent trends in a simpler tool-class level rather than by a tool-by-tool approach. Thus, the survey will help tool designers/developers and experienced end users understand the underlying algorithms and pertinent details of particular tool categories/tools, enabling them to make the best choices for their particular research interests.

13,102 citations

Journal ArticleDOI
TL;DR: These revisions simplify the McDonald Criteria, preserve their diagnostic sensitivity and specificity, address their applicability across populations, and may allow earlier diagnosis and more uniform and widespread use.
Abstract: New evidence and consensus has led to further revision of the McDonald Criteria for diagnosis of multiple sclerosis. The use of imaging for demonstration of dissemination of central nervous system lesions in space and time has been simplified, and in some circumstances dissemination in space and time can be established by a single scan. These revisions simplify the Criteria, preserve their diagnostic sensitivity and specificity, address their applicability across populations, and may allow earlier diagnosis and more uniform and widespread use.

8,883 citations

Journal ArticleDOI
TL;DR: A new method for multiple sequence alignment that provides a dramatic improvement in accuracy with a modest sacrifice in speed as compared to the most commonly used alternatives but avoids the most serious pitfalls caused by the greedy nature of this algorithm.

6,727 citations

Journal ArticleDOI
TL;DR: A biologist-oriented portal that provides a gene list annotation, enrichment and interactome resource and enables integrated analysis of multi-OMICs datasets, Metascape is an effective and efficient tool for experimental biologists to comprehensively analyze and interpret OMICs-based studies in the big data era.
Abstract: A critical component in the interpretation of systems-level studies is the inference of enriched biological pathways and protein complexes contained within OMICs datasets Successful analysis requires the integration of a broad set of current biological databases and the application of a robust analytical pipeline to produce readily interpretable results Metascape is a web-based portal designed to provide a comprehensive gene list annotation and analysis resource for experimental biologists In terms of design features, Metascape combines functional enrichment, interactome analysis, gene annotation, and membership search to leverage over 40 independent knowledgebases within one integrated portal Additionally, it facilitates comparative analyses of datasets across multiple independent and orthogonal experiments Metascape provides a significantly simplified user experience through a one-click Express Analysis interface to generate interpretable outputs Taken together, Metascape is an effective and efficient tool for experimental biologists to comprehensively analyze and interpret OMICs-based studies in the big data era

6,282 citations

Journal ArticleDOI
TL;DR: A significant update to one of the tools in this domain called Enrichr, a comprehensive resource for curated gene sets and a search engine that accumulates biological knowledge for further biological discoveries is presented.
Abstract: Enrichment analysis is a popular method for analyzing gene sets generated by genome-wide experiments. Here we present a significant update to one of the tools in this domain called Enrichr. Enrichr currently contains a large collection of diverse gene set libraries available for analysis and download. In total, Enrichr currently contains 180 184 annotated gene sets from 102 gene set libraries. New features have been added to Enrichr including the ability to submit fuzzy sets, upload BED files, improved application programming interface and visualization of the results as clustergrams. Overall, Enrichr is a comprehensive resource for curated gene sets and a search engine that accumulates biological knowledge for further biological discoveries. Enrichr is freely available at: http://amp.pharm.mssm.edu/Enrichr.

6,201 citations