Blar i Department of Informatics på tittel
Viser treff 654-673 av 917
-
Phosphatidylcholine Cation—Tyrosine π Complexes: Motifs for Membrane Binding by a Bacterial Phospholipase C
(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
(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
(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
(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
(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
(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
(Peer reviewed; Journal article, 2008) -
A polynomial-time solvable case for the NP-hard problem Cutwidth
(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
(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
(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
(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
(Doctoral thesis, 2014-08-18) -
Precrec: fast and accurate precision-recall and ROC curve calculations in R
(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
(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
(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
(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 ... -
Prediction and analysis of protein structure
(Doctoral thesis, 2010-04-19)This thesis, which contains an introduction and four manuscripts, summarises my efforts during my the past four years to understand proteins, their structure and dynamics. The first manuscript presents a protocol that ... -
Prediction of Polycomb/Trithorax Response Elements using Support Vector Machines
(Master thesis, 2013-06-03)Polycomb/Trithorax Response Elements (PREs) are epigenetic elements that can maintain established transcriptional states over multiple cell divisions. Sequence motifs in known PREs have enabled genome-wide PRE prediction ... -
Present-biased optimization
(Journal article; Peer reviewed, 2022)This paper explores the behavior of present-biased agents, that is, agents who erroneously anticipate the costs of future actions compared to their real costs. Specifically, we extend the original framework proposed by ... -
A Pretty Good Formatting Pipeline
(Lecture Notes in Computer Science; 8225, Chapter; Peer reviewed, 2013)Proper formatting makes the structure of a program apparent and aids program comprehension. The need to format code arises in code generation and transformation, as well as in normal reading and editing situations. Commonly ...