Blar i Department of Informatics på dokumenttype "Peer reviewed"
Viser treff 1-20 av 590
-
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion
(Journal article; Peer reviewed, 2020)In the Split Vertex Deletion (SVD) problem, the input is an n-vertex undirected graph G and a weight function w: V(G) → ℕ, and the objective is to find a minimum weight subset S of vertices such that G-S is a split graph ... -
Accuracy and efficiency of germline variant calling pipelines for human genome data
(Journal article; Peer reviewed, 2020)Advances in next-generation sequencing technology have enabled whole genome sequencing (WGS) to be widely used for identification of causal variants in a spectrum of genetic-related disorders, and provided new insight into ... -
Accurate analysis of genuine CRISPR editing events with ampliCan
(Peer reviewed; Journal article, 2019)We present ampliCan, an analysis tool for genome editing that unites highly precise quantification and visualization of genuine genome editing events. ampliCan features nuclease-optimized alignments, filtering of experimental ... -
Acyclic, star, and injective colouring: bounding the diameter∗
(Journal article; Peer reviewed, 2022)We examine the effect of bounding the diameter for a number of natural and well-studied variants of the COLOURING problem. A colouring is acyclic, star, or injective if any two colour classes induce a forest, star forest ... -
An adaptive heuristic for Feeder Network Design with optional transshipment
(Journal article; Peer reviewed, 2023)This paper studies the Feeder Network Design Problem (FNDP), which considers the design of a minimum cost liner shipping network for the transportation of cargo (containers) between a given hub port and a set of feeder ... -
Additive Schwarz preconditioner for the finite volume element discretization of symmetric elliptic problems
(Peer reviewed; Journal article, 2015-09-25)A symmetric and a nonsymmetric variant of the additive Schwarz preconditioner are proposed for the solution of a class of finite volume element discretization of the symmetric elliptic problem in two dimensions, with large ... -
Algebraic Reasoning About Timeliness
(Journal article; Peer reviewed, 2023)Designing distributed systems to have predictable performance under high load is difficult because of resource exhaustion, non-linearity, and stochastic behaviour. Timeliness, i.e., delivering results within defined time ... -
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
(Journal article; Peer reviewed, 2020)In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be vertex removal, edge removal, edge contraction, or edge ... -
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
(Journal article; Peer reviewed, 2023)In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be vertex deletion, edge deletion, edge contraction, or ... -
Algorithms for covering multiple submodular constraints and applications
(Journal article; Peer reviewed, 2022)We consider the problem of covering multiple submodular constraints. Given a finite ground set N, a weight function \(w: N \rightarrow \mathbb {R}_+\), r monotone submodular functions \(f_1,f_2,\ldots ,f_r\) over N and ... -
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes
(Journal article; Peer reviewed, 2020)Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its ... -
An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem
(Journal article; Peer reviewed, 2023)In this paper, we propose an adaptive large neighborhood search-based matheuristic algorithm to solve a multi-product many-to-many maritime inventory routing problem. The problem addresses a short sea inventory routing ... -
Analysis of Trivium Using Compressed Right Hand Side Equations
(Chapter; Peer reviewed, 2012)We study a new representation of non-linear multivariate equations for algebraic cryptanalysis. Using a combination of multiple right hand side equations and binary decision diagrams, our new representation allows a very ... -
Annotating otoliths with a deep generative model
(Journal article; Peer reviewed, 2023)Otoliths are a central information source for fish ecology and stock management, conveying important data about age and other life history for individual fish. Traditionally, interpretation of otoliths has required skilled ... -
Application of quantitative transcriptomics in evaluating the ex vivo effects of per- and polyfluoroalkyl substances on Atlantic cod (Gadus morhua) ovarian physiology
(Journal article; Peer reviewed, 2021)Because of their global consumption and persistence, per- and polyfluoroalkyl substances (PFASs), are ubiquitously distributed in the environment, as well as in wildlife and humans. In the present study, we have employed ... -
An Approach to Flexible Multilevel Modelling
(Peer reviewed; Journal article, 2018-07-12)Multilevel modelling approaches tackle issues related to lack of flexibility and mixed levels of abstraction by providing features like deep modelling and linguistic extension. However, the lack of a clear consensus on ... -
Approximating Acyclicity Parameters of Sparse Hypergraphs
(Peer reviewed; Journal article, 2009)The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello (PODS'99, PODS'01) in order to extend the concept of hypergraph acyclicity. These notions were further generalized ... -
Approximating cube roots of integers, after Heron’s Metrica III.20
(Peer reviewed; Journal article, 2013) -
Approximating Long Cycle Above Dirac's Guarantee
(Journal article; Peer reviewed, 2023)Parameterization above (or below) a guarantee is a successful concept in parameterized algorithms. The idea is that many computational problems admit "natural" guarantees bringing to algorithmic questions whether a better ... -
Approximation algorithms in combinatorial scientific computing
(Journal article; Peer reviewed, 2019)We survey recent work on approximation algorithms for computing degreeconstrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of ...