Job

PEAR – Paired-End reAd mergeR

15.05.2019

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

Mehr erfahren
Job

GapMis

15.05.2019

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

Mehr erfahren
Job

libgapmis

25.03.2019

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

Mehr erfahren
Job

genesis

25.03.2019

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

Mehr erfahren
Job

Evolutionary Placement Algorithm

25.03.2019

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

Mehr erfahren
Job

PaPaRa

25.03.2019

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
Job

MoTeX

25.03.2019

An accurate and efficient tool for MoTif eXtraction.

Mehr erfahren
Job

ChromatoGate

25.03.2019

A tool for analyzing and editing/correcting chromatogram data.

Mehr erfahren
Job

SATIVA

25.03.2019

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

Mehr erfahren
Job

EPA next generation

25.03.2019

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

Mehr erfahren

Zur englischen Seite wechseln oder auf dieser Seite bleiben.