X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;ds=sidebyside;f=help%2Fhtml%2Fcalculations%2Ftree.html;h=a01c7bedacea89dede72184aab7232d3202082c6;hb=573376fa9bdc28602b0aa2a1f03cc2ebd6b0df7b;hp=26a24c735fce9b134a90e307d3580f95f670357d;hpb=0696cffbccbb537be78d9fc2410589adbcd7be35;p=jalview.git
diff --git a/help/html/calculations/tree.html b/help/html/calculations/tree.html
index 26a24c7..a01c7be 100755
--- a/help/html/calculations/tree.html
+++ b/help/html/calculations/tree.html
@@ -1,21 +1,24 @@
+ * You should have received a copy of the GNU General Public License
+ * along with Jalview. If not, see .
+ * The Jalview Authors are detailed in the 'AUTHORS' file.
+ -->
Tree Calculation
Calculation of trees from alignments
@@ -30,17 +33,24 @@ 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.- PID = Number of equivalent
-aligned non-gap symbols * 100 / Smallest number of non-gap positions
-in either of both sequences
This is essentially the 'number of
-identical bases (or residues) per 100 base pairs (or residues)'.
- - BLOSUM62
The sum of BLOSUM62 scores for the
-residue pair at each aligned position.
-
-
-Tree Construction Methods
+
+ - PID
The percentage identity between
+ the two sequences at each aligned position.
+
+ - PID = Number of equivalent aligned non-gap symbols * 100 /
+ Smallest number of non-gap positions in either of both sequences
+ This is essentially the 'number of identical bases (or
+ residues) per 100 base pairs (or 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.
+
+
+ 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.