Search

reached from there. K’s predecessor states, namely G and J, are unsafe for the same reason. If we take a look at the predecessor states of G and J (namely L and G), we can see that these are already known to [...] states and permissible state transitions explicitly, but we represent them symbolically using logical formulas. For example, the formula b5 and not b32 describes all states for which b5 is true and b32 is [...] How can this problem be approached? We can describe states and state transitions using graphs. To this end, we symbolize each state by a circle and each possible state transition by an arrow. The result may

.mpg.de Christine Rizkallah DEPT. 1 Algorithms and ComplexityPhone +49 681 9325-1112Email crizkall@mpi-inf.mpg.de Jens M. Schmidt DEPT. 1 Algorithms and ComplexityPhone +49 681 9325-1008Email jeschmid@mpi-inf [...] alternative tools for the verification framework and comparing the results in terms of trust and effort needed. Adrian Neumann DEPT. 1 Algorithms and ComplexityPhone +49 681 9325-1022Email aneumann@mpi-inf [...] 3-connected graph G Transferring an algorithm (i.e. a solution procedure to computer code is difficult and error prone. For that reason, the code may contain many mistakes, and subtle errors can be very hard

theoretic results of Gödel and Turing at the beginning of the twentieth century, it has been known that not everything that is true in a mathematical sense is actually provable, and that not everything that [...] differ significantly in their expressiveness and properties. For example, decision procedures are specialized for a certain type of data (e.g., real numbers) and are guaranteed to detect the correctness or [...] developed by Bachmair and Ganzinger in 1990 offers a way out of this dilemma. On the one hand, it performs calculations in a forward direction; on the other hand, it systematically identifies and repairs the possible

simple, and in practice very efficient, process such that it could compete with the optimal methods, even in terms of theoretical complexity. Michael Sagraloff DEPT. 1 Algorithms and ComplexityPhone +49 [...] Polynomial Systems and Applications in Geometric Computing Exact Solving of Polynomial Systems and Applications in Geometric Computing Michael Sagraloff Exact Solving of Polynomial Systems and Applications in [...] physics, and engineering. The research group “Computer Algebra and Geometric Computing” primarily investigates such systems as they typically arise from geometric problems. Most algorithms from computational

Home News & Events Guarantees Distributed Algorithms for Fault-tolerant Hardware Exact Solving of Polynomial Systems and Applications in Geometric Computing Automated Deduction How to Trust the Output

Lengauer DEPT. 3 Computational Biology and Applied AlgorithmicsPhone +49 681 9325-3000Email legenauer@mpi-inf.mpg.de Structural Variation in Genomes Protein Structure and Interactions Bioinformatical Support [...] which healthy cells are different from diseased cells, and which implement central biological processes such as the cellular response to stress and the process of aging. These aspects of cell regulation [...] euros comprises the German contribution to IHEC. Within DEEP, metabolic and immunologic diseases in particular are investigated, and another 70 epigenomes are charted. The Max Planck Institute for Informatics

Bioinformatics Networks and Phylogenies: Understanding Disease Spread and Evolution Networks and Phylogenies: Understanding Disease Spread and Evolution Glenn Lawyer Networks and Phylogenies: Understanding [...] Lawyer DEPT. 3 Computational Biology and Applied Algorithmics Phone +49 681 9325-3007 Email lawyer@mpi-inf.mpg.de Structural Variation in Genomes Protein Structure and Interactions Bioinformatical Support [...] Understanding Disease Spread and Evolution Network models of disease spread Networks, where nodes represent individuals or groups, and edges the connections between them, have become the premier mathematical structure

antibody tests and are consequently an important step on the way towards developing a universal vaccine against HIV. Nico Pfeifer DEPT. 3 Computational Biology and Applied AlgorithmicsPhone +49 681 93 [...] usage. This could provide information on the mechanism of interaction between the V3 loop and the coreceptor and can potentially lead to new measures to attack HIV. Analysis of different antibodies against [...] Genomes Protein Structure and Interactions Bioinformatical Support of HIV Therapy Analysis of Viral Genomes Using Next-generation Sequencing Attacking HIV from New Angles Networks and Phylogenies: Understanding

by non-specialists and are both highly scalable and replicable. Additionally, analysis workflows and results can conveniently be shared over the Internet, encouraging communication and collaboration. Sequence [...] 3 Computational Biology and Applied Algorithmics Phone +49 681 9325-3016 Email beggel@mpi-inf.mpg.de Sven-Eric Schelhorn DEPT. 3 Computational Biology and Applied Algorithmics Phone +49 681 9325-3028 Email [...] genome sequences of both the virus and its human host. These genome sequences provide the basis for understanding the complex molecular interplay between the pathogen and the patient, knowledge that is crucial

Lengauer DEPT. 3 Computational Biology and Applied AlgorithmicsPhone +49 681 9325-3000Email legenauer@mpi-inf.mpg.de Structural Variation in Genomes Protein Structure and Interactions Bioinformatical Support [...] Genomes Using Next-generation Sequencing Attacking HIV from New Angles Networks and Phylogenies: Understanding Disease Spread and Evolution Charting Epigenomes [...] Bioinformatical Support of HIV Therapy Thomas Lengauer Bioinformatical Support of HIV Therapy Preventing and controlling viral resistance is the central goal when administering drug therapies against viral infections