## Overview#

HyPhy (**Hy**pothesis Testing using **Phy**logenies) is an open-source software package for the analysis of genetic sequences (in particular the inference of natural selection) using techniques in phylogenetics, molecular evolution, and machine learning. It features a rich scripting language for limitless customization of analyses. Additionally, HyPhy features support for parallel computing environments (via message passing interface). HyPhy has over 10,000 registered users and has been cited in over 4,500 peer-reviewed publications (Google Scholar).

## Brief history#

HyPhy grew out of the collaboration between Spencer Muse and Sergei Kosakovsky Pond that commenced in 1997 and continues to this day, with many additional collaborators, including Art Poon, Simon Frost, Steven Weaver, Stephanie Spielman, Lance Hepler, Martin Smith, Konrad Scheffler, Wayne Delport, Ben Murrell, and Joel Wertheim. HyPhy was originally released in 2000, and is currently at version 2.5.

## Design philosophy#

HyPhy was designed to allow the specification and fitting of a broad class of continuous-time discrete-space Markov models of sequence evolution. To implement these models, HyPhy provides its own scripting language - **HBL**, or **HyPhy Batch Language** (see an example), which can be used to develop custom analyses or modify existing ones. Importantly, it is not necessary to learn (or even be aware of) HBL in order to use HyPhy, as most common models and analyses have been implemented for user convenience. Once a model is defined, it can be fitted to data (using a fixed topology tree), its parameters can be constrained in user-defined ways to test various hypotheses (e.g. is rate1 > rate2), and simulate data from. HyPhy primarily implements **maximum likelihood** methods, but it can also be used to perform some forms of Bayesian inference (e.g. FUBAR), fit Bayesian graphical models to data, run genetic algorithms to perform complex model selection.

## Features#

- Support for arbitrary sequence data, including nucleotide, amino-acid, codon, binary, count (microsattelite) data, including multiple partitions mixing differen data types.
- Complex models of rate variation, including site-to-site, branch-to-branch, hidden markov model (autocorrelated rates), between/within partitions, and co-varion type models.
- Fast numerical fitting routines, supporting parallel and distributed execution.
- A broad collection of pre-defined evolutionary models.
- The ability to specify flexible constraints on model parameters and estimate confidence intervals on MLEs.
- Ancestral sequence reconstruction and sampling.
- Simulate data from any model that can be defined and fitted in the language.
- Apply unique (for this domain) machine learning methods to discover patterns in the data, e.g. genetic algorithms, stochastic context free grammars, Bayesian graphical models.
- Script analyses completely in HBL including flow control, I/O, parallelization, etc.
- Modern web-applications for running and visualizing results (datamonkey) or for interactive result visualization of HyPhy analyses run locally (hyphy-vision).

## Example HBL Script#

```
/*
This is an example HYPHY Batch File.
It reads in a MEGA format nucleotide dataset from data/hiv.nuc.
and fits the F81 model using the tree inclded in the file using maximum likelihood.
Output is printed out as a Newick Style tree with branch lengths
representing the number of expected substitutions per branch.
*/
// 1. Read in the data and store the result in a DataSet variable
DataSet nucleotideSequences = ReadDataFile ("data/hiv.nuc");
// 2. Filter the data, specifying that all of the data is to be used
// and that it is to be treated as nucleotides.*/
DataSetFilter filteredData = CreateFilter (nucleotideSequences,1);
// Collect observed nucleotide frequencies from the filtered data. observedFreqs will
// store receieve the vector of frequencies.
HarvestFrequencies (observedFreqs, filteredData, 1, 1, 1);
// Define the F81 substitution matrix. '*' is defined to be -(sum of off-diag row
// elements); mu is the rate*time parameter
F81RateMatrix =
{{*,mu,mu,mu}
{mu,*,mu,mu}
{mu,mu,*,mu}
{mu,mu,mu,*}};
// Define the F81 models, by combining the substitution matrix with the vector of observed (equilibrium) frequencies.
Model F81 = (F81RateMatrix, observedFreqs);
// Now we can define the tree variable, using the tree string read from the data file,
// and, by default, assigning the last defined model (F81) to all tree branches.
Tree givenTree = DATAFILE_TREE;
// Since all the likelihood function ingredients (data, tree, equilibrium frequencies)
// have been defined we are ready to construct the likelihood function.
LikelihoodFunction LF = (filteredData, givenTree);
// Maximize the likelihood function, storing parameter values in the matrix paramValues
Optimize (paramValues, LF);
// Print the tree with optimal branch lengths to the console.
fprintf (stdout, LF);
```