Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ole Nørregaard Jensen

dblp:64/6802 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0003-1862-8528ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4

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%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › omics data analysis
omics data clustering
0.422018
VSClust: feature-based variance-sensitive clustering of omics data · Bioinform. 2018
A simple and fast method to determine the parameters for fuzzy c-means cluster analysis · Bioinform. 2010
Bioinformatics and computational biology › proteomics › post-translational modification prediction
phosphorylation site prediction
0.112007
NetPhosYeast: prediction of protein phosphorylation sites in yeast · Bioinform. 2007
Bioinformatics and computational biology
protein function prediction
0.112007
NetPhosYeast: prediction of protein phosphorylation sites in yeast · Bioinform. 2007
Bioinformatics and computational biology
proteomics
0.112006
Integration of gel-based proteome data with pProRep · Bioinform. 2006

Methods — techniques the papers use, named apart from their topics

statistical testing · 0.3fuzzy clustering · 0.3web application · 0.1relational database · 0.1validation indices · 0.1randomized dataset evaluation · 0.1fuzzy c-means · 0.1neural network · 0.1
YearPublicationVenuePosition
2018 VSClust: feature-based variance-sensitive clustering of omics data
abstract
Motivation: Data clustering is indispensable for identifying biologically relevant molecular features in large-scale omics experiments with thousands of measurements at multiple conditions. Optimal clustering results yield groups of functionally related features that may include genes, proteins and metabolites in biological processes and molecular networks. Omics experiments typically include replicated measurements of each feature within a given condition to statistically assess feature-specific variation. Current clustering approaches ignore this variation by averaging, which often leads to incorrect cluster assignments. Results: We present VSClust that accounts for feature-specific variance. Based on an algorithm derived from fuzzy clustering, VSClust unifies statistical testing with pattern recognition to cluster the data into feature groups that more accurately reflect the underlying molecular and functional behavior. We apply VSClust to artificial and experimental datasets comprising hundreds to >80 000 features across 6-20 different conditions including genomics, transcriptomics, proteomics and metabolomics experiments. VSClust avoids arbitrary averaging methods, outperforms standard fuzzy c-means clustering and simplifies the data analysis workflow in large-scale omics studies. Availability and implementation: Download VSClust at https://bitbucket.org/veitveit/vsclust or access it through computproteomics.bmb.sdu.dk/Apps/VSClust. Supplementary information: Supplementary data are available at Bioinformatics online.
Veit Schwämmle, Ole Nørregaard Jensen
Bioinform.2
2010 A simple and fast method to determine the parameters for fuzzy c-means cluster analysis
abstract
MOTIVATION: Fuzzy c-means clustering is widely used to identify cluster structures in high-dimensional datasets, such as those obtained in DNA microarray and quantitative proteomics experiments. One of its main limitations is the lack of a computationally fast method to set optimal values of algorithm parameters. Wrong parameter values may either lead to the inclusion of purely random fluctuations in the results or ignore potentially important data. The optimal solution has parameter values for which the clustering does not yield any results for a purely random dataset but which detects cluster formation with maximum resolution on the edge of randomness. RESULTS: Estimation of the optimal parameter values is achieved by evaluation of the results of the clustering procedure applied to randomized datasets. In this case, the optimal value of the fuzzifier follows common rules that depend only on the main properties of the dataset. Taking the dimension of the set and the number of objects as input values instead of evaluating the entire dataset allows us to propose a functional relationship determining the fuzzifier directly. This result speaks strongly against using a predefined fuzzifier as typically done in many previous studies. Validation indices are generally used for the estimation of the optimal number of clusters. A comparison shows that the minimum distance between the centroids provides results that are at least equivalent or better than those obtained by other computationally more expensive indices.
Veit Schwämmle, Ole Nørregaard Jensen
Bioinform.2
2007 NetPhosYeast: prediction of protein phosphorylation sites in yeast
abstract
UNLABELLED: We here present a neural network-based method for the prediction of protein phosphorylation sites in yeast--an important model organism for basic research. Existing protein phosphorylation site predictors are primarily based on mammalian data and show reduced sensitivity on yeast phosphorylation sites compared to those in humans, suggesting the need for an yeast-specific phosphorylation site predictor. NetPhosYeast achieves a correlation coefficient close to 0.75 with a sensitivity of 0.84 and specificity of 0.90 and outperforms existing predictors in the identification of phosphorylation sites in yeast. AVAILABILITY: The NetPhosYeast prediction service is available as a public web server at http://www.cbs.dtu.dk/services/NetPhosYeast/.
Christian R. Ingrell, Martin L. Miller, Ole Nørregaard Jensen, Nikolaj Blom
Bioinform.3
2006 Integration of gel-based proteome data with pProRep
abstract
UNLABELLED: pProRep is a web application integrating electrophoretic and mass spectral data from proteome analyses into a relational database. The graphical web-interface allows users to upload, analyse and share experimental proteome data. It offers researchers the possibility to query all previously analysed datasets and can visualize selected features, such as the presence of a certain set of ions in a peptide mass spectrum, on the level of the two-dimensional gel. AVAILABILITY: The pProRep package and instructions for its use can be downloaded from http://www.ptools.ua.ac.be/pProRep. The application requires a web server that runs PHP 5 (http://www.php.net) and MySQL. Some (non-essential) extensions need additional freely available libraries: details are described in the installation instructions.
Kris Laukens, Rune Matthiesen, Filip Lemière, Eddy Esmans, Harry Van Onckelen, Ole Nørregaard Jensen, Erwin Witters
Bioinform.6