## PhiPack

Allows user to work on recombination. PhiPack is useful to treat large…

Allows user to work on recombination. PhiPack is useful to treat large alignments with hundreds of sequences.

×

Submit new tools

Share tools covering the current topic. Provide easy-to-follow guidelines to improve their usability.

The evolutionary history of a set of species is usually described by a rooted phylogenetic tree. Although it is generally undisputed that bifurcating speciation events and descent with modifications are major forces of evolution, there is a growing…

The evolutionary history of a set of species is usually described by a rooted phylogenetic tree. Although it is generally undisputed that bifurcating speciation events and descent with modifications are major forces of evolution, there is a growing belief that reticulate events also have a role to play. Phylogenetic networks provide an alternative to phylogenetic trees and may be more suitable for data sets where evolution involves significant amounts of reticulate events, such as hybridization, horizontal gene transfer, or recombination. Source text: Huson and Scornavacca, 2011.

×

Target the right tools

Use filters to sort tools by operating system, programing language, software type or skills.

PhiPack

Allows user to work on recombination. PhiPack is useful to treat large…

Allows user to work on recombination. PhiPack is useful to treat large alignments with hundreds of sequences.

TriLoNet

A Java software package created to construct phylogenetic networks directly…

A Java software package created to construct phylogenetic networks directly from sequence alignments which works by piecing together smaller phylogenetic networks. More specifically, TriLoNet…

HybridCheck

An R package for easy detection and dating, and visualisation of recombination,…

An R package for easy detection and dating, and visualisation of recombination, introgression and hybridisation events in genomes. HybridCheck can be used to analyse recombination, genetic…

FlatNJ

Allows to analyze and visualize data. FlatNJ permits the estimation of pendant…

Allows to analyze and visualize data. FlatNJ permits the estimation of pendant edge lengths and allows internal vertices in the network to be labeled. It provides the option to produce a network that…

Quartet-net

A quartet-based method to construct a phylogenetic network from a multiple…

A quartet-based method to construct a phylogenetic network from a multiple sequence alignment. Unlike distances that only reflect the relationship between a pair of taxa, quartets contain information…

QNet

A method for constructing split networks from weighted quartet trees. QNet can…

A method for constructing split networks from weighted quartet trees. QNet can be viewed as a quartet analogue of the distance-based Neighbor-Net (NNet) method for network construction. Just as NNet,…

snpTree

Provides an online pipeline which intregrate available single nucletide…

Provides an online pipeline which intregrate available single nucletide polymorphisms (SNPs) analysis softwares with customized scripts. snpTree is a web application for online-automatic SNP analysis…

PADRE

A Java software package allowing the computation and graphical representation…

A Java software package allowing the computation and graphical representation of reticulate networks from (a collection of) multi-labeled trees. If a collection of trees are loaded, the software…

SuperQ

Includes the option to switch off the scaling of the input trees and also…

Includes the option to switch off the scaling of the input trees and also provides alternatives to objective function. SuperQ represents a method to construct super-networks from partial trees. It…

MixMapper

An interactive method for constructing phylogenetic trees including admixture…

An interactive method for constructing phylogenetic trees including admixture events using single nucleotide polymorphism (SNP) genotype data. MixMapper implements a novel two-phase approach to…

Network…

A software package for calculating beta diversity over split systems, a widely…

A software package for calculating beta diversity over split systems, a widely used class of implicit phylogenetic networks. Network Diversity, provides 11 qualitative (presence-absence, unweighted)…

HyDe

Allows detection of hybridization using phylogenetic invariants. HyDe provides…

Allows detection of hybridization using phylogenetic invariants. HyDe provides methods to detect hybridization at both the population and individual levels and other features to discover individual…

MGUPGMA

Enhances the computational performance of constructing a phylogenetic tree from…

Enhances the computational performance of constructing a phylogenetic tree from a huge amount of sequences. MGUPGMA is an Unweighted Pair Group Method with Arithmetic Mean (UPGMA) algorithm, based on…

ParSplit

Allows user to identify evolutionary shifts detected from methods based on…

Allows user to identify evolutionary shifts detected from methods based on stochastic models of evolution. ParSplit is a software performing the parsimonious split of a phylogenetic tree with regard…

SPECTRE

Provides a collection of open-source tools and resources for modelling,…

Provides a collection of open-source tools and resources for modelling, understanding and visualizing reticulate evolution based on planar split networks. SPECTRE enables bioinformaticians to test…

Simple…

Provides access to phylogenetic tree generation methods from the ClustalW2…

Provides access to phylogenetic tree generation methods from the ClustalW2 package. Simple Phylogeny is an online method to perform basic phylogenetic analysis on a multiple sequence alignment. It…

Species Network

Provides a general framework for Bayesian inference of reticulate evolution.…

Provides a general framework for Bayesian inference of reticulate evolution. Species Network is a Bayesian approach to jointly infer species networks and gene trees from multilocus sequence data.…

PhaME

A phylogenetic and molecular evolution analysis tool. Given a reference, PhaME…

A phylogenetic and molecular evolution analysis tool. Given a reference, PhaME extracts SNPs from complete genomes, draft genomes and/or reads, and uses SNP multiple sequence alignment to construct a…

BMhyd

Analyzes the phenotypic evolution of species of hybrid origin on a phylogenetic…

Analyzes the phenotypic evolution of species of hybrid origin on a phylogenetic network. BMhyd can detect the hybrid vigor effect, a burst of variation at formation, and the relative portion of…

Hybroscale

There exist some programs for visualizing rooted trees or networks, only few…

There exist some programs for visualizing rooted trees or networks, only few programs for computing and analyzing hybridization networks embedding two bifurcating input trees, and no program,…

PhyloNet-HMM

Consists of a statistical model and associated inference method for analyzing…

Consists of a statistical model and associated inference method for analyzing complex evolutionary scenarios, especially non-tree-like evolutionary scenarios. PhyloNet-HMM combines phylogenetic…

PhyloNetwork

Relies on the BioPerl bundle and implements several algorithms on phylogenetic…

Relies on the BioPerl bundle and implements several algorithms on phylogenetic networks, from parsing and temporal representation to distances between phylogenetic networks and optimal alignments.…

PhyBin

Assists in classification of Newick tree files by considering topology. PhyBin…

Assists in classification of Newick tree files by considering topology. PhyBin allows user to browse through the most common tree topologies. it can serve as a component in many genomics pipelines.…

MTRT

A heuristic algorithm for the SMRT problem. The goal of MTRT is to construct a…

A heuristic algorithm for the SMRT problem. The goal of MTRT is to construct a minimal MUL tree that is consistent with the input set of triplets and minimizes the number of its duplications. We…

TripNet

A heuristic algorithm which tries to construct a rooted phylogenetic network…

A heuristic algorithm which tries to construct a rooted phylogenetic network with the minimum number of reticulation nodes from an arbitrary set of rooted triplets. Despite of current methods that…

Network

Reconstructs phylogenetic networks and trees, infers ancestral types and…

Reconstructs phylogenetic networks and trees, infers ancestral types and potential types, evolutionary branchings and variants, and estimates datings. Network includes a data editor and a graphics…

MY-CLOSURE

A software tool for computing supernetworks from partial phylogenetic trees.

A software tool for computing supernetworks from partial phylogenetic trees.

LNETWORK

An improved Cass algorithm which can construct a phylogenetic network for a…

An improved Cass algorithm which can construct a phylogenetic network for a given set of clusters. We show that LNETWORK is significantly faster than Cass and effectively weakens the influence of…

HybridNET

A program for constructing a hybridization network with the minimum number of…

A program for constructing a hybridization network with the minimum number of reticulate vertices from two input trees. HybridNet outputs an MAAF (respectively, MAF) by printing out the leaf sets of…

PIRN

A program for reconstructing the most parsimonious phylogenetic networks that…

A program for reconstructing the most parsimonious phylogenetic networks that contain a set of given phylogenetic trees. One motivation is that the trees are the gene trees and the phylogenetic…

SPRDist

Computes exact subtree prune and regraft distance. SPRDist uses integer…

Computes exact subtree prune and regraft distance. SPRDist uses integer programming to solve the problem of computing the rooted subtree prune and regraft (rSPR) distances between two rooted binary…

MC-Net

A method for the construction of phylogenetic networks based on Monte-Carlo…

A method for the construction of phylogenetic networks based on Monte-Carlo method. MC-Net finds a circular ordering for taxa, based on Monte-Carlo with simulated annealing, it then extracts splits…

BIMLR

A method for building phylogenetic networks. BIMLR reduces the number of…

A method for building phylogenetic networks. BIMLR reduces the number of constructed networks when the input data order changes. It reduces the number of redundant clusters represented by the…

UltraNet

A package for generating reticulate networks from two or more phylogenetic…

A package for generating reticulate networks from two or more phylogenetic trees. UltraNet utilizes two algorithms for rSPR distance and for hybridization number of two given trees.

DendroUPGMA

Allows user to create a dendrogram from a distance matrix, a set of variables…

Allows user to create a dendrogram from a distance matrix, a set of variables or a similarity matrix. DendroUPGMA can realize different actions such as: computation of a a similarity matrix (only for…

MCQ.Net

A heuristic algorithm based on the simulated annealing as a method for…

A heuristic algorithm based on the simulated annealing as a method for constructing phylogenetic networks from weighted quartets. MCQ.Net finds a circular ordering for taxa and then extracts splits…

By using OMICtools you acknowledge that you have read and accepted the terms of the end user license agreement.