Browsing Department of Informatics by Title
Now showing items 471-490 of 982
-
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 ... -
Logics of Statements in Context-Category Independent Basics
(Journal article; Peer reviewed, 2022)Based on a formalization of open formulas as statements in context, the paper presents a freshly new and abstract view of logics and specification formalisms. Generalizing concepts like sets of generators in Group Theory, ... -
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms
(Journal article; Peer reviewed, 2022)We discuss recent algorithmic extensions of two classic results of extremal combinatorics about long paths in graphs. First, the theorem of Dirac from 1952 asserts that a 2-connected graph G with the minimum vertex degree ... -
Long-read single-molecule RNA structure sequencing using nanopore
(Journal article; Peer reviewed, 2022)RNA molecules can form secondary and tertiary structures that can regulate their localization and function. Using enzymatic or chemical probing together with high-throughput sequencing, secondary structure can be mapped ... -
Longest Cycle Above Erdös-Gallai Bound
(Journal article; Peer reviewed, 2022)In 1959, Erdős and Gallai proved that every graph G with average vertex degree ad(G) ≥ 2 contains a cycle of length at least ad(G). We provide an algorithm that for k ≥ 0 in time 2^𝒪(k)⋅n^𝒪(1) decides whether a 2-connected ... -
Longitudinal visualization for exploratory analysis of multiple sclerosis lesions
(Journal article; Peer reviewed, 2022)In multiple sclerosis (MS), the amount of brain damage, anatomical location, shape, and changes are important aspects that help medical researchers and clinicians to understand the temporal patterns of the disease. Interactive ... -
Looking at the Stars
(Journal article, 2006-02-28)The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if H has more than two vertices in some connected component. In the framework of parameterized complexity we analyze a ... -
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
(Journal article; Peer reviewed, 2022)We solve in polynomial time two decision problems that occur in type checking when typings depend on universe level constraints. -
Loss-function learning for cell type mapping of spatial transcriptomics using single-cell RNA-seq data
(Master thesis, 2023-06-01)Breast cancers are complex cellular ecosystems consisting of multiple cell types. Heterotypic interactions and their unique gene expression profiles play central roles in cancer progression and response to therapy. However, ... -
Lossy Kernelization of Same-Size Clustering
(Journal article; Peer reviewed, 2023)In this work, we study the k-median clustering problem with an additional equal-size constraint on the clusters from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) ... -
Low-Rank Binary Matrix Approximation in Column-Sum Norm
(Journal article; Peer reviewed, 2020)We consider 𝓁₁-Rank-r Approximation over {GF}(2), where for a binary m× n matrix 𝐀 and a positive integer constant r, one seeks a binary matrix 𝐁 of rank at most r, minimizing the column-sum norm ‖ 𝐀 -𝐁‖₁. We show ... -
Low-Rank Parity-Check codes : Generalization and Improved Decoding for Low-Rank Parity-Check Codes
(Doctoral thesis, 2024-08-23)I 1978 foreslo McEliece en kryptografisk nøkkelforankringsmekanisme basert på kodeteori. Det underliggende matematiske problemet med å dekode en tilfeldig lineær kode ble bevist å være NP-fullstendig av McEliece og Berlekamp ... -
Lower bounds on the size of spheres of permutations under the Chebychev distance
(Peer reviewed; Journal article, 2011)Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given -
Machine Learning Approaches for Biomarker Discovery Using Gene Expression Data
(Chapter, 2021)Biomarkers are of great importance in many fields, such as cancer research, toxicology, diagnosis and treatment of diseases, and to better understand biological response mechanisms to internal or external intervention. ... -
Machine learning approaches for high-dimensional genome-wide association studies
(Doctoral thesis, 2022-08-24)Formålet med Genome-wide association studies (GWAS) er å finne statistiske sammenhenger mellom genetiske varianter og egenskaper av interesser. De genetiske variantene som forklarer mye av variasjonene i genomfattende ... -
Machine Learning methods for mood disorder decision support
(Master thesis, 2017-07-11) -
Macrophage phenotype transitions in a stochastic gene-regulatory network model
(Journal article; Peer reviewed, 2023)Polarization is the process by which a macrophage cell commits to a phenotype based on external signal stimulation. To know how this process is affected by random fluctuations and events within a cell is of utmost importance ... -
Macroscale mesenchymal condensation to study cytokine-driven cellular and matrix-related changes during cartilage degradation
(Journal article; Peer reviewed, 2020)Understanding the pathophysiological processes of cartilage degradation requires adequate model systems to develop therapeutic strategies towards osteoarthritis (OA). Although different in vitro or in vivo models have been ... -
Making the BKW Algorithm Practical for LWE
(Journal article; Peer reviewed, 2020)The Learning with Errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum-Kalai-Wasserman (BKW) algorithm. This paper ... -
The male germ cell gene regulator CTCFL is functionally different from CTCF and binds CTCF-like consensus sites in a nucleosome composition-dependent manner
(Peer reviewed; Journal article, 2012-06-18)Background: CTCF is a highly conserved and essential zinc finger protein expressed in virtually all cell types. In conjunction with cohesin, it organizes chromatin into loops, thereby regulating gene expression and epigenetic ...