Demo Data from EDBT 2026 / reviewers in the wild / expert
Ute Baumann
dblp:76/6432
· DBLP profile ↗
5ranked-venue papers
0as first author
0since 2021 · last 2013
0000-0003-1281-598XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5
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
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
functional genomics |
0.1 | 1 | 2008 | GOSLING: a rule-based protein annotator using BLAST and GO · Bioinform. 2008 |
Bioinformatics and computational biology › protein function prediction
gene ontology annotation |
0.1 | 1 | 2008 | GOSLING: a rule-based protein annotator using BLAST and GO · Bioinform. 2008 |
Bioinformatics and computational biology
protein function prediction |
0.1 | 1 | 2008 | GOSLING: a rule-based protein annotator using BLAST and GO · Bioinform. 2008 |
Bioinformatics and computational biology
gene expression analysis |
0.1 | 1 | 2007 | A framework for gene expression analysis · Bioinform. 2007 |
Bioinformatics and computational biology › gene expression analysis
sample classification |
0.1 | 1 | 2007 | A framework for gene expression analysis · Bioinform. 2007 |
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference |
0.0 | 1 | 2007 | A framework for gene expression analysis · Bioinform. 2007 |
Methods — techniques the papers use, named apart from their topics
decision tree · 0.1BLAST · 0.1perturbation expansion · 0.1clustering · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Sequencing error correction without a reference genomeabstractBACKGROUND: Next (second) generation sequencing is an increasingly important tool for many areas of molecular biology, however, care must be taken when interpreting its output. Even a low error rate can cause a large number of errors due to the high number of nucleotides being sequenced. Identifying sequencing errors from true biological variants is a challenging task. For organisms without a reference genome this difficulty is even more challenging. RESULTS: We have developed a method for the correction of sequencing errors in data from the Illumina Solexa sequencing platforms. It does not require a reference genome and is of relevance for microRNA studies, unsequenced genomes, variant detection in ultra-deep sequencing and even for RNA-Seq studies of organisms with sequenced genomes where RNA editing is being considered. CONCLUSIONS: The derived error model is novel in that it allows different error probabilities for each position along the read, in conjunction with different error rates depending on the particular nucleotides involved in the substitution, and does not force these effects to behave in a multiplicative manner. The model provides error rates which capture the complex effects and interactions of the three main known causes of sequencing error associated with the Illumina platforms. Julie A. Sleep, Andreas W. Schreiber, Ute Baumann |
BMC Bioinform. | 3 |
| 2008 | GOSLING: a rule-based protein annotator using BLAST and GOabstractUNLABELLED: GOSLING is a web-based protein function annotator that uses a decision tree-derived rule set to quickly predict Gene Ontology terms for a protein. A score is assigned to each term prediction that is indicative of the accuracy of the prediction. Due to its speed and accuracy GOSLING is ideally suited for high-throughput annotation tasks. AVAILABILITY: https://www.sapac.edu.au/gosling Craig E. Jones, Julian Schwerdt, Tessa Arwen Bretag, Ute Baumann, Alfred L. Brown |
Bioinform. | 4 |
| 2007 | A framework for gene expression analysisabstractMOTIVATION: Global gene expression measurements as obtained, for example, in microarray experiments can provide important clues to the underlying transcriptional control mechanisms and network structure of a biological cell. In the absence of a detailed understanding of this gene regulation, current attempts at classification of expression data rely on clustering and pattern recognition techniques employing ad-hoc similarity criteria. To improve this situation, a better understanding of the expected relationships between expression profiles of genes associated by biological function is required. RESULTS: It is shown that perturbation expansions familiar from biological systems theory make precise predictions for the types of relationships to be expected for expression profiles of biologically associated genes, even if the underlying biological factors responsible for this association are not known. Classification criteria are derived, most of which are not usually employed in clustering algorithms. The approach is illustrated by using the AtGenExpress Arabidopsis thaliana developmental expression map. Andreas W. Schreiber, Ute Baumann |
Bioinform. | 2 |
| 2007 | Estimating the annotation error rate of curated GO database sequence annotationsabstractBACKGROUND: Annotations that describe the function of sequences are enormously important to researchers during laboratory investigations and when making computational inferences. However, there has been little investigation into the data quality of sequence function annotations. Here we have developed a new method of estimating the error rate of curated sequence annotations, and applied this to the Gene Ontology (GO) sequence database (GOSeqLite). This method involved artificially adding errors to sequence annotations at known rates, and used regression to model the impact on the precision of annotations based on BLAST matched sequences. RESULTS: We estimated the error rate of curated GO sequence annotations in the GOSeqLite database (March 2006) at between 28% and 30%. Annotations made without use of sequence similarity based methods (non-ISS) had an estimated error rate of between 13% and 18%. Annotations made with the use of sequence similarity methodology (ISS) had an estimated error rate of 49%. CONCLUSION: While the overall error rate is reasonably low, it would be prudent to treat all ISS annotations with caution. Electronic annotators that use ISS annotations as the basis of predictions are likely to have higher false prediction rates, and for this reason designers of these systems should consider avoiding ISS annotations where possible. Electronic annotators that use ISS annotations to make predictions should be viewed sceptically. We recommend that curators thoroughly review ISS annotations before accepting them as valid. Overall, users of curated sequence annotations from the GO database should feel assured that they are using a comparatively high quality source of information. Craig E. Jones, Alfred L. Brown, Ute Baumann |
BMC Bioinform. | 3 |
| 2005 | Automated methods of predicting the function of biological sequences using GO and BLASTabstractBACKGROUND: With the exponential increase in genomic sequence data there is a need to develop automated approaches to deducing the biological functions of novel sequences with high accuracy. Our aim is to demonstrate how accuracy benchmarking can be used in a decision-making process evaluating competing designs of biological function predictors. We utilise the Gene Ontology, GO, a directed acyclic graph of functional terms, to annotate sequences with functional information describing their biological context. Initially we examine the effect on accuracy scores of increasing the allowed distance between predicted and a test set of curator assigned terms. Next we evaluate several annotator methods using accuracy benchmarking. Given an unannotated sequence we use the Basic Local Alignment Search Tool, BLAST, to find similar sequences that have already been assigned GO terms by curators. A number of methods were developed that utilise terms associated with the best five matching sequences. These methods were compared against a benchmark method of simply using terms associated with the best BLAST-matched sequence (best BLAST approach). RESULTS: The precision and recall of estimates increases rapidly as the amount of distance permitted between a predicted term and a correct term assignment increases. Accuracy benchmarking allows a comparison of annotation methods. A covering graph approach performs poorly, except where the term assignment rate is high. A term distance concordance approach has a similar accuracy to the best BLAST approach, demonstrating lower precision but higher recall. However, a discriminant function method has higher precision and recall than the best BLAST approach and other methods shown here. CONCLUSION: Allowing term predictions to be counted correct if closely related to a correct term decreases the reliability of the accuracy score. As such we recommend using accuracy measures that require exact matching of predicted terms with curator assigned terms. Furthermore, we conclude that competing designs of BLAST-based GO term annotators can be effectively compared using an accuracy benchmarking approach. The most accurate annotation method was developed using data mining techniques. As such we recommend that designers of term annotators utilise accuracy benchmarking and data mining to ensure newly developed annotators are of high quality. Craig E. Jones, Ute Baumann, Alfred L. Brown |
BMC Bioinform. | 2 |