Browsing Department of Informatics by Title
Now showing items 211230 of 323

Parallel Graph Algorithms for Combinatorial Scientific Computing
(The University of Bergen, 20110826)Doctoral thesis 
Parameterized complexity of Eulerian deletion problems
(Springer, 201401)We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ...Journal article 
Parameterized complexity of secluded connectivity problems
(Dagstuhl Publishing, 2015)The Secluded Path problem introduced by Chechik et al. in [ESA 2013] models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of ...Conference object 
Parameterized Graph Modification Algorithms
(The University of Bergen, 20151210)Graph modification problems form an important class of algorithmic problems in computer science. In this thesis, we study edge modification problems towards classes related to chordal graphs, with the main focus on trivially ...Doctoral thesis 
Parsing in a Broad Sense
(Springer, 2014)Having multiple representations of the same instance is common in software language engineering: models can be visualised as graphs, edited as text, serialised as XML. When mappings between such representations are considered, ...Chapter 
Passive Cryptanalysis of the UnConditionally Secure Authentication Protocol for RFID Systems
(The author, 2012)Recently, Alomair et al. proposed the first Un Conditionally Secure mutual authentication protocol for lowcost RFID systems(UCSRFID). The security of the UCSRFID relies on five dynamic secret keys which are updated at ...Conference object 
Perceptually Uniform Motion Space
(IEEE, 20140507)Flow data is often visualized by animated particles inserted into a flow field. The velocity of a particle on the screen is typically linearly scaled by the velocities in the data. However, the perception of velocity ...Journal article 
Phase Transition in a System of Random Sparse Boolean Equations
(Versita Open, 2012)Many problems, including algebraic cryptanalysis, can be transformed to a problem of solving a (large) system of sparse Boolean equations. In this article we study 2 algorithms that can be used to remove some redundancy ...Peer reviewedChapter 
A polynomialtime algorithm for LO based on generalized logarithmic barrier functions
(Academic Publications, 2008)Peer reviewedJournal article 
A polynomialtime solvable case for the NPhard problem Cutwidth
(The University of Bergen, 20140602)The Cutwidth problem is a notoriously hard problem, and its complexity is open on several interesting graph classes. Motivated by this fact we investigate the problem on superfragile graphs, a graph class on which the ...Master thesis 
Practical Aspects of the Graph Parameter Booleanwidth
(The University of Bergen, 20140818)Doctoral thesis 
Predicting Gene Regulatory Elements in Silico on a Genomic Scale
(Cold Spring Harbor Laboratory Press, 19980518)We performed a systematic analysis of gene upstream regions in the yeast genome for occurrences of regular expressiontype patterns with the goal of identifying potential regulatory elements. To achieve this goal, we have ...Journal article 
Prediction and analysis of protein structure
(The University of Bergen, 20100419)This thesis, which contains an introduction and four manuscripts, summarises my efforts during my the past four years to understand proteins, their structure and dynamics. The first manuscript presents a protocol that ...Doctoral thesis 
Prediction of Polycomb/Trithorax Response Elements using Support Vector Machines
(The University of Bergen, 20130603)Polycomb/Trithorax Response Elements (PREs) are epigenetic elements that can maintain established transcriptional states over multiple cell divisions. Sequence motifs in known PREs have enabled genomewide PRE prediction ...Master thesis 
A Pretty Good Formatting Pipeline
(Springer, 2013)Proper formatting makes the structure of a program apparent and aids program comprehension. The need to format code arises in code generation and transformation, as well as in normal reading and editing situations. ...Chapter 
Programming with Explicit Dependencies. A Framework for Portable Parallel Programming
(20110523)Computational devices are rapidly evolving into massively parallel systems. Multicore processors are already standard; high performance processors such as the Cell/BE processor, graphics processing units (GPUs) ...Doctoral thesis 
Projective Simulation compared to reinforcement learning
(The University of Bergen, 20150601)This thesis explores the model of projective simulation (PS), a novel approach for an artificial intelligence (AI) agent. The model of PS learns by interacting with the environment it is situated in, and allows for ...Master thesis 

Proteasedependent fractional mass and peptide properties
(IM Publications, 20080922)Mass spectrometric analyses of peptides mainly rely on cleavage of proteins with proteases that have a defined specificity. The specificities of the proteases imply that there is not a random distribution of amino acids ...Journal articlePeer reviewed 
The Proteomics Identifications database: 2010 update
(Oxford University Press (OUP), 20091111)The Proteomics Identifications database (PRIDE, <a href="http://www.ebi.ac.uk/pride"target="blank">http://www.ebi.ac.uk/pride) at the European Bioinformatics Institute has become one of the main repositories of mass ...Journal article