Recent Submissions

  • Parameterized Complexity of Feature Selection for Categorical Data Clustering 

    Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr; Simonov, Kirill (Journal article; Peer reviewed, 2021)
    We develop new algorithmic methods with provable guarantees for feature selection in regard to categorical data clustering. While feature selection is one of the most common approaches to reduce dimensionality in practice, ...
  • Diverse Collections in Matroids and Graphs 

    Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Journal article; Peer reviewed, 2021)
    We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from graph theory. The input to the Weighted Diverse ...
  • Deep conservation of ribosome stall sites across RNA processing genes 

    Chyzynska, Katarzyna; Labun, Kornel; Jones, Carl Matthew; Grellscheid, Sushma Nagaraja; Valen, Eivind Dale (Journal article; Peer reviewed, 2021)
    The rate of translation can vary depending on the mRNA template. During the elongation phase the ribosome can transiently pause or permanently stall. A pause can provide the nascent protein with the time to fold or be ...
  • Fixed cardinality stable sets 

    Samer, Phillippe; Haugland, Dag (Journal article; Peer reviewed, 2021)
    Given an undirected graph G=(V,E) and a positive integer k in {1, ..., |V|}, we initiate the combinatorial study of stable sets of cardinality exactly k in G. Our aim is to instigate the polyhedral investigation of the ...
  • CHOPCHOP v2: a web tool for the next generation of CRISPR genome engineering 

    Valen, Eivind; Labun, Kornel; Montague, Tessa G.; Gagnon, James A.; Thyme, Summer B. (Journal article; Peer reviewed, 2016)
    In just 3 years CRISPR genome editing has transformed biology, and its popularity and potency continue to grow. New CRISPR effectors and rules for locating optimum targets continue to be reported, highlighting the need for ...
  • Improving the Usability of Refactoring Tools for Software Change Tasks 

    Eilertsen, Anna Maria (Doctoral thesis, 2021-12-22)
    All successful software gets changed. Developers undertake software change tasks by editing the software’s source code to meet new demands. Often, the edits they make are aligned with refactorings and can be performed ...
  • Automatic interpretation of salmon scales using deep learning 

    Vabø, Rune; Moen, Endre; Smolinski, Szymon; Husebø, Åse; Handegard, Nils Olav; Malde, Ketil (Journal article; Peer reviewed, 2021)
    For several fish species, age and other important biological information is manually inferred from visual scrutinization of scales, and reliable automatic methods are not widely available. Here, we apply Convolutional ...
  • A deep learning-based method to identify and count pelagic and mesopelagic fishes from trawl camera images 

    Allken, Vaneeda; Rosen, Shale Pettit; Handegard, Nils Olav; Malde, Ketil (Journal article; Peer reviewed, 2021)
    Fish counts and species information can be obtained from images taken within trawls, which enables trawl surveys to operate without extracting fish from their habitat, yields distribution data at fine scale for better ...
  • Modelling Oscillatory Patterns in the Bovine Estrous Cycle with Boolean Delay Equations 

    Berg, Mascha; Plöntzke, Julia; Siebert, Heike; Röblitz, Susanna (Journal article; Peer reviewed, 2021)
    Boolean delay equations (BDEs), with their relatively simple and intuitive mode of modelling, have been used in many research areas including, for example, climate dynamics and earthquake propagation. Their application to ...
  • Clique-Based Neural Associative Memories 

    Abolpour Mofrad, Asieh (Doctoral thesis, 2021-11-15)
    Auto-associative memories store a set of patterns and retrieve them by resorting to a part of their contents. This thesis focuses on developing and extending a type of associative memories relying on a sort of coded neural ...
  • Interactive Multimodal Imaging Visualization for Multiple Sclerosis Lesion Analysis 

    Sugathan, Sherin; Bartsch, Hauke; Riemer, Frank; Grüner, Eli Renate; Lawonn, Kai; Smit, Noeska Natasja (Journal article; Peer reviewed, 2021)
    Multiple Sclerosis (MS) is a brain disease that is diagnosed and monitored extensively through MRI scans. One of the criteria is the appearance of so-called brain lesions. The lesions show up on MRI scans as regions with ...
  • Improving Interaction in Visual Analytics using Machine Learning 

    Fan, Chaoran (Doctoral thesis, 2021-11-05)
    Interaction is one of the most fundamental components in visual analytical systems, which transforms people from mere viewers to active participants in the process of analyzing and understanding data. Therefore, fast and ...
  • Selected Topics in Cryptanalysis of Symmetric Ciphers 

    Indrøy, John Petter (Doctoral thesis, 2021-10-27)
    It is well established that a symmetric cipher may be described as a system of Boolean polynomials, and that the security of the cipher cannot be better than the difficulty of solving said system. Compressed Right-Hand ...
  • Mostar index and edge Mostar index of polymers 

    Ghanbari, Nima; Alikhani, Saeid (Journal article; Peer reviewed, 2021)
    Let G=(V,E) be a graph and e=uv∈E. Define nu(e,G) be the number of vertices of G closer to u than to v. The number nv(e,G) can be defined in an analogous way. The Mostar index of G is a new graph invariant defined as ...
  • Semantics of multiway dataflow constraint systems 

    Haveraaen, Magne; Järvi, Jaakko (Journal article; Peer reviewed, 2021)
    Multiway dataflow constraint systems (MDCS) is a programming model where statements are not executed in a predetermined order. Rather, individual methods are selected from specific method sets and then executed to achieve ...
  • Specifying with syntactic theory functors 

    Haveraaen, Magne; Roggenbach, Marcus (Journal article; Peer reviewed, 2020)
    We propose a framework, syntactic theory functors (STFs), for creating syntactic structuring mechanisms for specification languages. Good support for common reuse patterns is important for systematically developing ...
  • Typical Sequences Revisited - Computing Width Parameters of Graphs 

    Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne (Journal article; Peer reviewed, 2021)
    In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized ...
  • b-Coloring Parameterized by Clique-Width 

    Jaffke, Lars; Lima, Paloma Thome de; Lokshtanov, Daniel (Journal article; Peer reviewed, 2021)
    We provide a polynomial-time algorithm for b-Coloring on graphs of constant clique-width. This unifies and extends nearly all previously known polynomial-time results on graph classes, and answers open questions posed by ...
  • Three problems on well-partitioned chordal graphs 

    Ahn, Jungho; Jaffke, Lars; Kwon, O-Joung; Lima, Paloma Thome de (Journal article; Peer reviewed, 2021)
    In this work, we solve three problems on well-partitioned chordal graphs. First, we show that every connected (resp., 2-connected) well-partitioned chordal graph has a vertex that intersects all longest paths (resp., longest ...
  • On properties of bent and almost perfect nonlinear functions 

    Davidova, Diana (Doctoral thesis, 2021-09-14)
    (Vectorial) Boolean functions play an important role in all domains related to computer science, and in particular, in cryptography. The safety of a cryptosystem is quantified via some characteristics of (vectorial) Boolean ...

View more