Learn More
The ARB (from Latin arbor, tree) project was initiated almost 10 years ago. The ARB program package comprises a variety of directly interacting software tools for sequence database maintenance and analysis which are controlled by a common graphical user interface. Although it was initially designed for ribosomal RNA data, it can be used for any nucleic and(More)
MOTIVATION The computation of large phylogenetic trees with statistical models such as maximum likelihood or bayesian inference is computationally extremely intensive. It has repeatedly been demonstrated that these models are able to recover the true tree or a tree which is topologically closer to the true tree more frequently than less elaborate methods(More)
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the Maximum Likelihood (ML) method is computationally extremely intensive. In order to accelerate computations we implemented RAxML-OMP, an efficient OpenMP-parallelization for Symmetric Multi-Processing machines (SMPs) based on the sequential program RAxML-V(More)
The computation of large phylogenetic trees with maximum likelihood is computationally intensive. In previous work we have introduced and implemented algorithmic optimizations in <b>PAxML.</b> The program shows run time improvements &gt; 25% over <b>parallel fastDNAml</b> yielding exactly the same results. This paper is focusing on computations of large(More)
Summary form only given. Inference of phylogenetic trees comprising thousands of taxa using maximum likelihood is computationally extremely expensive. We present simple heuristics which yield accurate trees for simulated as well as real data and reduce execution time. The new heuristics have been implemented in a program called RAxML which is freely(More)
The paper presents an operating system kernel for highly parallel supercomputers, which was implemented on an iPSC/2 Hypercube with 32 processors. The kernel offers a process model, which is well suited for most partitioning strategies of parallel algorithms. The base for the efficiency of this object oriented, global, and dynamic programming concept are(More)
Distributed computing infrastructures provided by sensor networks supports new ways of observing human motion. In this paper, we discuss algorithms that use data from sensor networks for tracking the gait of human walk. Three methods for identifying footsteps and footstep patterns that describe a walk of a subject are discussed. The methods interpret the(More)