Browsing Department of Informatics by Document Types "Peer reviewed"
Now showing items 4160 of 292

Community curation of bioinformatics software and data resources
(Peer reviewed; Journal article, 2019)The corpus of bioinformatics resources is huge and expanding rapidly, presenting life scientists with a growing challenge in selecting tools that fit the desired purpose. To address this, the European Infrastructure for ... 
Community Detection on the GPU
(Conference object; Peer reviewed, 2017)We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune ... 
Communitydriven development for computational biology at Sprints, Hackathons and Codefests
(Peer reviewed; Journal article, 20141127)Background: Computational biology comprises a wide range of technologies and approaches. Multiple technologies can be combined to create more powerful workflows if the individuals contributing the data or providing tools ... 
A Comparative Analysis of Feature Selection Methods for Biomarker Discovery in Study of ToxicantTreated Atlantic Cod (Gadus Morhua) Liver
(Chapter; Conference object; Peer reviewed, 2019)Univariate and multivariate feature selection methods can be used for biomarker discovery in analysis of toxicant exposure. Among the univariate methods, differential expression analysis (DEA) is often applied for its ... 
Comparative Visualization of Protein Secondary Structures
(Peer reviewed; Journal article, 20170215)Background: Protein function is determined by many factors, namely by its constitution, spatial arrangement, and dynamic behavior. Studying these factors helps the biochemists and biologists to better understand the protein ... 
Comparison of Discrete and Continuous Models for the Pooling Problem
(Chapter; Peer reviewed, 2011)The pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and solved by branchandbound ... 
A complexity dichotomy for critical values of the bchromatic number of graphs
(Peer reviewed; Journal article, 20190820)A bcoloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The bColoring problem asks whether a graph G has ... 
A complexity dichotomy for critical values of the bchromatic number of graphs
(Journal article; Peer reviewed, 2020)A bcoloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The bColoring problem asks whether a graph G has ... 
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
(Journal article; Peer reviewed, 2019)In the Directed Steiner Network problem we are given an arcweighted digraph G, a set of terminals T subseteq V(G) with T=q, and an (unweighted) directed request graph R with V(R)=T. Our task is to output a subgraph H ... 
Computational science in the eighteenth century. Test cases for the methods of Newton, Raphson, and Halley: 1685 to 1745
(Peer reviewed; Journal article, 2020)This is an overview of examples and problems posed in the late 1600s up to the mid 1700s for the purpose of testing or explaining the two different implementations of the NewtonRaphson method, Newton’s method as described ... 
Computing cutwidth and pathwidth of semicomplete digraphs via degree orderings
(Conference object; Peer reviewed; Journal article, 2013)The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semicomplete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ... 
Connecting the Dots (with Minimum Crossings)
(Journal article; Peer reviewed, 2019)We study a prototype Crossing Minimization problem, defined as follows. Let F be an infinite family of (possibly vertexlabeled) graphs. Then, given a set P of (possibly labeled) n points in the Euclidean plane, a collection ... 
Conserved BK ChannelProtein Interactions Reveal Signals Relevant to Cell Death and Survival
(Peer reviewed; Journal article, 20111209)The largeconductance Ca2+activated K+ (BK) channel and its bsubunit underlie tuning in nonmammalian sensory or hair cells, whereas in mammals its function is less clear. To gain insights into species differences and ... 
Constructing APN functions through isotopic shifts
(Journal article; Peer reviewed, 2020)Almost perfect nonlinear (APN) functions over fields of characteristic 2 play an important role in cryptography, coding theory and, more generally, mathematics and information theory. In this paper we deduce a new method ... 
Continuous LevelsofDetail and Visual Abstraction for Seamless Molecular Visualization
(Peer reviewed; Journal article, 20140506)Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the ... 
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals
(Peer reviewed; Journal article, 2019)Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, an rrank perturbed graphic matroid M is a binary matroid that can be represented ... 
Current Trends for 4D SpaceTime Topology for Semantic Flow Segmentation
(Peer reviewed; Journal article, 2011) 
Curve Density Estimates
(Peer reviewed; Journal article, 20110628)In this work, we present a technique based on kernel density estimation for rendering smooth curves. With this approach, we produce uncluttered and expressive pictures, revealing frequency information about one, or, multiple ... 
CurveCentric Volume Reformation for Comparative Visualization
(Peer reviewed; Journal article, 20091011)We present two visualization techniques for curvecentric volume reformation with the aim to create compelling comparative visualizations. A curvecentric volume reformation deforms a volume, with regards to a curve in ... 
Cyclability in Graph Classes
(Peer reviewed; Journal article, 2019)A subset T subseteq V(G) of vertices of a graph G is said to be cyclable if G has a cycle C containing every vertex of T, and for a positive integer k, a graph G is kcyclable if every subset of vertices of G of size at ...