Now showing items 182-201 of 643

• #### Evolution and developmental system drift in the endoderm gene regulatory network of Caenorhabditis and other nematodes ﻿

(Journal article; Peer reviewed, 2020)
Developmental gene regulatory networks (GRNs) underpin metazoan embryogenesis and have undergone substantial modification to generate the tremendous variety of animal forms present on Earth today. The nematode Caenorhabditis ...
• #### Exact algorithms for MAX-2SAT and MAX-3SAT via multidimensional matrix multiplication ﻿

(Master thesis, 2015-06-01)
In this thesis it is showed how an $O(n^{4-\epsilon})$ algorithm for the cube multiplication problem (that is defined in the thesis) would imply a faster than naive $O^{*}(2^{n(1-\frac{\epsilon}{4})})$ algorithm for ...
• #### Exact algorithms for treewidth and minimum fill-in ﻿

(Journal article, 2006)
• #### Exact and approximate digraph bandwidth ﻿

(Journal article; Peer reviewed, 2019)
In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately. Motivated by the definitions of ...
• #### Exact methods for solving the small scale single vehicle pickup and delivery problem with time windows ﻿

(Master thesis, 2016-08-15)
The single vehicle pickup and delivery problem with time windows (1-PDPTW) is a wellknown problem in transportation and combinatorics. In practice, these routes are relatively small with less then 30 stops. In this thesis, ...
• #### Experimental Study on One-Time Password used in Authentication within Norwegian Banking ﻿

(Master thesis, 2020-06-26)
Authentication is a vital part of this fast-growing, digitalized world. Fundamentally, today’s society is more reliant on computer technology and digitalization than ever before. Therefore, the use of dynamic one-time ...
• #### Exploiting graph structures for computational efficiency ﻿

(Doctoral thesis, 2020-05-07)
Coping with NP-hard graph problems by doing better than simply brute force is a field of significant practical importance, and which have also sparked wide theoretical interest. One route to cope with such hard graph ...
• #### Exploring graph parameters similar to tree-width and path-width ﻿

(Master thesis, 2017-07-04)
In a recent paper appearing at IPEC 2015, ”Maximum matching width: new characterization and fast algorithms for dominating set” [12], three similar treelike parameters, tree-width, branch-width and maximum matching-width, ...
• #### Exploring Microservice Security ﻿

(Doctoral thesis, 2018-10-10)
Due to rapid transitioning towards digitalized society and extended reliance on interconnected digital systems, computer security is a field of growing importance. Software that we build should be secure, resilient and ...
• #### Exploring MultiPath TCP Through Discrete Event Simulation ﻿

(Master thesis, 2021-06-01)
Global internet usage is rapidly becoming more mobile. Devices are, as a consequence, equipped with multiple network interfaces to meet the demand for mobility. With the emergence of 5G-technology, this trend will most ...
• #### Exploring Subexponential Parameterized Complexity of Completion Problems ﻿

(Peer reviewed; Journal article, 2014-02-19)
Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a graph ...
• #### Exploring the evolution of protein function in Archaea ﻿

(Peer reviewed; Journal article, 2012-05-30)
Background: Despite recent progress in studies of the evolution of protein function, the questions what were the first functional protein domains and what were their basic building blocks remain unresolved. Previously, we ...
• #### Exponential time algorithms: Structures, measures, and bounds ﻿

(Doctoral thesis, 2008-12-05)
This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running ...
• #### Expressive Visualization and Rapid Interpretation of Seismic Volumes ﻿

(Doctoral thesis, 2009-10-27)
One of the most important resources in the world today is energy. Oil and gas provide two thirds of the world energy consumption, making the world completely dependent on it. Locating and recovering the remaining oil and ...
• #### Extending balance assessment for the generalized propensity score under multiple imputation ﻿

(Journal article; Peer reviewed, 2020)
This manuscript extends the definition of the Absolute Standardized Mean Difference (ASMD) for binary exposure (M = 2) to cases for M > 2 on multiple imputed data sets. The Maximal Maximized Standardized Difference (MMSD) ...
• #### Extensive intraspecies cryptic variation in an ancient embryonic gene regulatory network ﻿

(Peer reviewed; Journal article, 2019-08-15)
Innovations in metazoan development arise from evolutionary modification of gene regulatory networks (GRNs). We report widespread cryptic variation in the requirement for two key regulatory inputs, SKN-1/Nrf2 and MOM-2/Wnt, ...
• #### Fast and accurate CNN-based brushing in scatterplots ﻿

(Journal article; Peer reviewed, 2018)
Brushing plays a central role in most modern visual analytics solutions and effective and efficient techniques for data selection are key to establishing a successful human‐computer dialogue. With this paper, we address ...
• #### Fast biclustering by dual parameterization ﻿

(Conference object; Peer reviewed; Journal article, 2015)
We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none ...
• #### Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes ﻿

(Master thesis, 2015-03-03)
In transportation networks, such as pipeline networks for transporting natural gas, it is often impractical to send across amounts of flow below a certain threshold. Such lower threshold is referred as the minimum-lot size. ...
• #### Fast methods to solve the pooling problem ﻿

(Master thesis, 2014-05-31)
In pipeline transportation of natural gas, simple network flow problems are replaced by hard ones when bounds on the flow quality are imposed. The sources, typically represented by gas wells, provide flow of unequal ...