• CHOPCHOP v3: expanding the CRISPR web toolbox beyond genome editing 

      Labun, Kornel; Montague, Tessa G.; Krause, Maximilian; Torres Cleuren, Yamila Nicole; Tjeldnes, Håkon; Valen, Eivind (Peer reviewed; Journal article, 2019-07-02)
      The CRISPR–Cas system is a powerful genome editing tool that functions in a diverse array of organisms and cell types. The technology was initially developed to induce targeted mutations in DNA, but CRISPR–Cas has now been ...
    • Chromatin accessibility established by Pou5f3, Sox19b and Nanog primes genes for activity during zebrafish genome activation 

      Pálfy, Máté; Schulze, Gunnar; Valen, Eivind; Vastenhouw, Nadine L. (Journal article; Peer reviewed, 2020-01)
      In many organisms, early embryonic development is driven by maternally provided factors until the controlled onset of transcription during zygotic genome activation. The regulation of chromatin accessibility and its ...
    • Chromatin and epigenetic features of long-range gene regulation 

      Harmston, Nathan; Lenhard, Boris (Peer reviewed; Journal article, 2013-06-13)
      The precise regulation of gene transcription during metazoan development is controlled by a complex system of interactions between transcription factors, histone modifications and modifying enzymes and chromatin conformation. ...
    • Classes of Intersection Digraphs with Good Algorithmic Properties 

      Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (Journal article; Peer reviewed, 2022)
      While intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions ...
    • Classes of intersection digraphs with good algorithmic properties 

      Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (Journal article; Peer reviewed, 2023)
      While intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions ...
    • Classification of protein structures 

      Sætre, Narve (Master thesis, 1999-12)
    • Classification of quadratic APN functions with coefficients in F2 for dimensions up to 9 

      Yu, Yuyin; Kaleyski, Nikolay Stoyanov; Budaghyan, Lilya; Li, Yongqiang (Journal article; Peer reviewed, 2020)
      Almost perfect nonlinear (APN) and almost bent (AB) functions are integral components of modern block ciphers and play a fundamental role in symmetric cryptography. In this paper, we describe a procedure for searching for ...
    • Classifying and Measuring Student Problems and Misconceptions 

      Rosbach, Alexander Hoem; Bagge, Anya Helene (Norsk informatikkonferanse, Chapter; Peer reviewed, 2013)
      In this paper we report on an attempt to classify student problems and mistakes, and measuring the frequency of particular problems in a firstsemester programming course. We also propose a scheme for annotating student ...
    • 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 ...
    • Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth 

      Bergougnoux, Benjamin; Bonnet, Édouard; Brettell, Nick; Kwon, O-Joung (Journal article; Peer reviewed, 2020)
      The Cut & Count technique and the rank-based approach have lead to single-exponential FPT algorithms parameterized by treewidth, that is, running in time 2^𝒪(tw)n^𝒪(1), for Feedback Vertex Set and connected versions of ...
    • Clustering to Given Connectivities 

      Golovach, Petr; Thilikos, Dimitrios M. (Peer reviewed; Journal article, 2019)
      We define a general variant of the graph clustering problem where the criterion of density for the clusters is (high) connectivity. In Clustering to Given Connectivities, we are given an n-vertex graph G, an integer k, and ...
    • Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances 

      Duarte, Gabriel; Oliveira, Mateus De Oliveira; Souza, Uéverton S. (Journal article; Peer reviewed, 2021)
      Clique-width and treewidth are two of the most important and useful graph parameters, and several problems can be solved efficiently when restricted to graphs of bounded clique-width or treewidth. Bounded treewidth implies ...
    • CO-expression Analysis of RNA-sequence Data from Parkinson's Disease Patients 

      Wimalarasan, Akilina (Master thesis, 2020-06-26)
      Parkinson’s disease is known as a progressive neurological disease characterized by motor symptoms. The motor symptoms are caused by neurodegeneration that causes dysfunctionalities in molecular functions crucial for ...
    • Code-based cryptography: A superficial introduction 

      Østerhus, Håkon Gjeraker (Master thesis, 2018-10-06)
      This thesis provides an overview of some known post-quantum cryptography schemes with special attention given to code-based schemes. It also discusses some challenges that may arise trying to implement a McEliece-like ...
    • Coded communication on the Internet 

      Kvifte, Ketil Mikalsen (Master thesis, 2019-06-26)
      The Internet is giving people many opportunities to interact, but for latency-sensitive activities, there is still room for improvement. It is not always good enough that messages arrive; some times they should arrive ...
    • Coding for passive RFID communication 

      Yang, Guang (Doctoral thesis, 2012-08-31)
      This dissertation elaborates on channel coding for reliable communication in passive RFID systems. RFID applications have been developed and used widely. Since a passive RFID tag has no power requirements, passive RFID has ...
    • Coding for Privacy in Distributed Computing 

      Schlegel, Reent (Doctoral thesis, 2023-04-21)
      I et distribuert datanettverk samarbeider flere enheter for å løse et problem. Slik kan vi oppnå mer enn summen av delene: samarbeid gjør at problemet kan løses mer effektivt, og samtidig blir det mulig å løse problemer ...
    • Coherence for Monoidal Groupoids in HoTT 

      Piceghello, Stefano (Journal article; Peer reviewed, 2020)
      We present a proof of coherence for monoidal groupoids in homotopy type theory. An important role in the formulation and in the proof of coherence is played by groupoids with a free monoidal structure; these can be represented ...
    • Coherent Conformational Degrees of Freedom as a Structural Basis for Allosteric Communication 

      Mitternacht, Simon; Berezovsky, Igor N. (Peer reviewed; Journal article, 2011-12-08)
      Conformational changes in allosteric regulation can to a large extent be described as motion along one or a few coherent degrees of freedom. The states involved are inherent to the protein, in the sense that they are visited ...