Blar i Department of Informatics på tittel
Viser treff 266285 av 762

Generating treelike graphs
(Master thesis, 20081118)Implementation of an algorithm that interactively generates kgraphs, a superclass of kbranches. 
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 ... 
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 ... 
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 ... 
Hard Mathematical Problems in Cryptography and Coding Theory
(Doctoral thesis, 20200428)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
(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
(Master thesis, 1995) 
Hierarchical clusterings of unweighted graphs
(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 SelfOccluded Integral Surfaces
(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 ... 
HighDimensional Bayesian Network Inference From Systems Genetics Data Using Genetic Node Ordering
(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 ... 
Highperformance design patterns for modern Fortran
(Peer reviewed; Journal article, 2015)This paper presents ideas for using coordinatefree numerics in modern Fortran to achieve code flexibility in the partial differential equation (PDE) domain. We also show how Fortran, over the last few decades, has changed ... 
Highlights from the Eighth International Society for Computational Biology (ISCB) Student Council Symposium 2012
(Peer reviewed; Journal article, 20121214)Abstract The report summarizes the scientific content of the annual symposium organized by the Student Council of the International Society for Computational Biology (ISCB) held in conjunction with the Intelligent Systems ...