Software
ExaML
Exascale Maximum Likelihood (ExaML): Code for extremely large-scale phylogenetic inference on supercomputers using MPI.
Mehr erfahrenPhylogenetic Likelihood Library
Phylogenetic Likelihood Library: A highly optimized and parallized library for rapid prototyping and development of likelihood based phylogenetic inference codes.
Mehr erfahrenPerpetyally 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 erfahrenRAxML-Light
A strapped down checkpointable RAxML version for computing huge trees on supercomputers. Development of this code has stopped, please use …
Mehr erfahrenParsimonator
A fast and simple open-source parsimony program for building phylogenies on DNA data.Hybrid MrBayes Parallelized Bayesian tree inference for large-scale …
Mehr erfahrenRAxML next generation
The all new, from scratch re-design of RAxML: better, faster, more scalable, easier to use.
Mehr erfahrenModelTest next generation
The all new faster ModelTest, superseding jModelTest and ProtTest.
Mehr erfahrenVisual Tree Comparer
A simple graphical tree comparison tool that visualizes differences between up to four different trees by highlighting the branches (bipartitions/splits) …
Mehr erfahrenTree Visualization Tool (very old)
Old Tree visualization tool using treemaps and taxonomic information.
Mehr erfahrenAxParafit
Highly optimized versions of Pierre Legendre’s Parafit and DistPCoA programs for statistical analysis of host-parasite coevolution.
Mehr erfahrenDppdiv
An optimized (using vector intrinsics) and parallelized version (using OpenMP) of the DPPDIV (original code by Tracy Heath) code for estimating …
Mehr erfahrenPhylogenetic 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 erfahrenForeSeqs
Prediction of missing sequences and branch lengths on phylogenies inferred using MSAs that have missing/gappy data.
Mehr erfahrenMPTP
A substantially faster, more scalable, and more accurate version of our PTP tool for single locus species delimitation
Mehr erfahrenPEAR – 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 …
Mehr erfahrenGapMis
A tool for flexible pairwise sequence alignment with a variable, but bounded, number of gaps.
Mehr erfahrenlibgapmis
An ultrafast library for pairwise short-read alignment, based on GapMis, including accelerated SSE-based and GPU-based versions.
Mehr erfahrengenesis
A toolkit for working with phylogenetic data, mainly for evolutionary placements of short NGS reads on a reference phylogenetic tree. The …
Mehr erfahrenEvolutionary Placement Algorithm
Algorithm for placing short reads onto a given reference phylogeny. This is part of standard RAxML.
Mehr erfahrenPaPaRa
PArsimony-based Phylogeny-Aware Read alignment program. The tool uses a given multipe sequence alignment and corresponding reference tree to align short reads …
Mehr erfahrenSATIVA
Semi-Automatic Taxonomy Improvement and Validation Algorithm. Identifies taxonomically mislabeled sequences and suggests corrections using EPA (Evolutionary Placement Algorithm).
Mehr erfahrenEPA next generation
Stand-alone, much faster, and massively parallel re-implementation of the Evolutionary Placement Algorithm.
Mehr erfahrenSweed
A parallel and checkpointable tool that implements a composite likelihood ratio test for detecting selective sweeps. SweeD is based on the …
Mehr erfahrenOmegaPlus
A parallel tool for rapid & scalable detection of selective sweeps in whole-genome datasets using the omega statistic.
Mehr erfahrenRAxML-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 erfahrenWEB-Servers for evolutionary placement of short reads
Our basic serverFancy Swiss Server
Mehr erfahrenRogue Taxon Identification Web-Server
Mehr erfahrenPTP Web-Service
Access the web server for species delimitation using our new PTP method.
Mehr erfahrenRAxML Web Servers
Vital IT unit of the Swiss Institute of BioinformaticsCIPRES portal at San Diego Supercomputer CenterNew beta-version of the CIPRES portal&…
Mehr erfahrenMPTP Web Server
Access the new species delimitation web service using the new mptp approach.
Mehr erfahrenMicrobenchmark 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 erfahrenReconfigurable Architectures (FPGAs)
Reconfigurable architectures for Bioinformatics applications designed by our former lab member Dr. Nikos Alachiotis.
Mehr erfahrenFile conversion scripts
Shell script for fasta to phylip conversion.Matlab programs by Lowie Li for fasta to phylip and&…
Mehr erfahrenTreeCounter
Small program to compute the number of possible rooted and unrooted binary trees for n taxa or to compute the number …
Mehr erfahren