## 004 Datenverarbeitung; Informatik

### Refine

#### Year of publication

- 2012 (17) (remove)

#### Document Type

- Journal article (11)
- Doctoral Thesis (5)
- Preprint (1)

#### Keywords

- resistance (2)
- Angewandte Informatik (1)
- Ausfallsicheres System (1)
- Ausfallsicherheit (1)
- Betriebssystem (1)
- Design (1)
- Diagnosesystem (1)
- Drahtloses Sensorsystem (1)
- Dynamic Memory Management (1)
- Dynamische Speicherverwaltung (1)
- Echtzeitsystem (1)
- Eingebettetes System (1)
- Embedded Systems (1)
- Fernwartung (1)
- H.264 SVC (1)
- H.264/SVC (1)
- Image Registration (1)
- Inferenz <Künstliche Intelligenz> (1)
- Informatik (1)
- Knowledge Management System (1)
- Knowledge-based System (1)
- Koran (1)
- Künstliche Intelligenz (1)
- Localization (1)
- Lokalisation (1)
- Mehrpfadübertragung (1)
- Mehrschichtnetze (1)
- Mehrschichtsystem (1)
- Modellbasierte Diagnose (1)
- Modellierung (1)
- Multi-Layer (1)
- Multipath Transmission (1)
- Mycoplasma (1)
- NP-hardness (1)
- Newton Methods (1)
- Newton-Verfahren (1)
- Optimization on Lie Groups (1)
- Path Computation Element (1)
- Performance Modeling (1)
- Pfadberechnungselement (1)
- Planung (1)
- QoE (1)
- Quality-of-Experience (1)
- Quran (1)
- Real-Time Operating Systems (1)
- Registrierung <Bildverarbeitung> (1)
- Resilience (1)
- Resource Management (1)
- Ressourcenallokation (1)
- Ressourcenmanagement (1)
- Stochastic Algorithms (1)
- Stochastische Optimierung (1)
- Text Mining (1)
- Verteiltes System (1)
- Video Streaming (1)
- Videoübertragung (1)
- Visualisierung (1)
- Visualization (1)
- Werkstattdiagnose (1)
- Wireless Sensor/Actuator Systems (1)
- Wissensbanksystem (1)
- Wissensmanagement (1)
- Yolk protein (1)
- aftermarket diagnostic (1)
- alignment (1)
- approximation algorithm (1)
- arabidopsis thaliana (1)
- arabidpsis thaliana (1)
- binary tanglegram (1)
- brain (1)
- caenorhabditis elegans (1)
- cerebral ischemia (1)
- classification (1)
- colony-stimulating factor (1)
- combination therapy (1)
- connector (1)
- corticotropin-releasing hormone (1)
- crossing minimization (1)
- crosstalk (1)
- database (1)
- differentiation (1)
- disease (1)
- drug (1)
- elementary mode analysis (1)
- engineering (1)
- expression (1)
- expression signature (1)
- fixed-parameter tractability (1)
- gamma (1)
- genes (1)
- genetics (1)
- hierarchy (1)
- histidine kinase (1)
- homology modeling (1)
- hybrid Diagnostic (1)
- hybride Diagnose (1)
- immunity (1)
- inhibitor (1)
- internal transcribed spacer 2 (1)
- life-span regulation (1)
- malaria (1)
- markers (1)
- metabolic flux (1)
- metastasis (1)
- methylene blue (1)
- model-base diagnosis (1)
- modules (1)
- molecular systematics (1)
- mouse (1)
- organogenesis (1)
- pathway (1)
- phylogenetic tree (1)
- phylogeny (1)
- promoter (1)
- protein (1)
- protein-interaction networks (1)
- pseudomas-syringae (1)
- receptor (1)
- response regulator (1)
- ribosomal RNA (1)
- richtersius coronifer (1)
- satisfiability problems (1)
- secondary structure (1)
- sensor (1)
- sequence alignment (1)
- set (1)
- skalierbare Diagnose (1)
- stability (1)
- superoxide-dismutase (1)
- survival (1)
- synthetic biology (1)
- tolerance (1)
- transcription (1)
- vitellogenin (1)
- water stress (1)

In this paper we study connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such that the resulting graph keeps the property. The aim is to add as few edges as possible. The property that we consider is planarity, both in an abstract graph-theoretic and in a geometric setting, where vertices correspond to points in the plane and edges to straight-line segments.
We show that it is NP-hard to nd a minimum-cardinality augmentation that makes a planar graph 2-edge connected. For making a planar graph 2-vertex connected this was known. We further show that both problems are hard in the geometric setting, even when restricted to trees. The problems remain hard for higher degrees of connectivity. On the other hand we give polynomial-time algorithms for the special case of convex geometric graphs.
We also study the following related problem. Given a planar (plane geometric) graph G, two vertices s and t of G, and an integer c, how many edges have to be added to G such that G is still planar (plane geometric) and contains c edge- (or vertex-) disjoint s{t paths? For the planar case we give a linear-time algorithm for c = 2. For the plane geometric case we give optimal worst-case bounds for c = 2; for c = 3 we characterize the cases that have a solution.

This work takes a close look at several quite different research areas related to the design of networked embedded sensor/actuator systems. The variety of the topics illustrates the potential complexity of current sensor network applications; especially when enriched with actuators for proactivity and environmental interaction. Besides their conception, development, installation and long-term operation, we'll mainly focus on more "low-level" aspects: Compositional hardware and software design, task cooperation and collaboration, memory management, and real-time operation will be addressed from a local node perspective. In contrast, inter-node synchronization, communication, as well as sensor data acquisition, aggregation, and fusion will be discussed from a rather global network view. The diversity in the concepts was intentionally accepted to finally facilitate the reliable implementation of truly complex systems. In particular, these should go beyond the usual "sense and transmit of sensor data", but show how powerful today's networked sensor/actuator systems can be despite of their low computational performance and constrained hardware: If their resources are only coordinated efficiently!

Cover contact graphs
(2012)

We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by a set of other geometric objects called cover (e.g., a set of disks or homothetic triangles). We insist that the interiors of the seeds and the cover elements are pairwise disjoint, respectively, but they can touch. We call the contact graph of a cover a cover contact graph (CCG). We are interested in three types of tasks, both in the general case and in the special case of seeds on a line: (a) deciding whether a given seed set has a connected CCG, (b) deciding whether a given graph has a realization as a CCG on a given seed set, and (c) bounding the sizes of certain classes of CCG’s. Concerning (a) we give efficient algorithms for the case that seeds are points and show that the problem becomes hard if seeds and covers are disks. Concerning (b) we show that this problem is hard even for point seeds and disk covers (given a fixed correspondence between graph vertices and seeds). Concerning (c) we obtain upper and lower bounds on the number of CCG’s for point seeds.

BACKGROUND: In the face of growing resistance in malaria parasites to drugs, pharmacological combination therapies are important. There is accumulating evidence that methylene blue (MB) is an effective drug against malaria. Here we explore the biological effects of both MB alone and in combination therapy using modeling and experimental data.
RESULTS: We built a model of the central metabolic pathways in P. falciparum. Metabolic flux modes and their changes under MB were calculated by integrating experimental data (RT-PCR data on mRNAs for redox enzymes) as constraints and results from the YANA software package for metabolic pathway calculations. Several different lines of MB attack on Plasmodium redox defense were identified by analysis of the network effects. Next, chloroquine resistance based on pfmdr/and pfcrt transporters, as well as pyrimethamine/sulfadoxine resistance (by mutations in DHF/DHPS), were modeled in silico. Further modeling shows that MB has a favorable synergism on antimalarial network effects with these commonly used antimalarial drugs.
CONCLUSIONS: Theoretical and experimental results support that methylene blue should, because of its resistance-breaking potential, be further tested as a key component in drug combination therapy efforts in holoendemic areas.

Two-component systems (TCS) are short signalling pathways generally occurring in prokaryotes. They frequently regulate prokaryotic stimulus responses and thus are also of interest for engineering in biotechnology and synthetic biology. The aim of this study is to better understand and describe rewiring of TCS while investigating different evolutionary scenarios. Based on large-scale screens of TCS in different organisms, this study gives detailed data, concrete alignments, and structure analysis on three general modification scenarios, where TCS were rewired for new responses and functions: (i) exchanges in the sequence within single TCS domains, (ii) exchange of whole TCS domains; (iii) addition of new components modulating TCS function. As a result, the replacement of stimulus and promotor cassettes to rewire TCS is well defined exploiting the alignments given here. The diverged TCS examples are non-trivial and the design is challenging. Designed connector proteins may also be useful to modify TCS in selected cases.

The ITS2 Database
(2012)

The internal transcribed spacer 2 (ITS2) has been used as a phylogenetic marker for more than two decades. As ITS2 research mainly focused on the very variable ITS2 sequence, it confined this marker to low-level phylogenetics only. However, the combination of the ITS2 sequence and its highly conserved secondary structure improves the phylogenetic resolution1 and allows phylogenetic inference at multiple taxonomic ranks, including species delimitation.
The ITS2 Database presents an exhaustive dataset of internal transcribed spacer 2 sequences from NCBI GenBank accurately reannotated. Following an annotation by profile Hidden Markov Models (HMMs), the secondary structure of each sequence is predicted. First, it is tested whether a minimum energy based fold (direct fold) results in a correct, four helix conformation. If this is not the case, the structure is predicted by homology modeling. In homology modeling, an already known secondary structure is transferred to another ITS2 sequence, whose secondary structure was not able to fold correctly in a direct fold.
The ITS2 Database is not only a database for storage and retrieval of ITS2 sequence-structures. It also provides several tools to process your own ITS2 sequences, including annotation, structural prediction, motif detection and BLAST search on the combined sequence-structure information. Moreover, it integrates trimmed versions of 4SALE and ProfDistS for multiple sequence-structure alignment calculation and Neighbor Joining tree reconstruction. Together they form a coherent analysis pipeline from an initial set of sequences to a phylogeny based on sequence and secondary structure.
In a nutshell, this workbench simplifies first phylogenetic analyses to only a few mouse-clicks, while additionally providing tools and data for comprehensive large-scale analyses.

A binary tanglegram is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a tanglegram with the minimum number of crossings is NP-hard and that the problem is fixed-parameter tractable with respect to that number.
We prove that under the Unique Games Conjecture there is no constant-factor approximation for binary trees. We show that the problem is NP-hard even if both trees are complete binary trees. For this case we give an O(n 3)-time 2-approximation and a new, simple fixed-parameter algorithm. We show that the maximization version of the dual problem for binary trees can be reduced to a version of MaxCut for which the algorithm of Goemans and Williamson yields a 0.878-approximation.

Recently, several classifiers that combine primary tumor data, like gene expression data, and secondary data sources, such as protein-protein interaction networks, have been proposed for predicting outcome in breast cancer. In these approaches, new composite features are typically constructed by aggregating the expression levels of several genes. The secondary data sources are employed to guide this aggregation. Although many studies claim that these approaches improve classification performance over single genes classifiers, the gain in performance is difficult to assess. This stems mainly from the fact that different breast cancer data sets and validation procedures are employed to assess the performance. Here we address these issues by employing a large cohort of six breast cancer data sets as benchmark set and by performing an unbiased evaluation of the classification accuracies of the different approaches. Contrary to previous claims, we find that composite feature classifiers do not outperform simple single genes classifiers. We investigate the effect of (1) the number of selected features; (2) the specific gene set from which features are selected; (3) the size of the training set and (4) the heterogeneity of the data set on the performance of composite feature and single genes classifiers. Strikingly, we find that randomization of secondary data sources, which destroys all biological information in these sources, does not result in a deterioration in performance of composite feature classifiers. Finally, we show that when a proper correction for gene set size is performed, the stability of single genes sets is similar to the stability of composite feature sets. Based on these results there is currently no reason to prefer prognostic classifiers based on composite features over single genes classifiers for predicting outcome in breast cancer.

Tardigrades have fascinated researchers for more than 300 years because of their extraordinary capability to undergo cryptobiosis and survive extreme environmental conditions. However, the survival mechanisms of tardigrades are still poorly understood mainly due to the absence of detailed knowledge about the proteome and genome of these organisms. Our study was intended to provide a basis for the functional characterization of expressed proteins in different states of tardigrades. High-throughput, high-accuracy proteomics in combination with a newly developed tardigrade specific protein database resulted in the identification of more than 3000 proteins in three different states: early embryonic state and adult animals in active and anhydrobiotic state. This comprehensive proteome resource includes protein families such as chaperones, antioxidants, ribosomal proteins, cytoskeletal proteins, transporters, protein channels, nutrient reservoirs, and developmental proteins. A comparative analysis of protein families in the different states was performed by calculating the exponentially modified protein abundance index which classifies proteins in major and minor components. This is the first step to analyzing the proteins involved in early embryonic development, and furthermore proteins which might play an important role in the transition into the anhydrobiotic state.