Now showing items 21-40 of 314

    • Choice of parameter for DP-based FPT algorithms: four case studies 

      Sæther, Sigve Hortemo (The University of Bergen, 2015-09-07)
      This thesis studies dynamic programming algorithms and structural parameters used when solving computationally hard problems. In particular, we look at algorithms that make use of structural decompositions to overcome ...
      Doctoral thesis
    • Chromatin and epigenetic features of long-range gene regulation 

      Harmston, Nathan; Lenhard, Boris (Oxford University Press (OUP), 2013-06-13)
      The precise regulation of gene transcription during metazoan development is controlled by a complex system of interactions between transcription factors, histone modifications and modifying enzymes and chromatin conformation. ...
      Journal article
    • Classification of protein structures 

      Sætre, Narve (The University of Bergen, 1999-12)
      Master thesis
    • Classifying and Measuring Student Problems and Misconceptions 

      Rosbach, Alexander Hoem; Bagge, Anya Helene (Akademika forlag, 2013)
      In this paper we report on an attempt to classify student problems and mistakes, and measuring the frequency of particular problems in a firstsemester programming course. We also propose a scheme for annotating student ...
      Chapter
    • Coding for passive RFID communication 

      Yang, Guang (The University of Bergen, 2012-08-31)
      This dissertation elaborates on channel coding for reliable communication in passive RFID systems. RFID applications have been developed and used widely. Since a passive RFID tag has no power requirements, passive RFID ...
      Doctoral thesis
    • Coherent Conformational Degrees of Freedom as a Structural Basis for Allosteric Communication 

      Mitternacht, Simon; Berezovsky, Igor N. (Public Library of Science, 2011-12-08)
      Conformational changes in allosteric regulation can to a large extent be described as motion along one or a few coherent degrees of freedom. The states involved are inherent to the protein, in the sense that they are ...
      Peer reviewedJournal article
    • Colluding Tags Attack on the ECC-based Grouping Proofs for Rfids 

      Abyaneh, Mohammad Reza Sohizadeh (The author, 2012)
      Recently, a new privacy-preserving elliptic curve based grouping proof protocol with colluding tag prevention( CTP) has been proposed. The CTP protocol is claimed to be resistant against colluding tags attacks in which ...
      Conference object
    • Combining Aspect-Oriented and Strategic Programming 

      Kalleberg, Karl Trygve; Visser, Eelco (Elsevier, 2006-01)
      Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very difficult or even impossible to modularizewith ...
      Journal article
    • Community Detection in Social Networks 

      Fasmer, Erlend Eindride (The University of Bergen, 2015-05-01)
      Social networks usually display a hierarchy of communities and it is the task of community detection algorithms to detect these communities and preferably also their hierarchical relationships. One common class of ...
      Master thesis
    • Community-driven development for computational biology at Sprints, Hackathons and Codefests 

      Möller, Steffen; Afgan, Enis; Banck, Michael; Bonnal, Raoul J. P.; Booth, Timothy; Chilton, John; Cock, Peter J. A.; Gumbel, Markus; Harris, Nomi; Holland, Richard; Kalaš, Matúš; Kaján, László; Kibukawa, Eri; Powel, David R.; Prins, Pjotr; Quinn, Jacqueline; Sallou, Olivier; Strozzi, Francesco; Seemann, Torsten; Sloggett, Clare; Soiland-Reyes, Stian; Spooner, William; Steinbiss, Sascha; Tille, Andreas; Travis, Anthony J.; Guimera, Roman V.; Katayama, Toshiaki; Chapman, Brad A. (BioMed Central, 2014-11-27)
      Background: Computational biology comprises a wide range of technologies and approaches. Multiple technologies can be combined to create more powerful workflows if the individuals contributing the data or providing tools ...
      Journal article
    • Comparing 17 graph parameters 

      Sasák, Róbert (The University of Bergen, 2010-08-02)
      Many parametrized problems were decided to be FPT or W-hard. However, there is still thousands of problems and parameters for which we do not know yet whether are FPT or W-hard. In this thesis, we provide a tool for extending ...
      Master thesis
    • Comparison of Discrete and Continuous Models for the Pooling Problem 

      Alfaki, Mohammed; Haugland, Dag (Dagstuhl Publishing, 2011)
      The pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and solved by branch-and-bound ...
      ChapterPeer reviewed
    • Comparison of Solving Techniques for Non-linear Sparse Equations over Finite Fields with Application in Cryptanalysis 

      Schilling, Thorsten Ernst (The University of Bergen, 2008)
      The work on this thesis gives a summary of the Gluing/Agreeing techniques, as well as a reference implementation of this methods. Furthermore widely used SAT-solving techniques are explained and a short insight to the ...
      Master thesis
    • A Comparison of Vertex and Edge Partitioning Approaches for Parallel Maximal Matching 

      Sørnes, Alexander N (The University of Bergen, 2013-12-09)
      This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edge partitioning, using a distributed memory system. Previous studies on the parallelization of graphs has often been ...
      Master thesis
    • Computation of Treespan. A Generalization of Bandwidth to Treelike Structures 

      Dregi, Markus Sortland (The University of Bergen, 2012-06-14)
      Motivated by a search game, Fomin, Heggernes and Telle [Algorithmica, 2005] defined the graph parameter treespan, a generalization of the well studied parameter bandwidth. Treespan is the maximum number of appearances ...
      Master thesis
    • Computational analysis of the evolutionary dynamics of proteins on a genomic scale 

      Hughes, Timothy (The University of Bergen, 2007-01-16)
      Biology is primarily concerned with the study of all phenotypic aspects of living organisms and evolutionary biology is more specifically interested in elucidating how different phenotypes evolved. Proteins (and RNA ...
      Doctoral thesis
    • Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings 

      Pilipczuk, Michal Pawel (Dagstuhl Publishing, 2013)
      The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ...
      Conference object
    • Computing minimal triangulation in Time o(n^2.376) 

      Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve (SIAM Journals, 2005)
      Journal article
    • Connecting Vertices by Independent Trees 

      Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Saurabh, Saket (Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, 2014)
      We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and ...
      Conference object
    • Conserved BK Channel-Protein Interactions Reveal Signals Relevant to Cell Death and Survival 

      Sokolowski, Bernd; Orchard, Sandra; Harvey, Margaret; Sridhar, Settu; Sakai, Yoshihisa (Public Library of Science, 2011-12-09)
      The large-conductance Ca2+-activated K+ (BK) channel and its b-subunit underlie tuning in non-mammalian sensory or hair cells, whereas in mammals its function is less clear. To gain insights into species differences and ...
      Peer reviewedJournal article