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

Björn Nilsson

dblp:32/3213 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2019
0000-0001-5542-0254ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 1 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 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
3 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
0.522019
MPRAscore: robust and non-parametric analysis of massively parallel reporter assays · Bioinform. 2019
Ultrasome: efficient aberration caller for copy number studies of ultra-high resolution · Bioinform. 2009
Bioinformatics and computational biology
massively parallel reporter assay
0.412019
MPRAscore: robust and non-parametric analysis of massively parallel reporter assays · Bioinform. 2019
Bioinformatics and computational biology › gene regulation
regulatory variant analysis
0.412019
MPRAscore: robust and non-parametric analysis of massively parallel reporter assays · Bioinform. 2019
Bioinformatics and computational biology › biological network › network biology › network inference › gene regulatory network inference
gaussian graphical model
0.212013
Ultranet: efficient solver for the sparse inverse covariance selection problem in gene network modeling · Bioinform. 2013
Bioinformatics and computational biology › cancer genomics
copy number analysis
0.112009
Ultrasome: efficient aberration caller for copy number studies of ultra-high resolution · Bioinform. 2009

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

variance regularization · 0.4permutation testing · 0.4sparse inverse covariance selection · 0.2convex optimization · 0.2segmentation algorithm · 0.1
YearPublicationVenuePosition
2019 MPRAscore: robust and non-parametric analysis of massively parallel reporter assays
abstract
MOTIVATION: Massively parallel reporter assays (MPRA) enable systematic screening of DNA sequence variants for effects on transcriptional activity. However, convenient analysis tools are still needed. RESULTS: We introduce MPRAscore, a novel tool to infer allele-specific effects on transcription from MPRA data. MPRAscore uses a weighted, variance-regularized method to calculate variant effect sizes robustly, and a permutation approach to test for significance without assuming normality or independence. AVAILABILITY AND IMPLEMENTATION: Source code (C++), precompiled binaries and data used in the paper at https://github.com/abhisheknrl/MPRAscore and https://www.ncbi.nlm.nih.gov/bioproject/PRJNA554195. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Abhishek Niroula, Ram Ajore, Björn Nilsson
Bioinform.3
2013 Ultranet: efficient solver for the sparse inverse covariance selection problem in gene network modeling
abstract
Abstract Summary: Graphical Gaussian models (GGMs) are a promising approach to identify gene regulatory networks. Such models can be robustly inferred by solving the sparse inverse covariance selection (SICS) problem. With the high dimensionality of genomics data, fast methods capable of solving large instances of SICS are needed. We developed a novel network modeling tool, Ultranet, that solves the SICS problem with significantly improved efficiency. Ultranet combines a range of mathematical and programmatical techniques, exploits the structure of the SICS problem and enables computation of genome-scale GGMs without compromising analytic accuracy. Availability and implementation: Ultranet is implemented in C++ and available at www.broadinstitute.org/ultranet. Contact: [email protected] or [email protected] Supplementary information: Supplementary data are available at Bioinformatics online.
Linnea Järvstråt, Urban Gullberg, Björn Nilsson
Bioinform.4
2009 Ultrasome: efficient aberration caller for copy number studies of ultra-high resolution
abstract
Abstract Motivation: Multimillion-probe microarrays allow detection of gains and losses of chromosomal material at unprecedented resolution. However, the data generated by these arrays are several-fold larger than data from earlier platforms, creating a need for efficient analysis tools that scale robustly with data size. Results: We developed a new aberration caller, Ultrasome, that delineates genomic changes-of-interest with dramatically improved efficiency. Ultrasome shows near-linear computational complexity and processes latest generation copy number arrays about 10 000 times faster than standard methods with preserved analytic accuracy. Availability: www.broad.mit.edu/ultrasome. Contact: [email protected] Supplementary information: Supplementary data are available at Bioinformatics online.
Björn Nilsson, Fátima Al-Shahrour, Anne E. Carpenter, Benjamin L. Ebert
Bioinform.1
2008 A compression algorithm for pre-simulated Monte Carlo p-value functions: Application to the ontological analysis of microarray studies
Björn Nilsson
Pattern Recognit. Lett.1
2003 A fast algorithm for level set-like active contours
Björn Nilsson, Anders Heyden
Pattern Recognit. Lett.1
1991 Organisation's IT Needs in the Next Decade - The Swedish Vision
Björn Nilsson
CAiSE1