erate is an extension of Joe Felsenstein’s DNAML program which treats insertions and deletions as evolutionary events, rather than ignoring them as missing data (which is what the most widely used phylogenetic inference programs all do).
LAPD (Linkage Analysis Using Pedigree Data) allows to estimate maximum likelihood allele and two-locus haplotype frequencies, using an Expectation-Maximization algorithm, taking into account family relationships of the individuals.
SILP2 is a stand-alone scaffolding tool that generates maximum likelihood scaffolds via integer linear programming (ILP). SILP2 achieves high scalability without sacrificing optimality by solving the large ILP formulations required to scaffold mammalian-size genomes via a non-serial dynamic programming (NSDP) approach based on decomposing the scaffolding graph into 3-connected components.
::DEVELOPER
Bioinformatics Lab , Computer Science & Engineering Dept. University of Connecticut
SSA is a program for inferring maximum likelihood phylogenies from DNA sequences. Two versions of the program are available: one which assumes a molecular clock and one which does not make this assumption. The method for searching the space of trees for the ML tree is based on a simulated-annealing type algorithm and is described in the reference above. The program implements Felsenstein’s F84 model of nucleotide substitution and associated sub-models. The program estimates the ML tree and branch lengths, and can optionally estimate the transversion/transversion ratio. Upon termination, the program returns the k trees of highest likelihood found during the search, where k can be set by the user.
RAxML (Randomized Axelerated Maximum Likelihood) is a program for sequential and parallel Maximum Likelihood based inference of large phylogenetic trees. It has originally been derived from fastDNAml which in turn was derived from Joe Felsentein’s dnaml which is part of the PHYLIP package.
RAxML-NG is a phylogenetic tree inference tool which uses maximum-likelihood (ML) optimality criterion. Its search heuristic is based on iteratively performing a series of Subtree Pruning and Regrafting (SPR) moves, which allows to quickly navigate to the best-known ML tree. RAxML-NG is a successor of RAxML (Stamatakis 2014) and leverages the highly optimized likelihood computation implemented in libpll (Flouri et al. 2014).
TREE-PUZZLE is a computer program to reconstruct phylogenetic trees from molecular sequence data by maximum likelihood. It implements a fast tree search algorithm, quartet puzzling, that allows analysis of large data sets and automatically assigns estimations of support to each internal branch. TREEPUZZLE also computes pairwise maximum likelihood distances as well as branch lengths for user specified trees. Branch lengths can be calculated with and without the molecular-clock assumption. In addition, TREE-PUZZLE o ers likelihood mapping, a method to investigate the support of a hypothesized internal branch without computing an overall tree and to visualize the phylogenetic content of a sequence alignment. TREE-PUZZLE also conducts a number of statistical tests on the data set (chi-square test for homogeneity of base composition, likelihood ratio to test the clock hypothesis, one and two-sided Kishino-Hasegawa test, Shimodaira-Hasegawa test, Expected Likelihood Weights). The models of substitution provided by TREE-PUZZLE are GTR, TN, HKY, F84, SH for nucleotides, Dayhoff, JTT, mtREV24, BLOSUM 62, VT, WAG for amino acids, and F81 for two-state data. Rate heterogeneity is modeled by a discrete Gamma distribution and by allowing invariable sites. The corresponding parameters (except for GTR) can be inferred from the data set.