Browsing Department of Informatics by Title
Now showing items 151170 of 314


Kernel(s) for Problems with No Kernel: On OutTrees with Many Leaves
(Dagstuhl Publishing, 2009)The {\sc $k$Leaf OutBranching} problem is to find an outbranching, that is a rooted oriented spanning tree, with at least $k$ leaves in a given digraph. The problem has recently received much attention from the viewpoint ...Conference object 
Largest chordal and interval subgraphs faster than 2n
(Springer, 20150822)We prove that in a graph with n vertices, induced chordal and interval subgraphs with the maximum number of vertices can be found in time O(2λn) for some λ< 1. These are the first algorithms breaking the trivial 2nnO(1) ...Journal article 

Linear dependencies between nonuniform distributions in DES
(The University of Bergen, 20140530)Davies and Murphy explained some nonuniform distributions of the output from pairs and triplets of Sboxes in DES, and how they are completely dependent on some key bits. There are linear dependencies between these ...Master thesis 
Lineær kompleksitet til produkter av maksimalsekvenser
(The University of Bergen, 2000)Master thesis 
Localizing Cell Towers from Crowdsourced Measurements
(The University of Bergen, 20150601)Today, several internet sites exist that aim to provide the locations and number of cellular network antennas worldwide. For example [1],[2] and [3]. What makes this task difficult to accomplish is the lack of information ...Master thesis 
Looking at the Stars
(Elsevier, 20060228) 
Lower bounds on the size of spheres of permutations under the Chebychev distance
(Springer, 2010)Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying pi − i ≤ d for all i are givenPeer reviewedJournal article 
The male germ cell gene regulator CTCFL is functionally different from CTCF and binds CTCFlike consensus sites in a nucleosome compositiondependent manner
(BioMed Central, 20120618)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 ...Journal article 
Managing spatial selections with contextual snapshots
(Wiley, 201412)Spatial selections are a ubiquitous concept in visualization. By localizing particular features, they can be analysed and compared in different views. However, the semantics of such selections often depend on specific ...Journal article 
MassAnalyzer, a program to help find labeled peptides and compare them to their unlabeled counterparts in a SILAC experiment
(The University of Bergen, 20081127)Mass spectrometry(MS) have become an increasingly popular analysis method for high throughput experiments on proteins in biology. SILAC(stable isotope labeling by amino acids in cell culture) is a method within MS that ...Master thesis 
MassSorter: a tool for administrating and analyzing data from mass spectrometry experiments on proteins with known amino acid sequences
(BioMed Central, 20060126)Background: Proteomics is the study of the proteome, and is critical to the understanding of cellular processes. Two central and related tasks of proteomics are protein identification and protein characterization. Many ...Journal articlePeer reviewed 
A matrixfree method for regularisation with unrestricted variables
(The University of Bergen, 2008)In this thesis a method for the partially norm constrained least squares problem is presented. The method relies on a largescale trustregion solver and has a low storage requirement. A combination of image misalignment ...Master thesis 
Maximum matching width: New characterizations and a fast algorithm for dominating set
(Dagstuhl Publishing, 2015)We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) <= k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A,B,C \subseteq X with A ...Conference object 
Maximum number of edges in graph classes under degree and matching constraints
(The University of Bergen, 20150512)In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has to satisfy certain constraints. In this thesis, we ask how many edges a graph can have with restrictions on its degree ...Master thesis 
Maximum number of objects in graph classes.
(The University of Bergen, 20150531)The focus of this thesis is the study and implementation of two exact exponential time algorihms. These algorihms finds and lists the number of minimal dominating sets and the number of minimal subset feedback vertex ...Master thesis 
Methods for analysing 2D electrophoretic gel images
(The University of Bergen, 2002)Master thesis 
Minimizing Fillin Size and Elimination Tree Height in Parallel Cholesky Factorization
(The University of Bergen, 1992)Master thesis 
Minimum Fillin of Sparse Graphs: Kernelization and Approximation
(Dagstuhl Publishing, 2011)The Minimum Fillin problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop ...Conference object