Browsing Department of Informatics by Title
Now showing items 351-370 of 979
-
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 ... -
Generalized low rank parity check codes
(Journal article, 2023)In this work we propose a family of Fq-linear lowrank parity check (LRPC) codes based on a bilinear product over Fmq defined by a generic 3-tensor over Fq. A particular choice of this tensor corresponds to the classical ... -
Generating a synthetic diffusion tensor dataset
(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
(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
(Master thesis, 2008-11-18)Implementation of an algorithm that interactively generates k-graphs, a superclass of k-branches. -
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 NP-hard in general become solvable in polynomial time on chordal graphs, whereas many others remain NP-hard. For a large group of ... -
The genome sequence of Atlantic cod reveals a unique immune system
(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
(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
(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
(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 ... -
Gnocis: An integrated system for interactive and reproducible analysis and modelling of cis-regulatory elements in Python 3
(Journal article; Peer reviewed, 2022-09-09)Gene expression is regulated through cis-regulatory 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, 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 ... -
Gold functions and switched cube functions are not 0-extendable 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 Auto-Encoder 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, 2017-11-17) -
Graphical Computing Solution for Industrial Plant Engineering
(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
(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 ... -
Grid induced minor theorem for graphs of small degree
(Journal article; Peer reviewed, 2023)A graph H is an induced minor of a graph G if H can be obtained from G by vertex deletions and edge contractions. We show that there is a function f (k, d) = O(k10 +2d5 ) so that if a graph has treewidth at least f (k, d) ...