Now showing items 21-40 of 256

  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Computing minimal triangulation in Time o(n^2.376) 

    Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve (SIAM Journals, 2005)
  • 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 ...
  • Continuous Levels-of-Detail and Visual Abstraction for Seamless Molecular Visualization 

    Parulek, Julius; Jönsson, Daniel; Ropinski, Timo; Bruckner, Stefan; Ynnerman, Anders; Viola, Ivan (Wiley, 2014-05-06)
    Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the ...
  • Counting Instances of Software Components 

    Bezem, Marcus A.; Truong, Anh Hoang (University of Bergen, Department of Informatics, 2004-07-13)
    Component software is software that has been assembled from various pieces of standardized, reusable computer programs, so-called components. Executing component software creates instances of these components. For several ...
  • A critical view on Public Key Infrastructures 

    Tjøstheim, Thomas (The University of Bergen, 2004)
  • Cryptanalysis of Cryptographic Primitives and Related Topics 

    Hassanzadeh, Seyed Mehdi Mohammad (The University of Bergen, 2011-09-09)
    This thesis has focused on the cryptanalysis of cryptographic primitives especially stream ciphers which is an important topic in cryptography. Additionally, the security of network coding is discussed and improved with ...
  • Current Trends for 4D Space-Time Topology for Semantic Flow Segmentation 

    Matković, Krešimir; Lež, Alan; Hauser, Helwig; Pobitzer, Armin; Theisel, Holger; Kuhn, Alexander; Otto, Mathias; Peikert, Ronald; Schindler, Benjamin; Fuchs, Raphael (Elsevier, 2011)
  • Curve Density Estimates 

    Lampe, Ove Daae; Hauser, Helwig (Blackwell Publishing Ltd., 2011-06-28)
    In this work, we present a technique based on kernel density estimation for rendering smooth curves. With this approach, we produce uncluttered and expressive pictures, revealing frequency information about one, or, ...
  • Curve-Centric Volume Reformation for Comparative Visualization 

    Lampe, Ove Daae; Correa, Carlos; Ma, Kwan-Liu; Hauser, Helwig (IEEE, 2009-10-11)
    We present two visualization techniques for curve-centric volume reformation with the aim to create compelling comparative visualizations. A curve-centric volume reformation deforms a volume, with regards to a curve in ...
  • Data clustering optimization with visualization 

    Guillaume, Fabien (The University of Bergen, 2014-03-20)
    This thesis study the possible applications of Particle Swarm Optimization in Kernel Clustering, Dynamic modeling and Artificial Neural Network.
  • Data partitioning enables the use of standard SOAP Web Services in genome-scale workflows 

    Sztromwasser, Paweł; Puntervoll, Pål; Petersen, Kjell (IMBio e.V., 2011)
    Biological databases and computational biology tools are provided by research groups around the world, and made accessible on the Web. Combining these resources is a com- mon practice in bioinformatics, but integration ...
  • Data Profiling to Reveal Meaningful Structures for Standardization 

    Nyero, Walter (The University of Bergen, 2009-11-20)
    Today many organisations and enterprises are using data from several sources either for strategic decision making or other business goals such as data integration. Data quality problems are always a hindrance to effective ...
  • Data structure, Access and Presentation in Web-GIS for marine research 

    Grønning, Torgeir Mossige (The University of Bergen, 2013-06-02)
    A prototype Web--GIS system has been constructed as a replacement for the ageing ODB system. It consists of a software stack with PostGIS as a data store, GeoServer as a data accessor and a client implemented in JavaScript ...