• Personalized Sketch-Based Brushing in Scatterplots 

      Fan, Chaoran; Hauser, Helwig (Journal article; Peer reviewed, 2019)
      Brushing is at the heart of most modern visual analytics solutions and effective and efficient brushing is crucial for successful interactive data exploration and analysis. As the user plays a central role in brushing, ...
    • Perspectives on automated composition of workflows in the life sciences [version 1; peer review: 2 approved] 

      Lamprecht, Anna-Lena; Palmblad, Magnus; Ison, Jon; Schwämmle, Veit; Al Manir, Mohammad Sadnan; Altintas, Ilkay; Baker, Christopher J. O.; Ben Hadj Amor, Ammar; Capella-Gutierrez, Salvador; Charonyktakis, Paulos; Crusoe, Michael R.; Gil, Yolanda; Goble, Carole; Griffin, Timothy J.; Groth, Paul; Ienasescu, Hans; Jagtap, Pratik; Kalaš, Matúš; Kasalica, Vedran; Khanteymoori, Alireza; Kuhn, Tobias; Mei, Hailiang; Ménager, Hervé; Möller, Steffen; Richardson, Robin A.; Robert, Vincent; Soiland-Reyes, Stian; Stevens, Robert; Szaniszlo, Szoke; Verberne, Suzan; Verhoeven, Aswin; Wolstencroft, Katherine (Journal article; Peer reviewed, 2021)
      Scientific data analyses often combine several computational tools in automated pipelines, or workflows. Thousands of such workflows have been used in the life sciences, though their composition has remained a cumbersome ...
    • Pharmacokinetics and transcriptional effects of the anti-salmon lice drug emamectin benzoate in Atlantic salmon (Salmo salar L.) 

      Olsvik, Pål Asgeir; Lie, Kai Kristoffer; Mykkeltvedt, Eva; Samuelsen, Ole Bent; Petersen, Kjell; Stavrum, Anne-Kristin; Lunestad, Bjørn Tore (Peer reviewed; Journal article, 2008-09-11)
      Background: Emamectin benzoate (EB) is a dominating pharmaceutical drug used for the treatment and control of infections by sea lice (Lepeophtheirus salmonis) on Atlantic salmon (Salmo salar L). Fish with an initial mean ...
    • Phase Transition in a System of Random Sparse Boolean Equations 

      Schilling, Thorsten Ernst; Zajac, Pavol (Chapter; Peer reviewed, 2012)
      Many problems, including algebraic cryptanalysis, can be transformed to a problem of solving a (large) system of sparse Boolean equations. In this article we study 2 algorithms that can be used to remove some redundancy ...
    • Phosphatidylcholine Cation—Tyrosine π Complexes: Motifs for Membrane Binding by a Bacterial Phospholipase C 

      Roberts, Mary F.; Gershenson, Anne; Reuter, Nathalie (Journal article; Peer reviewed, 2022-09-21)
      Phosphatidylinositol-specific phospholipase C (PI-PLC) enzymes are a virulence factor in many Gram-positive organisms. The specific activity of the Bacillus thuringiensis PI-PLC is significantly increased by adding ...
    • Plasma cortisol linked gene networks in hepatic and adipose tissues implicate corticosteroid binding globulin in modulating tissue glucocorticoid action and cardiovascular risk 

      Bankier, Sean Alexander; Michoel, Tom (Journal article; Peer reviewed, 2023)
      Genome-wide association meta-analysis (GWAMA) by the Cortisol Network (CORNET) consortium identified genetic variants spanning the SERPINA6/SERPINA1 locus on chromosome 14 associated with morning plasma cortisol, cardiovascular ...
    • Polyhedra and algorithms for problems bridging notions of connectivity and independence 

      Samer, Phillippe (Doctoral thesis, 2023-12-21)
      I denne avhandlinga interesserer vi oss for å finne delgrafer som svarer til utvalgte modeller for begrepene sammenheng og uavhengighet. I korthet betyr dette stabile (også kalt uavhengige) mengder med gitt kardinalitet, ...
    • Polyhedral results and stronger Lagrangean bounds for stable spanning trees 

      Samer, Phillippe; Haugland, Dag (Journal article; Peer reviewed, 2023)
      Given a graph G=(V,E) and a set C of unordered pairs of edges regarded as being in conflict, a stable spanning tree in G is a set of edges T inducing a spanning tree in G, such that for each {ei,ej}∈C, at most one of the ...
    • A Polynomial Kernel for Line Graph Deletion 

      Lochet, William; Eiben, Eduard (Journal article; Peer reviewed, 2020)
      The line graph of a graph G is the graph L(G) whose vertex set is the edge set of G and there is an edge between e,f ∈ E(G) if e and f share an endpoint in G. A graph is called line graph if it is a line graph of some ...
    • A Polynomial Kernel for Paw-Free Editing 

      Eiben, Eduard; Lochet, William; Saurabh, Saket (Journal article; Peer reviewed, 2020)
      For a fixed graph H, the H-free Edge Editing problem asks whether we can modify a given graph G by adding or deleting at most k edges such that the resulting graph does not contain H as an induced subgraph. The problem is ...
    • A polynomial-time algorithm for LO based on generalized logarithmic barrier functions 

      El Ghami, Mohamed; Ivanov, I.D.; Roos, C.; Steihaug, Trond (Peer reviewed; Journal article, 2008)
    • A polynomial-time solvable case for the NP-hard problem Cutwidth 

      Lilleeng, Simen (Master thesis, 2014-06-02)
      The Cutwidth problem is a notoriously hard problem, and its complexity is open on several interesting graph classes. Motivated by this fact we investigate the problem on superfragile graphs, a graph class on which the ...
    • Pooling Problems with Single-Flow Constraints 

      Haugland, Dag (Chapter; Peer reviewed, 2019)
      The pooling problem is a frequently studied extension of the traditional minimum cost flow problem, in which the composition of the flow is subject to restrictions. In a network consisting of three layers of nodes, the ...
    • Population dynamic regulators in an empirical predator-prey system 

      Frank, Anna-Simone Josefine; Subbey, S.; Kobras, Melanie; Gjøsæter, H. (Journal article; Peer reviewed, 2021)
      Capelin (Mallotus villosus) is a short-lived (1–4 years) fish species, that plays a crucial role by dominating the intermediate trophic level in the Barents Sea. Several episodes of extreme biomass decline (collapse) have ...
    • A Practical Adaptive Key Recovery Attack on the LGM (GSW-like) Cryptosystem 

      Fauzi, Prastudy; Hovd, Martha Norberg; Raddum, Håvard (Chapter, 2021)
      We present an adaptive key recovery attack on the leveled homomorphic encryption scheme suggested by Li, Galbraith and Ma (Provsec 2016), which itself is a modification of the GSW cryptosystem designed to resist key recovery ...
    • Practical Aspects of the Graph Parameter Boolean-width 

      Sharmin, Sadia (Doctoral thesis, 2014-08-18)
    • Precrec: fast and accurate precision-recall and ROC curve calculations in R 

      Saito, Takaya; Rehmsmeier, Marc (Peer reviewed; Journal article, 2017)
      The precision–recall plot is more informative than the ROC plot when evaluating classifiers on imbalanced datasets, but fast and accurate curve calculation tools for precision–recall plots are currently not available. We ...
    • Predicting employee absenteeism for cost effective interventions 

      Lawrance, Natalie; Petrides, George; Guerry, Marie-Anne (Journal article; Peer reviewed, 2021)
      This paper describes a decision support system designed for a Belgian Human Resource (HR) and Well-Being Service Provider. Their goal is to improve health and well-being in the workplace, and to this end, the task is to ...
    • Predicting Gene Regulatory Elements in Silico on a Genomic Scale 

      Brazma, Alvis; Jonassen, Inge; Vilo, Jaak; Ukkonen, Esko (Journal article, 1998-05-18)
      We performed a systematic analysis of gene upstream regions in the yeast genome for occurrences of regular expression-type patterns with the goal of identifying potential regulatory elements. To achieve this goal, we have ...
    • Predicting Loss of Inference Accuracy in Bounded Tree-Width Bayesian Networks 

      Rosland, Kristian (Master thesis, 2019-09-04)
      A Bayesian network (BN) is a compact way to represent a joint probability distribution graphically. The BN consists of a structure in the form of a directed acyclic graph (DAG) and a set of parameters. The nodes of the DAG ...