Tree Calculation

X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=help%2Fhtml%2Fcalculations%2Ftree.html;h=7a8271e6bbb08b561c763a374e544e9300ae642a;hb=c17661b22323a66090ea91e04751aa17461b17c5;hp=6a31403ce6e4674293a52413db463eced16478b3;hpb=a5b213c59c8b5ae9003aca24beb406a9c0aed1ec;p=jalview.git diff --git a/help/html/calculations/tree.html b/help/html/calculations/tree.html index 6a31403..7a8271e 100755 --- a/help/html/calculations/tree.html +++ b/help/html/calculations/tree.html @@ -19,22 +19,27 @@ * along with Jalview. If not, see . * The Jalview Authors are detailed in the 'AUTHORS' file. --> -Tree Calculation + +Tree Calculation + -

Calculation of trees from alignments

Trees are calculated on either the complete alignment, or just the -currently selected group of sequences, using the functions in the -Calculate→Calculate tree submenu. -Once calculated, trees are displayed in a new tree viewing window. There are -four different calculations, using one of two distance measures and -constructing the tree from one of two algorithms : -

Distance Measures

Trees are calculated on the basis of a measure of similarity -between each pair of sequences in the alignment : - - +

+ Calculation of trees from alignments +

+ Trees are calculated on either the complete alignment, or just the + currently selected group of sequences, using the functions in the Calculate→Calculate + tree submenu. Once calculated, trees are displayed in a new tree viewing window. There are four different calculations, using + one of two distance measures and constructing the tree from one of + two algorithms : +

+ Distance Measures +

Trees are calculated on the basis of a measure of similarity + between each pair of sequences in the alignment :

PID
The percentage identity between the two sequences at each aligned position. @@ -46,13 +51,15 @@ between each pair of sequences in the alignment : residues)'.

BLOSUM62, PAM250, DNA
These - options use one of the available substitution matrices to compute - a sum of scores for the residue pairs at each aligned position. -

For details about each model, see the - list of built-in score matrices. +
BLOSUM62, PAM250, DNA
These options + use one of the available substitution matrices to compute a sum of + scores for the residue pairs at each aligned position. +
- For details about each model, see the list of built-in score matrices.

Sequence Feature Similarity
Trees are constructed from a distance matrix formed from Jaccard distances between sequence features observed at each column of the @@ -73,43 +80,49 @@ between each pair of sequences in the alignment : same type will be grouped together in trees computed with this metric. This measure was introduced in Jalview 2.9

Tree Construction Methods

Jalview currently supports two kinds of agglomerative clustering -methods. These are not intended to substitute for rigorous -phylogenetic tree construction, and may fail on very large alignments. -

UPGMA tree
- UPGMA stands for Unweighted Pair-Group Method using Arithmetic - averages. Clusters are iteratively formed and extended by finding a - non-member sequence with the lowest average dissimilarity over the - cluster members. -
-
Neighbour Joining tree
- First described in 1987 by Saitou and Nei, this method applies a - greedy algorithm to find the tree with the shortest branch - lengths.
- This method, as implemented in Jalview, is considerably more - expensive than UPGMA. -

A newly calculated tree will be displayed in a new tree viewing window. In -addition, a new entry with the same tree viewer window name will be added in the Sort -menu so that the alignment can be reordered to reflect the ordering of -the leafs of the tree. If the tree was calculated on a selected region -of the alignment, then the title of the tree view will reflect this.

+ Tree Construction Methods +

Jalview currently supports two kinds of agglomerative + clustering methods. These are not intended to substitute for + rigorous phylogenetic tree construction, and may fail on very large + alignments. +

UPGMA tree
UPGMA stands for + Unweighted Pair-Group Method using Arithmetic averages. Clusters + are iteratively formed and extended by finding a non-member + sequence with the lowest average dissimilarity over the cluster + members. +
Neighbour Joining tree
First + described in 1987 by Saitou and Nei, this method applies a greedy + algorithm to find the tree with the shortest branch lengths.
+ This method, as implemented in Jalview, is considerably more + expensive than UPGMA.

+ A newly calculated tree will be displayed in a new tree viewing window. In addition, a new entry with the same tree + viewer window name will be added in the Sort menu so that the + alignment can be reordered to reflect the ordering of the leafs of + the tree. If the tree was calculated on a selected region of the + alignment, then the title of the tree view will reflect this. +

External Sources for Phylogenetic Trees

A number of programs exist for the reliable construction of - phylogenetic trees, which can cope with large numbers of sequences, - use better distance methods and can perform bootstrapping. Jalview - can read Newick - format tree files using the 'Load Associated Tree' entry of the - alignment's File menu. Sequences in the alignment will be - automatically associated to nodes in the tree, by matching Sequence - IDs to the tree's leaf names. +

+ External Sources for Phylogenetic Trees +

+ A number of programs exist for the reliable construction of + phylogenetic trees, which can cope with large numbers of sequences, + use better distance methods and can perform bootstrapping. Jalview + can read Newick format tree files using the 'Load Associated Tree' entry + of the alignment's File menu. Sequences in the alignment will be + automatically associated to nodes in the tree, by matching Sequence + IDs to the tree's leaf names.