Browsing Department of Informatics by Title
Now showing items 558577 of 649

Støtte for rike klienter i Dynamic Presentation Generator
(Master thesis, 20100601)Denne oppgaven beskriver hvordan det kan legges til støtte for rike klienter i Dynamic Presentation Generator (DPG). Oppgaven tar for seg både server og klientsiden av temaet. DPG er et innholdshåndteringssystem utviklet ... 
Subdivisions in digraphs of large outdegree or large dichromatic number
(Journal article; Peer reviewed, 2019)In 1985, Mader conjectured the existence of a function f such that every digraph with minimum outdegree at least f ( k ) contains a subdivision of the transitive tournament of order k . This conjecture is still completely ... 
Subexponential Algorithms for Partial Cover Problems
(Conference object; Peer reviewed; Journal article, 2009)Partial Cover problems are optimization versions of fundamental and well studied problems like {\sc Vertex Cover} and {\sc Dominating Set}. Here one is interested in covering (or dominating) the maximum number of edges (or ... 
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
(Journal article; Peer reviewed, 2020)We study algorithmic properties of the graph class Chordalke, that is, graphs that can be turned into a chordal graph by adding at most k edges or, equivalently, the class of graphs of fillin at most k. We discover that ... 
Subexponentialtime parameterized algorithm for Steiner tree on planar graphs
(Conference object; Peer reviewed; Journal article, 2013)The wellknown bidimensionality theory provides a method for designing fast, subexponentialtime parameterized algorithms for a vast number of NPhard problems on sparse graph classes such as planar graphs, bounded genus ... 
Subgraph Complementation
(Journal article; Peer reviewed, 202002)A subgraph complement of the graph G is a graph obtained from G by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph G and graph class G, is there ... 
Subquadratic Kernels for Implicit 3Hitting Set and 3Set Packing Problems
(Peer reviewed; Journal article, 2019)We consider four wellstudied NPcomplete packing/covering problems on graphs: Feedback Vertex Set in Tournaments (FVST), Cluster Vertex Deletion (CVD), Triangle Packing in Tournaments (TPT) and Induced P3Packing. For ... 
Substation Location in Offshore Wind Farms  A Planar MultiFacility LocationRouting Problem
(Master thesis, 20140314)In offshore wind farms, two important parts of the design are to determine locations for substations and a cabling layout that connects every turbine to a substation. These problems are interconnected, as the cable layout ... 
Sufficiently overdetermined random polynomial systems behave like semiregular ones
(Doctoral thesis, 20191218)Solving systems of polynomial equations over finite fields is a fundamental problem in several areas of pure and applied mathematics. Gröbner basis methods is a family of techniques to computationally solve such systems ... 
A Survey of LinearProgramming Guided Branching Parameterized Algorithms for Vertex Cover, with Experimental Results
(Master thesis, 20150601)A survey of FPT algorithms for Vertex Cover, parameterized by an above guarantee parameter. 
Sustainability in mining protocols for public blockchains
(Master thesis, 20190504)Blockchains are a somewhat new technology with much potential and it is meeting growing public interest. However, with wider use of the technology we face the challenge of sustainability since the current mining protocols ... 
Systematic exploration of error sources in pyrosequencing flowgram data
(Peer reviewed; Journal article, 2011)Motivation: 454 pyrosequencing, by Roche Diagnostics, has emerged as an alternative to Sanger sequencing when it comes to read lengths, performance and cost, but shows higher perbase error rates. Although there are several ... 
TailFindR: Alignmentfree poly(A) length measurement for Oxford Nanopore RNA and DNA sequencing
(Peer reviewed; Journal article, 20190702)Polyadenylation at the 3′end is a major regulator of messenger RNA and its length is known to affect nuclear export, stability, and translation, among others. Only recently have strategies emerged that allow for genomewide ... 
Techniques in parameterized algorithm design
(Doctoral thesis, 20060306)In this thesis we give a novel classification of techniques for designing parameterized algorithms, together with research publications applying these techniques, in particular Crown Decompositions, to various problems. ... 
Testing with Concepts and Axioms in C++
(Reports in Informatics: 368, Research report, 200810)Modern development practices encourage extensive testing of code while it is still under development, using unit tests to check individual code units in isolation. Such tests are typically casebased, checking a likely ... 
ThermoRawFileParser: Modular, Scalable, and CrossPlatform RAW File Conversion
(Journal article; Peer reviewed, 2020)The field of computational proteomics is approaching the big data age, driven both by a continuous growth in the number of samples analyzed per experiment as well as by the growing amount of data obtained in each analytical ... 
Three problems on wellpartitioned chordal graphs
(Journal article; Peer reviewed, 2021)In this work, we solve three problems on wellpartitioned chordal graphs. First, we show that every connected (resp., 2connected) wellpartitioned chordal graph has a vertex that intersects all longest paths (resp., longest ... 
Throughput and robustness of bioinformatics pipelines for genomescale data analysis
(Doctoral thesis, 20140219)The postgenomic era has been heavily influenced by the rapid development of highthroughput molecularscreening technologies, which has enabled genomewide analysis approaches on an unprecedented scale. The constantly ... 
Tight bounds for parameterized complexity of Cluster Editing
(Conference object; Peer reviewed; Journal article, 2013)In the Correlation Clustering problem, also known as Cluster Editing, we are given an undirected graph G and a positive integer k; the task is to decide whether G can be transformed into a cluster graph, i.e., a disjoint ... 
TMM@: a web application for the analysis of transmembrane helix mobility
(Peer reviewed; Journal article, 20070702)Background: To understand the mechanism by which a protein transmits a signal through the cell membrane, an understanding of the flexibility of its transmembrane (TM) region is essential. Normal Mode Analysis (NMA) has ...