• Accurate analysis of genuine CRISPR editing events with ampliCan 

      Labun, Kornel; Guo, Xiaoge; Chavez, Alejandro; Church, George M.; Gagnon, James A.; Valen, Eivind (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∗ 

      Brause, Christoph; Golovach, Petr; Martin, Barnaby; Ochem, Pascal; Paulusma, Daniël; Smith, Siani (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 

      Bergmann, Morten; Msakni, Mohamed Kais; Hemmati, Ahmad; Fagerholt, Kjetil (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 

      Marcinkowski, Leszek; Rahman, Talal; Loneland, Atle; Valdman, Jan (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 

      Indrøy, John Petter (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 

      Ellingsen, Tor Kristian (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 

      Øygarden, Morten (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 

      Haeri, Seyed Hossein; Thompson, Peter W; Van Roy, Peter; Haveraaen, Magne; Davies, Neil J; Barash, Mikhail; Hammond, Kevin; Chapman, James (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 

      Simonov, Kirill (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 

      Fomin, Fedor; Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios M. (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 

      Chekuri, Chandra; Inamdar, Tanmay Nitin; Quanrud, Kent; Varadarajan, Kasturi; Zhang, Zhao (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 

      Egeland, Christian (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 

      Dyrseth, Jakob (Master thesis, 2022-06-01)
    • Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes 

      Lima, Paloma T.; van Leeuwen, Erik Jan; van der Wegen, Marieke (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 ...
    • Alias - Designing an application for creating personalised comics aimed for the Children and Youth Clinic at Haukeland University Hospital 

      Syslak, Idar Antonsen (Master thesis, 2019-12)
      Information that is handed out by hospitals is not always personalised for patients and their motivation is often lacking. Communication between healthcare and patients is mostly textual and verbal, sometimes overwhelming, ...
    • Aligning a Splice Graph to a Genomic Sequence 

      Ølberg, Øyvind (Master thesis, 2005-06-01)
    • An Algorithm for k-insertion into a Binary Heap 

      Berg, Marie Natland (Master thesis, 2023-06-01)
      In this thesis, we present an algorithm for k-insertion into a binary heap running in worst-case time O(k+log(k)·log(n+k)), improving the standard k-insertion algorithm for binary heaps in terms of worst-case running time. ...
    • An Automated Method for Converting 3D Meshes into Editable 2D Vector Graphics 

      Ure, Vidar Hartveit (Master thesis, 2019-06-29)
    • An Effective Generic Lasso Selection Tool for Multiselection 

      Lie, Ole Magnus (Master thesis, 2020-06-20)
      Multiselection is widely available in the graphical user interfaces of common applications, often through rectangular or row-wise selection tools. Lasso selection, though often provided in image manipulation applications, ...
    • An efficient implementation of a test for EA-equivalence 

      Heggebakk, Marie (Master thesis, 2022-06-01)
      We implement an algorithm for testing EA-equivalence between vectorial Boolean functions proposed by Kaleyski in the C programming language, and observe that it reduces the running time (as opposed to the original Magma ...