Blar i Department of Informatics på tittel
Viser treff 121-140 av 1113
-
Characteristics of Pyrosequencing Data – Analysis, Methods, and Tools
(Doctoral thesis, 2013-06-17)The introduction of this thesis provides background knowledge on the 454 sequencing technology and a detailed review of the most relevant sequencing artifacts. Chapter 1 puts the 454 sequencing technology into a historical ... -
Chatbot Generation for Open Data Accessibility
(Master thesis, 2023-11-20)Open data, despite its availability, often remains inaccessible to the average person due to complex data formats and technical barriers. This challenge hinders the realization of open data’s transformative potential. ... -
Choice of parameter for DP-based FPT algorithms: four case studies
(Doctoral thesis, 2015-09-07)This thesis studies dynamic programming algorithms and structural parameters used when solving computationally hard problems. In particular, we look at algorithms that make use of structural decompositions to overcome ... -
CHOPCHOP v2: a web tool for the next generation of CRISPR genome engineering
(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 ... -
CHOPCHOP v3: expanding the CRISPR web toolbox beyond genome editing
(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
(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
(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
(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
(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 and computational search for planar functions in characteristic 3
(Master thesis, 2022-06-10) -
Classification of protein structures
(Master thesis, 1999-12) -
Classification of quadratic APN functions with coefficients in F2 for dimensions up to 9
(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
(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
(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
(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
(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
(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
(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
(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
(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 ...