Now showing items 226-245 of 643

    • Generalized isotopic shift construction for APN functions 

      Budaghyan, Lilya; Calderini, Marco; Carlet, Claude Michael; Coulter, Robert; Villa, Irene (Journal article; Peer reviewed, 2021)
      In this work we give several generalizations of the isotopic shift construction, introduced recently by Budaghyan et al. (IEEE Trans Inform Theory 66:5299–5309, 2020), when the initial function is a Gold function. In ...
    • Generating a synthetic diffusion tensor dataset 

      Bergmann, Ørjan; Lundervold, Arvid; Steihaug, Trond (Peer reviewed; Journal article, 2005)
      During the last years, many techniques for de-noising, segmentation and fiber-tracking have been applied to diffusion tensor MR image data (DTI) from human and animal brains. However, evaluating such methods may be difficult ...
    • Generating software for MUB complementary sequence constructions 

      Roodashty, Hanieh (Master thesis, 2015-11-18)
      This master thesis has been performed at the Department of Informatics, University of Bergen between February and November 2015. The work has been supervised by Professor Matthew G. Parker as a part of the research interest ...
    • Generating tree-like graphs 

      Moldeklev, Elisabeth (Master thesis, 2008-11-18)
      Implementation of an algorithm that interactively generates k-graphs, a superclass of k-branches.
    • The genome sequence of Atlantic cod reveals a unique immune system 

      Star, Bastiaan; Nederbragt, Alexander Johan; Jentoft, Sissel; Grimholt, Unni; Malmstrøm, Martin; Gregers, Tone Fredsvik; Rounge, Trine Ballestad; Paulsen, Jonas; Solbakken, Monica Hongrø; Sharma, Animesh; Wetten, Ola Frang; Lanzén, Anders; Winer, Roger; Knight, James; Vogel, Jan-Hinnerk; Aken, Bronwen; Andersen, Øivind; Lagesen, Karin; Tooming-Klunderud, Ave; Edvardsen, Rolf; Kirubakaran, G. Tina; Espelund, Mari; Nepal, Chirag; Previti, A. Christopher; Karlsen, Bård Ove; Moum, Truls; Skage, Morten; Berg, Paul Ragnar; Gjøen, Tor; Kuhl, Heiner; Thorsen, Jim; Malde, Ketil; Reinhardt, Richard; Du, Lei; Johansen, Steinar Daae; Searle, Steve; Lien, Sigbjørn; Nilsen, Frank; Jonassen, Inge; Omholt, Stig W; Stenseth, Nils Christian; Jakobsen, Kjetill Sigurd (Peer reviewed; Journal article, 2011-09)
      Atlantic cod (Gadus morhua) is a large, cold-adapted teleost that sustains long-standing commercial fisheries and incipient aquaculture. Here we present the genome sequence of Atlantic cod, showing evidence for complex ...
    • The Genomic HyperBrowser: an analysis web server for genome-scale data 

      Sandve, Geir Kjetil; Gundersen, Sveinung; Johansen, Morten; Glad, Ingrid Kristine; Gunathasan, Krishanthi; Holden, Lars; Holden, Marit; Liestøl, Knut; Nygård, Ståle; Nygaard, Vegard; Paulsen, Jonas; Rydbeck, Halfdan; Trengereid, Kai; Clancy, Trevor; Drabløs, Finn; Ferkingstad, Egil; Kalaš, Matúš; Lien, Tonje Gulbrandsen; Rye, Morten Beck; Frigessi, Arnoldo; Hovig, Johannes Eivind (Peer reviewed; Journal article, 2013-04-30)
      The immense increase in availability of genomic scale datasets, such as those provided by the ENCODE and Roadmap Epigenomics projects, presents unprecedented opportunities for individual researchers to pose novel falsifiable ...
    • Geometric Planar Networks on Bichromatic Points 

      Bandyapadhyay, Sayan; Banik, Aritra; Bhore, Sujoy; Nollenburg, Martin (Journal article; Peer reviewed, 2020)
      We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree, and Minimum perfect matching on geometric graphs induced by bichromatic ( Open image in new window and Open image in new ...
    • A geometry-based generic predictor for catalytic and allosteric sites 

      Mitternacht, Simon; Berezovsky, Igor N. (Peer reviewed; Journal article, 2011)
      An important aspect of understanding protein allostery, and of artificial effector design, is the characterization and prediction of substrate- and effector-binding sites. To find binding sites in allosteric enzymes, many ...
    • Going Far from Degeneracy 

      Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav (Journal article; Peer reviewed, 2020)
      An undirected graph $G$ is $d$-degenerate if every subgraph of $G$ has a vertex of degree at most $d$. By the classical theorem of Erdös and Gallai from 1959, every graph of degeneracy $d>1$ contains a cycle of length at ...
    • Going Far From Degeneracy 

      Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav (Peer reviewed; Journal article, 2019-09-06)
      An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least ...
    • Graph modification problems: Beyond the known boundaries 

      Agrawal, Akanksha (Doctoral thesis, 2017-11-17)
    • Graphical Computing Solution for Industrial Plant Engineering 

      Lima, Marcelo Furtado (Master thesis, 2017-06-21)
      When preparing an engineering operation on an industrial plant, reliable and updated models of the plant must be available for correct decisions and planning. However, especially in the case of offshore oil and gas ...
    • Grein. A New Non-Linear Cryptoprimitive 

      Thorsen, Ole Rydland (Master thesis, 2013-12-10)
      In this thesis, we will study a new stream cipher, Grein, and a new cryptoprimitive used in this cipher. The second chapter gives a brief introduction to cryptography in general. The third chapter looks at stream ciphers ...
    • Guaranteeing Resource Bounds for Component Software 

      Truong, Anh Hoang (Journal article, 2005-06-15)
      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 ...
    • Hard Mathematical Problems in Cryptography and Coding Theory 

      Varadharajan, Srimathi (Doctoral thesis, 2020-04-28)
      In this thesis, we are concerned with certain interesting computationally hard problems and the complexities of their associated algorithms. All of these problems share a common feature in that they all arise from, or have ...
    • Hash functions in Cryptography 

      Grah, Joseph Sterling (Master thesis, 2008)
      This thesis is concerned with giving both an overview of the application of hash functions in cryptography and a presentation of today's standard cryptographic hash functions. Cryptographic hash functions are a valuable ...
    • Hashfunksjoner for bruk i Digitale Signaturer 

      Solvik, Jan Anders (Master thesis, 1995)
    • Hierarchical clusterings of unweighted graphs 

      Høgemo, Svein; Paul, Christophe; Telle, Jan Arne (Journal article; Peer reviewed, 2020)
      We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization ...
    • A Hierarchical Splitting Scheme to Reveal Insight into Highly Self-Occluded Integral Surfaces 

      Brambilla, Andrea; Viola, Ivan; Hauser, Helwig (Peer reviewed; Journal article, 2012)
      In flow visualization, integral surfaces are of particular interest for their ability to describe trajectories of massless particles. In areas of swirling motion, integral surfaces can become very complex and difficult to ...
    • High-Dimensional Bayesian Network Inference From Systems Genetics Data Using Genetic Node Ordering 

      Wang, Lingfei; Audenaert, Pieter; Michoel, Tom Luk Robert (Journal article; Peer reviewed, 2019)
      Studying the impact of genetic variation on gene regulatory networks is essential to understand the biological mechanisms by which genetic variation causes variation in phenotypes. Bayesian networks provide an elegant ...