Blar i Department of Informatics på tittel
Viser treff 9-28 av 916
-
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 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 Attacks on the Encryption Scheme HADESMiMC
(Master thesis, 2023-11-20)HADESMiMC is a recent symmetric cryptographic algorithm working with elements in a finite field. It is proposed as a candidate cipher for secure data transfers using Multiparty Computation (MPC). MPC is particularly useful ... -
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 ... -
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 ... -
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 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 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 ... -
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 ... -
Analysis, classification and construction of optimal cryptographic Boolean functions
(Doctoral thesis, 2021-01-04)Modern cryptography is deeply founded on mathematical theory and vectorial Boolean functions play an important role in it. In this context, some cryptographic properties of Boolean functions are defined. In simple terms, ...