Now showing items 157-176 of 345

    • J2ME Bluetooth programming 

      Klingsheim, André N. (The University of Bergen, 2004)
      Master thesis
    • JASPAR 2014: An extensively expanded and updated open-access database of transcription factor binding profiles 

      Mathelier, Anthony; Zhao, Xiaobei; Zhang, Allen W.; Parcy, François; Worsley-Hunt, Rebecca; Arenillas, David J.; Buchman, Sorana; Chen, Chih-yu; Chou, Alice; Ienasescu, Hans; Lim, Jonathan; Shyr, Casper; Tan, Ge; Zhou, Michelle; Lenhard, Boris; Sandelin, Albin; Wasserman, Wyeth W. (Oxford University Press, 2014-01)
      JASPAR (http://jaspar.genereg.net) is the largest open-access database of matrix-based nucleotide profiles describing the binding preference of transcription factors from multiple species. The fifth major release greatly ...
      Journal article
    • K-packing and K-domination on tree graphs 

      Mjelde, Morten (The University of Bergen, 2004)
      Master thesis
    • Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves 

      Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel; Raible, Daniel; Saurabh, Saket; Villanger, Yngve (Dagstuhl Publishing, 2009)
      The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching, 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
    • Kernelization of Vertex Cover by Structural Parameters 

      Strømme, Torstein Jarl Fagerbakke (The University of Bergen, 2015-08-03)
      In the NP-complete problem Vertex Cover, one is given a graph G and an integer k and are asked whether there exists a vertex set S ⊆ V (G) with size at most k such that every edge of the graph is incident to a vertex in ...
      Master thesis
    • Largest chordal and interval subgraphs faster than 2n 

      Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve (Springer, 2015-08-22)
      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
    • Lex M versus MCS-M 

      Villanger, Yngve (Elsevier, 2006)
      Journal article
    • Linear dependencies between non-uniform distributions in DES 

      Fauskanger, Stian (The University of Bergen, 2014-05-30)
      Davies and Murphy explained some non-uniform distributions of the output from pairs and triplets of S-boxes 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 

      Ovnerud, Torbjørn (The University of Bergen, 2000)
      Master thesis
    • Localizing Cell Towers from Crowdsourced Measurements 

      Rusvik, Johan Alexander Nordstrand (The University of Bergen, 2015-06-01)
      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 

      Prieto, Elena; Sloper, Christian (Elsevier, 2006-02-28)
    • Lower bounds on the size of spheres of permutations under the Chebychev distance 

      Kløve, Torleiv (Springer, 2010)
      Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given
      Peer reviewedJournal article
    • The male germ cell gene regulator CTCFL is functionally different from CTCF and binds CTCF-like consensus sites in a nucleosome composition-dependent manner 

      Sleutels, Frank; Soochit, Widia; Bartkuhn, Marek; Heath, Helen; Dienstbach, Sven; Bergmaier, Philipp; Franke, Vedran; Rosa-Garrido, Manuel; van de Nobelen, Suzanne; Caesar, Lisa; van der Reijden, Michael I.J.A.; Bryne, Jan Christian; van Ijcken, Wilfred F.J.; Grootegoed, J. Anton; Delgado, M. Dolores; Lenhard, Boris; Renkawitz, Rainer; Grosveld, Frank; Galjart, Niels (BioMed Central, 2012-06-18)
      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 

      Mindek, Peter; Gröller, Eduard; Bruckner, Stefan (Wiley, 2014-12)
      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 

      Narrevik, Tommy (The University of Bergen, 2008-11-27)
      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 

      Barsnes, Harald; Mikalsen, Svein-Ole; Eidhammer, Ingvar (BioMed Central, 2006-01-26)
      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 matrix-free method for regularisation with unrestricted variables 

      Fotland, Bjørn Harald (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 large-scale trust-region 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 

      Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne (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 

      Måland, Erik Kvam (The University of Bergen, 2015-05-12)
      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. 

      Hellestø, Marit Kristine Astad (The University of Bergen, 2015-05-31)
      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