Demo Data from EDBT 2026 / reviewers in the wild / expert
Ernst Kretschmann
dblp:13/4430
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
4 papers |
Bioinformatics and computational biology · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › data integration › biological data integration
distributed annotation system |
0.1 | 1 | 2005 | Dasty and UniProt DAS: a perfect pair for protein feature visualization · Bioinform. 2005 |
Bioinformatics and computational biology
hierarchical clustering |
0.1 | 1 | 2005 | The predictive power of the CluSTr database · Bioinform. 2005 |
Bioinformatics and computational biology › protein function prediction
protein classification |
0.1 | 1 | 2005 | The predictive power of the CluSTr database · Bioinform. 2005 |
Bioinformatics and computational biology
protein function prediction |
0.0 | 2 | 2005 | Automatic rule generation for protein annotation with the C4.5 data mining algorithm applied on SWISS-PROT · Bioinform. 2001 The predictive power of the CluSTr database · Bioinform. 2005 |
Bioinformatics and computational biology › genome annotation
automatic annotation |
0.0 | 1 | 2005 | The predictive power of the CluSTr database · Bioinform. 2005 |
Bioinformatics and computational biology › protein sequence analysis
protein sequence annotation |
0.0 | 1 | 2005 | Dasty and UniProt DAS: a perfect pair for protein feature visualization · Bioinform. 2005 |
Bioinformatics and computational biology › biological database
protein sequence database |
0.0 | 1 | 2001 | Automatic rule generation for protein annotation with the C4.5 data mining algorithm applied on SWISS-PROT · Bioinform. 2001 |
Methods — techniques the papers use, named apart from their topics
smith-waterman algorithm · 0.1single-linkage clustering · 0.1monte carlo analysis · 0.1cross-validation · 0.0c4.5 decision tree · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | UniProtJAPI: a remote API for accessing UniProt dataabstractProgrammatic access to the UniProt Knowledgebase (UniProtKB) is essential for many bioinformatics applications dealing with protein data. We have created a Java library named UniProtJAPI, which facilitates the integration of UniProt data into Java-based software applications. The library supports queries and similarity searches that return UniProtKB entries in the form of Java objects. These objects contain functional annotations or sequence information associated with a UniProt entry. Here, we briefly describe the UniProtJAPI and demonstrate its usage. Samuel Patient, Daniela Wieser, Michael Kleen, Ernst Kretschmann, Maria Jesus Martin, Rolf Apweiler |
Bioinform. | 4 |
| 2005 | Dasty and UniProt DAS: a perfect pair for protein feature visualizationabstractIn this study, we present two freely available and complementary Distributed Annotation System (DAS) resources: a DAS reference server that provides up-to-date sequence and annotation from UniProt, with additional feature links and database cross-references from InterPro and a DAS client implemented using Java and Macromedia Flash that is optimized for the display of protein features. Philip Jones, Nisha Vinod, Thomas A. Down, Andre Hackmann, Andreas Kähäri, Ernst Kretschmann, Antony F. Quinn, Daniela Wieser, Henning Hermjakob, Rolf Apweiler |
Bioinform. | 6 |
| 2005 | The predictive power of the CluSTr databaseabstractSUMMARY: The CluSTr database employs a fully automatic single-linkage hierarchical clustering method based on a similarity matrix. In order to compute the matrix, first all-against-all pair-wise comparisons between protein sequences are computed using the Smith-Waterman algorithm. The statistical significance of the similarity scores is then assessed using a Monte Carlo analysis, yielding Z-values, which are used to populate the matrix. This paper describes automated annotation experiments that quantify the predictive power and hence the biological relevance of the CluSTr data. The experiments utilized the UniProt data-mining framework to derive annotation predictions using combinations of InterPro and CluSTr. We show that this combination of data sources greatly increases the precision of predictions made by the data-mining framework, compared with the use of InterPro data alone. We conclude that the CluSTr approach to clustering proteins makes a valuable contribution to traditional protein classifications. AVAILABILITY: http://www.ebi.ac.uk/clustr/. Robert Petryszak, Ernst Kretschmann, Daniela Wieser, Rolf Apweiler |
Bioinform. | 2 |
| 2001 | Automatic rule generation for protein annotation with the C4.5 data mining algorithm applied on SWISS-PROTabstractMOTIVATION: The gap between the amount of newly submitted protein data and reliable functional annotation in public databases is growing. Traditional manual annotation by literature curation and sequence analysis tools without the use of automated annotation systems is not able to keep up with the ever increasing quantity of data that is submitted. Automated supplements to manually curated databases such as TrEMBL or GenPept cover raw data but provide only limited annotation. To improve this situation automatic tools are needed that support manual annotation, automatically increase the amount of reliable information and help to detect inconsistencies in manually generated annotations. RESULTS: A standard data mining algorithm was successfully applied to gain knowledge about the Keyword annotation in SWISS-PROT. 11 306 rules were generated, which are provided in a database and can be applied to yet unannotated protein sequences and viewed using a web browser. They rely on the taxonomy of the organism, in which the protein was found and on signature matches of its sequence. The statistical evaluation of the generated rules by cross-validation suggests that by applying them on arbitrary proteins 33% of their keyword annotation can be generated with an error rate of 1.5%. The coverage rate of the keyword annotation can be increased to 60% by tolerating a higher error rate of 5%. AVAILABILITY: The results of the automatic data mining process can be browsed on http://golgi.ebi.ac.uk:8080/Spearmint/ Source code is available upon request. CONTACT: [email protected]. Ernst Kretschmann, Wolfgang Fleischmann, Rolf Apweiler |
Bioinform. | 1 |