Department of Informatics
Nye registreringer
-
Automated cell type annotation and exploration of single-cell signaling dynamics using mass cytometry
(Journal article; Peer reviewed, 2024)Mass cytometry by time-of-flight (CyTOF) is an emerging technology allowing for in-depth characterization of cellular heterogeneity in cancer and other diseases. Unfortunately, high-dimensional analyses of CyTOF data remain ... -
Single-Cell Gene-Regulatory Networks of Advanced Symptomatic Atherosclerosis
(Journal article; Peer reviewed, 2024)Background: While our understanding of the single-cell gene expression patterns underlying the transformation of vascular cell types during the progression of atherosclerosis is rapidly improving, the clinical and ... -
On planarity of graphs in homotopy type theory
(Journal article; Peer reviewed, 2024)In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces and maps of graphs embedded in the sphere, in homotopy type theory (HoTT). This allows us ... -
PRPF8-mediated dysregulation of hBrr2 helicase disrupts human spliceosome kinetics and 5´-splice-site selection causing tissue-specific defects
(Journal article; Peer reviewed, 2024)The carboxy-terminus of the spliceosomal protein PRPF8, which regulates the RNA helicase Brr2, is a hotspot for mutations causing retinitis pigmentosa-type 13, with unclear role in human splicing and tissue-specificity ... -
The Structure of Paradoxes in a Logic of Sentential Operators
(Journal article; Peer reviewed, 2024)Any language L of classical logic, of first- or higher-order, is expanded with sentential quantifiers and operators. The resulting language L+, capable of self-reference without arithmetic or syntax encoding, can serve as ... -
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
(Journal article; Peer reviewed, 2024)In this paper, we showcase the class XNLP as a natural place for many hard problems parameterized by linear width measures. This strengthens existing W[1]-hardness proofs for these problems, since XNLP-hardness implies ... -
Finding 3-to-1 APN functions using Birthday Attacks
(Master thesis, 2024-10-01) -
Investigations into Graph-theoretical Constructions in Homotopy Type Theory
(Doctoral thesis, 2024-12-13)Denne avhandlingen presenterer en konstruktiv og bevisrelevant utvikling av grafteorikonsepter innen Homotopi-typeteori (HoTT). HoTT er en utvidelse av Martin-Löfs intuisjonistiske typeteori og inkorporerer nyskapende ... -
Material Set Theory in Homotopy Type Theory
(Doctoral thesis, 2024-11-29)Denne avhandlingen undersøker modeller av materiell mengdelære i homotopi typeteori (HoTT), det vil si, tolkninger av språket for mengdelære inn i HoTT slik at tolkningene av aksiomene i mengdelære kan vises å holde. En ... -
Towards Practical High-Quality Software
(Doctoral thesis, 2024-11-27)Høy programvarekvalitet er viktig. Dette blir tydeligere ettersom samfunnet blir stadig mer digitalisert. For eksempel anslås dårlig programvarekvalitet å ha kostet det amerikanske samfunnet $2.41 billioner i 2022. Dårlig ... -
Semantics-Based Version Control for Feature Model Evolution Plans
(Journal article; Peer reviewed, 2023)A software product line (SPL) models closely related software systems by capitalizing on the high similarity of the products by organizing them into common and variable parts. To ensure successful long-term development, ... -
Optimal Parameterized Algorithms for Solving NP-Hard Problems in Topology
(Doctoral thesis, 2024-11-22)Denne avhandlingen fokuserer på tre sentrale utfordringer innen algoritmisk topologi: homologibeliggenhetsproblemet, det minste omkransede kjedeproblemet og underflategjenkjenningsproblemet. Selv om disse problemene er ... -
The ELIXIR Biodiversity Community: Understanding short- and long-term changes in biodiversity
(Journal article; Peer reviewed, 2024)Biodiversity loss is now recognised as one of the major challenges for humankind to address over the next few decades. Unless major actions are taken, the sixth mass extinction will lead to catastrophic effects on the ... -
Uncovering dynamic structures within cyclic attractors of asynchronous Boolean networks with spectral clustering
(Journal article; Peer reviewed, 2024)Boolean models provide an intuitive framework for the investigation of complex biological networks. Dynamics that implement asynchronous update rules, in particular, can help embody the complexity arising from non-deterministic ... -
Two-Sets Cut-Uncut on Planar Graphs
(Journal article; Peer reviewed, 2024)We study Two-Sets Cut-Uncut on planar graphs. Therein, one is given an undirected planar graph G and two disjoint sets S and T of vertices as input. The question is, what is the minimum number of edges to remove from G, ... -
Correlation Clustering with Vertex Splitting
(Journal article; Peer reviewed, 2024)We explore CLUSTER EDITING and its generalization CORRELATION CLUSTERING with a new operation called permissive vertex splitting which addresses finding overlapping clusters in the face of uncertain information. We determine ... -
Correlated multimodal imaging in life sciences: lessons learnt
(Journal article; Peer reviewed, 2024-07-30)Correlated Multimodal Imaging (CMI) gathers information about the same specimen with two or more modalities that–combined–create a composite and complementary view of the sample (including insights into structure, function, ... -
The parameterized complexity of finding minimum bounded chains
(Journal article; Peer reviewed, 2024)Finding the smallest d-chain with a specific (d − 1)-boundary in a simplicial complex is known as the Minimum Bounded Chain problem (MBCd). MBCd is NP-hard for all d ≥2. In this paper, we prove that it is also W[1]-hard ... -
An Inductive Bias for Emergent Communication in a Continuous Setting
(Journal article; Peer reviewed, 2024)We study emergent communication in a multi-agent reinforcement learning setting, where the agents solve cooperative tasks and have access to a communication channel. The communication channel may consist of either discrete ... -
Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages
(Journal article; Peer reviewed, 2024)Formal, mathematically rigorous programming language semantics are the essential prerequisite for the design of logics and calculi that permit automated reasoning about concurrent programs. We propose a novel modular ...
RSS 2.0