Blar i Department of Informatics på tittel
Viser treff 323342 av 916

Generalized Bent and/or Negabent Constructions
(Master thesis, 20120427)In this thesis, we generalize the MaioranaMcFarland construction for bent, negabent and bentnegabent Boolean functions and describe a way to computationally search for constructions using these generalizations. We present ... 
Generalized isotopic shift construction for APN functions
(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
(Peer reviewed; Journal article, 2005)During the last years, many techniques for denoising, segmentation and fibertracking 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
(Master thesis, 20151118)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 treelike graphs
(Master thesis, 20081118)Implementation of an algorithm that interactively generates kgraphs, a superclass of kbranches. 
Generation of random chordal graphs using subtrees of a tree
(Journal article; Peer reviewed, 2022)Chordal graphs form one of the most studied graph classes. Several graph problems that are NPhard in general become solvable in polynomial time on chordal graphs, whereas many others remain NPhard. For a large group of ... 
The genome sequence of Atlantic cod reveals a unique immune system
(Peer reviewed; Journal article, 201109)Atlantic cod (Gadus morhua) is a large, coldadapted teleost that sustains longstanding 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 genomescale data
(Peer reviewed; Journal article, 20130430)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
(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 geometrybased generic predictor for catalytic and allosteric sites
(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 effectorbinding sites. To find binding sites in allosteric enzymes, many ... 
Gnocis: An integrated system for interactive and reproducible analysis and modelling of cisregulatory elements in Python 3
(Journal article; Peer reviewed, 20220909)Gene expression is regulated through cisregulatory elements (CREs), among which are promoters, enhancers, Polycomb/Trithorax Response Elements (PREs), silencers and insulators. Computational prediction of CREs can be ... 
Going Far from Degeneracy
(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
(Peer reviewed; Journal article, 20190906)An undirected graph G is ddegenerate 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 ... 
Gold functions and switched cube functions are not 0extendable in dimension n > 5
(Journal article; Peer reviewed, 2023)In the independent works by Kalgin and Idrisova and by Beierle, Leander and Perrin, it was observed that the Gold APN functions over \(\mathbb {F}_{2^5}\) give rise to a quadratic APN function in dimension 6 having maximum ... 
Graph Algebras and Derived Graph Operations
(Journal article, 2023)We revise our former definition of graph operations and correspondingly adapt the construction of graph term algebras. As a first contribution to a prospective research field, Universal Graph Algebra, we generalize some ... 
A Graph Feature AutoEncoder for the Prediction of Unobserved Node Features on Biological Networks
(Journal article; Peer reviewed, 2021)Background Molecular interaction networks summarize complex biological processes as graphs, whose structure is informative of biological function at multiple scales. Simultaneously, omics technologies measure the variation ... 
Graph modification problems: Beyond the known boundaries
(Doctoral thesis, 20171117) 
Graphical Computing Solution for Industrial Plant Engineering
(Master thesis, 20170621)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 NonLinear Cryptoprimitive
(Master thesis, 20131210)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
(Journal article, 20050615)Component software is software that has been assembled from various pieces of standardized, reusable computer programs, socalled components. Executing component software creates instances of these components. For several ...