Glossary in Phylogeny Construction

N


Nearest Neighbor Interchange (NNI)

This is a heuristic algorithm for searching through tree space.  It proceeds by juxtaposing the positions of neighbors on a phylogenetic tree.  If the resulting tree is better, then it is retained.  This algorithm is quite a gentle perturbation of the tree and is inferior to either SPR or TBR in terms of completeness of the search.  On average it will be quicker than SPR or TBR.

Neighbor Joining (NJ)

This is an algorithm for inferring a branching tree diagram from a distance matrix. It works by successively clustering pairs of taxa together.  It is related to the UPGMA method of inferring a branching diagram from a distance matrix.  Unlike the UPGMA method, NJ can facilitate contemporary tips of uneven length.  This makes it a more appropriate tree reconstruction method than UPGMA in those instances when evolution has not proceeded in a strictly clock-like fashion.

Newick format

This is a method of representing trees using nested parentheses. Two sister taxa are enclosed in a pair of parentheses, separated by a comma.  If the closest relative of these two taxa is another single taxon, then all three taxa will be enclosed within another pair of parentheses.  In this way, a complete tree description may be built.  This format is also called the New Hampshirt format.  Apparently it is named after a restaurant in New Hampshire, USA.

Nonsynonymous substitution

A nucleotide substitution that results in an amino acid replacement.

Choose the first letter of your term

A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z


Send comments and suggestions about PTC to khuri@cs.sjsu.edu or cherryyang@yahoo.com