Browsing Department of Informatics by Title
Now showing items 7695 of 345

Editing to Eulerian Graphs
(Schloss Dagstuhl – LeibnizZentrum für Informatik GmbH, 2014)We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and ...Conference object 
Efficient CRISPRCas9mediated generation of knockin human pluripotent stem cells lacking undesired mutations at the targeted locus
(Elsevier, 201505)The CRISPRCas9 system has the potential to revolutionize genome editing in human pluripotent stem cells (hPSCs), but its advantages and pitfalls are still poorly understood. We systematically tested the ability of CRISPRCas9 ...Journal article 
Efficiently Locating Schema Incompatibilities in an eXtensible Markup Language
(The University of Bergen, 2003)Master thesis 
Efforts towards accessible and reliable bioinformatics
(The University of Bergen, 20151119)The aim of the presented work was contributing to making scientific computing more accessible, reliable, and thus more efficient for researchers, primarily computational biologists and molecular biologists. Many approaches ...Doctoral thesis 
Elastic Grid Resources using Cloud Technologies
(The University of Bergen, 20140602)A Large Ion Collider Experiment (ALICE) is one of four experiments at the Large Hadron Collider (LHC) at CERN. The detectors in the ALICE experiment produce data at a rate of 4 GB/s after being filtered and compressed ...Master thesis 
The EMBRACE web service collection
(Oxford University Press (OUP), 20100510)The EMBRACE (European Model for Bioinformatics Research and Community Education) web service collection is the culmination of a 5year project that set out to investigate issues involved in developing and deploying web ...Journal article 
En studie av meshtraverseringsmønstre for Sophusbiblioteket og kjøretids variasjoner på SGI Origin
(The University of Bergen, 2002)Master thesis 
En visuell tilnærming til simulering av købaserte modeller i Java
(The University of Bergen, 2004)Master thesis 
Energyscale Aware Feature Extraction for Flow Visualization
(Blackwell Publishing Ltd., 2011)In the visualization of flow simulation data, feature detectors often tend to result in overly rich response, making some sort of filtering or simplification necessary to convey meaningful images. In this paper we present ...Peer reviewedJournal article 
Enhancing Content Management in DPG
(The University of Bergen, 20131120)This thesis analyzes the usability aspects of PCE and implements a new Single Page Application that attempts to solve this issuesMaster thesis 
Enumerating minimal connected dominating sets in graphs of bounded chordality
(Dagstuhl Publishing, 2015)Listing, generating or enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a certain property. We study the enumeration ...Conference object 
Error Detection and Correction for Symmetric and Asymmetric Channels
(The University of Bergen, 20070827)When a message is sent over a channel errors can occur due to noise during the transmission. So it is very important to know the error correction and detection capability of the code, which is used to encode the ...Doctoral thesis 
Exact algorithms for MAX2SAT and MAX3SAT via multidimensional matrix multiplication
(The University of Bergen, 20150601)In this thesis it is showed how an $O(n^{4\epsilon})$ algorithm for the cube multiplication problem (that is defined in the thesis) would imply a faster than naive $O^{*}(2^{n(1\frac{\epsilon}{4})})$ algorithm for the ...Master thesis 

Exact methods for solving the small scale single vehicle pickup and delivery problem with time windows
(The University of Bergen, 20160815)The single vehicle pickup and delivery problem with time windows (1PDPTW) is a wellknown problem in transportation and combinatorics. In practice, these routes are relatively small with less then 30 stops. In this ...Master thesis 
Exploring Subexponential Parameterized Complexity of Completion Problems
(Schloss Dagstuhl  LeibnizZentrum fuer Informatik, 20140219)Let F be a family of graphs. In the FCompletion problem, we are given an nvertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a ...Journal article 
Exploring the evolution of protein function in Archaea
(BioMed Central, 20120530)Background: Despite recent progress in studies of the evolution of protein function, the questions what were the first functional protein domains and what were their basic building blocks remain unresolved. Previously, we ...Journal article 
Exponential time algorithms: Structures, measures, and bounds
(The University of Bergen, 20081205)This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running ...Doctoral thesis 
Expressive Visualization and Rapid Interpretation of Seismic Volumes
(The University of Bergen, 20091027)One of the most important resources in the world today is energy. Oil and gas provide two thirds of the world energy consumption, making the world completely dependent on it. Locating and recovering the remaining oil and ...Doctoral thesis 
Fast biclustering by dual parameterization
(Dagstuhl Publishing, 2015)We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NPhard, none ...Conference object