Browsing Department of Informatics by Title
Now showing items 1-20 of 762
-
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 ... -
A 43k Kernel for Planar Dominating Set using Computer-Aided Reduction Rule Discovery
(Master thesis, 2016-02-15)In this thesis we explore the technique of Region Decomposition for finding kernels for Planar Dominating Set. We redefine some concepts used in earlier work, fixing some ambiguities on the way. From those concepts we end ... -
A Domain-Specific Language for the Development of Heterogeneous Multi-Robot Systems
(Master thesis, 2019-06-28)Robots are becoming more advanced each year and will increasingly become a bigger part of our lives. This thesis explores how model-driven software engineering can be used in the development of heterogeneous multi-robot ... -
A Modular Approach for Creating Web Applications with 3D Geology Using React and X3DOM
(Master thesis, 2019-06-29)The thesis details the work for creating a web application that allows a user to see a visualization for geological data like topography, seismic data and well measurements from the subsurface. This application uses the ... -
A Snakemake workflow for analysing alternative splicing events from short-read RNA-seq data
(Master thesis, 2022-04-13) -
A Visual Analytics Dashboard for Mental Health Therapists
(Master thesis, 2019-06-29)Mental health disorders are a significant problem throughout the western world. Cognitive Behavioral Therapy (CBT) is a common treatment form for these disorders. Internet-based Cognitive Behavioral Therapy (iCBT) provides ... -
Abstractions for Language-Independent Program Transformations
(Doctoral thesis, 2007-06-27) -
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 ... -
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 Attack on Small Scale Variants of AES using Compressed Right Hand Sides
(Master thesis, 2018-04-07)The Advanced Encryption Standard is probably the most used symmetric encryption cipher in use today, which makes it particularly interesting for cryptanalysis. This thesis attacks smallscale variants of AES through a ... -
Algebraic Cryptanalysis of Cryptographic Schemes with Extension Field Structure
(Doctoral thesis, 2021-09-06)Post-Quantum Cryptography studies cryptographic algorithms that quantum computers cannot break. Recent advances in quantum computing have made this kind of cryptography necessary, and research in the field has surged over ... -
Algorithmic Complexity of Clustering and Low-Rank Approximation Problems
(Doctoral thesis, 2021-03-29)The two most popular unsupervised learning problems are k-Clustering and Low-Rank Approximation. Consider a set of n datapoints, in the k-Clustering problem, the objective is to partition these points into k clusters and ... -
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 ... -
Algorithms for Linearly Ordered Boolean Formulas
(Master thesis, 2016-06-30)This thesis considers a class of propositional boolean formulas on which various problems related to satisfiability are efficiently solvable by a dynamic programming algorithm. It mainly consists of two larger parts: the ... -
Algorithms for rainbow vertex colouring diametral path graphs
(Master thesis, 2022-06-01) -
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 ... -
Aligning a Splice Graph to a Genomic Sequence
(Master thesis, 2005-06-01) -
An Automated Method for Converting 3D Meshes into Editable 2D Vector Graphics
(Master thesis, 2019-06-29) -
An Indoor/Outdoor Air Quality Relationship Analysis Using Internet of Things
(Master thesis, 2019-06-29)Exposure to high levels of air pollution is a significant cause of premature mortality. In Norway, people spend about 90% of their time indoors. Therefore, the relationship between indoor and outdoor concentrations of air ...