CME Gruppe
Computational Molecular Evolution

Software

Software Phylogenetic Inference

RAxML

Our standard tool for Maximum-likelihood based phylogenetic inference.

Mehr erfahren

ExaML

Exascale Maximum Likelihood (ExaML): Code for extremely large-scale phylogenetic inference on supercomputers using MPI.

Mehr erfahren

Phylogenetic Likelihood Library

Phylogenetic Likelihood Library: A highly optimized and parallized library for rapid prototyping and development of likelihood based phylogenetic inference codes.

Mehr erfahren

Perpetyally updating trees

A pipeline that automatically updates reference trees using RAxML-Light when new sequences for the clade of interest appear on GenBank or …

Mehr erfahren

RAxML-Light

A strapped down checkpointable RAxML version for computing huge trees on supercomputers. Development of this code has stopped, please use …

Mehr erfahren

Parsimonator

A fast and simple open-source parsimony program for building phylogenies on DNA data.Hybrid MrBayes Parallelized Bayesian tree inference for large-scale …

Mehr erfahren

ExaBayes

Parallelized Bayesian tree inference for large-scale datasets.

Mehr erfahren

llpll

New, flexible low level phylogenetic likelihood library.

Mehr erfahren

RAxML next generation

The all new, from scratch re-design of RAxML: better, faster, more scalable, easier to use.

Mehr erfahren

ModelTest next generation

The all new faster ModelTest, superseding jModelTest and ProtTest.

Mehr erfahren

libpll-2

Second version of libpll, including site repeats optimization.

Mehr erfahren
Phylogenetic Post-Analysis

Visual Tree Comparer

A simple graphical tree comparison tool that visualizes differences between up to four different trees by highlighting the branches (bipartitions/splits) …

Mehr erfahren

Tree Visualization Tool (very old)

Old Tree visualization tool using treemaps and taxonomic information.

Mehr erfahren

AxParafit

Highly optimized versions of Pierre Legendre’s Parafit and DistPCoA programs for statistical analysis of host-parasite coevolution.

Mehr erfahren

Rogue Taxon Identification

A new, scalable algorithm for rogue taxon identification.

Mehr erfahren

Dppdiv

An optimized (using vector intrinsics) and parallelized version (using OpenMP) of the DPPDIV (original code by Tracy Heath) code for estimating …

Mehr erfahren

Phylogenetic Binning tool

The code from the paper: S. Berger, R. Lücking, A. Stamatakis on “Morphology-based phylogenetic binning of the lichen genera Graphis …

Mehr erfahren

ForeSeqs

Prediction of missing sequences and branch lengths on phylogenies inferred using MSAs that have missing/gappy data.

Mehr erfahren

PTP

A tool for delimiting species on phylogenies and evolutionary placements.

Mehr erfahren

MPTP

A substantially faster, more scalable, and more accurate version of our PTP tool for single locus species delimitation

Mehr erfahren
Next Generation Sequencing & Sequence Analysis

PEAR – Paired-End reAd mergeR

An ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just …

GapMis

A tool for flexible pairwise sequence alignment with a variable, but bounded, number of gaps.

Mehr erfahren

libgapmis

An ultrafast library for pairwise short-read alignment, based on GapMis, including accelerated SSE-based and GPU-based versions.

Mehr erfahren

genesis

A toolkit for working with phylogenetic data, mainly for evolutionary placements of short NGS reads on a reference phylogenetic tree. The …

Mehr erfahren

Evolutionary Placement Algorithm

Algorithm for placing short reads onto a given reference phylogeny. This is part of standard RAxML.

Mehr erfahren

PaPaRa

PArsimony-based Phylogeny-Aware Read alignment program. The tool uses a given multipe sequence alignment and corresponding reference tree to align short reads …

Mehr erfahren

MoTeX

An accurate and efficient tool for MoTif eXtraction.

Mehr erfahren

ChromatoGate

A tool for analyzing and editing/correcting chromatogram data.

Mehr erfahren

SATIVA

Semi-Automatic Taxonomy Improvement and Validation Algorithm. Identifies taxonomically mislabeled sequences and suggests corrections using EPA (Evolutionary Placement Algorithm).

Mehr erfahren

EPA next generation

Stand-alone, much faster, and massively parallel re-implementation of the Evolutionary Placement Algorithm.

Mehr erfahren
Population Genetics

AnA-FiTS

A very fast forward-in-time simulator for population genetics.

Mehr erfahren

Sweed

A parallel and checkpointable tool that implements a composite likelihood ratio test for detecting selective sweeps. SweeD is based on the …

Mehr erfahren

OmegaPlus

A parallel tool for rapid & scalable detection of selective sweeps in whole-genome datasets using the omega statistic.

Mehr erfahren
Web Services

RAxML-Light Web-Service

Available at the San Diego Supercomputer Center (supported by the NSF iPlant collaborative) To use this service you will first need …

Mehr erfahren

WEB-Servers for evolutionary placement of short reads

Our basic serverFancy Swiss Server

Mehr erfahren

Rogue Taxon Identification Web-Server

Mehr erfahren

PTP Web-Service

Access the web server for species delimitation using our new PTP method.

Mehr erfahren

RAxML Web Servers

Vital IT unit of the Swiss Institute of BioinformaticsCIPRES portal at San Diego Supercomputer CenterNew beta-version of the CIPRES portal&…

Mehr erfahren

MPTP Web Server

Access the new species delimitation web service using the new mptp approach.

Mehr erfahren

Miscellaneous

Microbenchmark for Denormalized Floating Point Numbers

A small benchmark code, mainly for teaching purposes that can be used to highlight the performance impact of de-normalized floating point …

Mehr erfahren

Reconfigurable Architectures (FPGAs)

Reconfigurable architectures for Bioinformatics applications designed by our former lab member Dr. Nikos Alachiotis.

Mehr erfahren

File conversion scripts

Shell script for fasta to phylip conversion.Matlab programs by Lowie Li for fasta to phylip and&…

Mehr erfahren

TreeCounter

Small program to compute the number of possible rooted and unrooted binary trees for n taxa or to compute the number …

Mehr erfahren

Zur englischen Seite wechseln oder auf dieser Seite bleiben.