X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fschemes%2FResidueProperties.java;h=9acfc24d7734a4b36d02d689188259508b05e7b4;hb=865a855a4ca87eadb3e5ff284ed32ed307d9c34b;hp=0ae32016f27f85852eab566cd9ebb942e21f0fb4;hpb=36a6342e184bde82c23c9502f88dcc50c7efecbf;p=jalview.git
diff --git a/src/jalview/schemes/ResidueProperties.java b/src/jalview/schemes/ResidueProperties.java
index 0ae3201..9acfc24 100755
--- a/src/jalview/schemes/ResidueProperties.java
+++ b/src/jalview/schemes/ResidueProperties.java
@@ -1,35 +1,43 @@
/*
- * Jalview - A Sequence Alignment Editor and Viewer
- * Copyright (C) 2007 AM Waterhouse, J Procter, G Barton, M Clamp, S Searle
- *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
+ * Jalview - A Sequence Alignment Editor and Viewer (Version 2.8.0b1)
+ * Copyright (C) 2014 The Jalview Authors
+ *
+ * This file is part of Jalview.
+ *
+ * Jalview is free software: you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
+ *
+ * Jalview is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty
+ * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+ * PURPOSE. See the GNU General Public License for more details.
+ *
+ * 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.
*/
package jalview.schemes;
import java.util.*;
+import java.util.List;
import java.awt.*;
public class ResidueProperties
{
public static Hashtable scoreMatrices = new Hashtable();
- //Stores residue codes/names and colours and other things
+
+ // Stores residue codes/names and colours and other things
public static final int[] aaIndex; // aaHash version 2.1.1 and below
+
public static final int[] nucleotideIndex;
+
+ public static final int[] purinepyrimidineIndex;
+
public static final Hashtable aa3Hash = new Hashtable();
+
public static final Hashtable aa2Triplet = new Hashtable();
+
public static final Hashtable nucleotideName = new Hashtable();
static
@@ -87,15 +95,26 @@ public class ResidueProperties
aaIndex['b'] = 20;
aaIndex['z'] = 21;
aaIndex['x'] = 22;
- aaIndex['u'] = 22; // TODO: selenocystine triplet and codons needed. also extend subt. matrices
+ aaIndex['u'] = 22; // TODO: selenocystine triplet and codons needed. also
+ // extend subt. matrices
}
+ /**
+ * maximum (gap) index for matrices involving protein alphabet
+ */
+ public final static int maxProteinIndex = 23;
+
+ /**
+ * maximum (gap) index for matrices involving nucleotide alphabet
+ */
+ public final static int maxNucleotideIndex = 10;
+
static
{
nucleotideIndex = new int[255];
for (int i = 0; i < 255; i++)
{
- nucleotideIndex[i] = -1;
+ nucleotideIndex[i] = 10; // non-nucleotide symbols are all non-gap gaps.
}
nucleotideIndex['A'] = 0;
@@ -139,6 +158,54 @@ public class ResidueProperties
nucleotideName.put("y", "Unknown Pyrimidine");
nucleotideName.put("N", "Unknown");
nucleotideName.put("n", "Unknown");
+ nucleotideName.put("W", "Weak nucleotide (A or T)");
+ nucleotideName.put("w", "Weak nucleotide (A or T)");
+ nucleotideName.put("S", "Strong nucleotide (G or C)");
+ nucleotideName.put("s", "Strong nucleotide (G or C)");
+ nucleotideName.put("M", "Amino (A or C)");
+ nucleotideName.put("m", "Amino (A or C)");
+ nucleotideName.put("K", "Keto (G or T)");
+ nucleotideName.put("k", "Keto (G or T)");
+ nucleotideName.put("B", "Not A (G or C or T)");
+ nucleotideName.put("b", "Not A (G or C or T)");
+ nucleotideName.put("H", "Not G (A or C or T)");
+ nucleotideName.put("h", "Not G (A or C or T)");
+ nucleotideName.put("D", "Not C (A or G or T)");
+ nucleotideName.put("d", "Not C (A or G or T)");
+ nucleotideName.put("V", "Not T (A or G or C");
+ nucleotideName.put("v", "Not T (A or G or C");
+
+ }
+
+ static
+ {
+ purinepyrimidineIndex = new int[255];
+ for (int i = 0; i < 255; i++)
+ {
+ purinepyrimidineIndex[i] = 3; // non-nucleotide symbols are all non-gap
+ // gaps.
+ }
+
+ purinepyrimidineIndex['A'] = 0;
+ purinepyrimidineIndex['a'] = 0;
+ purinepyrimidineIndex['C'] = 1;
+ purinepyrimidineIndex['c'] = 1;
+ purinepyrimidineIndex['G'] = 0;
+ purinepyrimidineIndex['g'] = 0;
+ purinepyrimidineIndex['T'] = 1;
+ purinepyrimidineIndex['t'] = 1;
+ purinepyrimidineIndex['U'] = 1;
+ purinepyrimidineIndex['u'] = 1;
+ purinepyrimidineIndex['I'] = 2;
+ purinepyrimidineIndex['i'] = 2;
+ purinepyrimidineIndex['X'] = 2;
+ purinepyrimidineIndex['x'] = 2;
+ purinepyrimidineIndex['R'] = 0;
+ purinepyrimidineIndex['r'] = 0;
+ purinepyrimidineIndex['Y'] = 1;
+ purinepyrimidineIndex['y'] = 1;
+ purinepyrimidineIndex['N'] = 2;
+ purinepyrimidineIndex['n'] = 2;
}
static
@@ -146,9 +213,9 @@ public class ResidueProperties
aa3Hash.put("ALA", new Integer(0));
aa3Hash.put("ARG", new Integer(1));
aa3Hash.put("ASN", new Integer(2));
- aa3Hash.put("ASP", new Integer(3)); //D
+ aa3Hash.put("ASP", new Integer(3)); // D
aa3Hash.put("CYS", new Integer(4));
- aa3Hash.put("GLN", new Integer(5)); //Q
+ aa3Hash.put("GLN", new Integer(5)); // Q
aa3Hash.put("GLU", new Integer(6)); // E
aa3Hash.put("GLY", new Integer(7));
aa3Hash.put("HIS", new Integer(8));
@@ -219,11 +286,11 @@ public class ResidueProperties
}
public static final String[] aa =
- {
- "A", "R", "N", "D", "C", "Q", "E", "G", "H", "I", "L", "K", "M", "F",
- "P", "S", "T", "W", "Y", "V", "B", "Z", "X", "_", "*", ".", " "
- };
+ { "A", "R", "N", "D", "C", "Q", "E", "G", "H", "I", "L", "K", "M", "F",
+ "P", "S", "T", "W", "Y", "V", "B", "Z", "X", "_", "*", ".", " " };
+
public static final Color midBlue = new Color(100, 100, 255);
+
public static final Vector scaleColours = new Vector();
static
@@ -241,27 +308,26 @@ public class ResidueProperties
}
public static final Color[] taylor =
- {
- new Color(204, 255, 0), // A Greenish-yellowy-yellow
- new Color(0, 0, 255), // R Blueish-bluey-blue
- new Color(204, 0, 255), // N Blueish-reddy-blue
- new Color(255, 0, 0), // D Reddish-reddy-red
- new Color(255, 255, 0), // C Yellowish-yellowy-yellow
- new Color(255, 0, 204), // Q Reddish-bluey-red
- new Color(255, 0, 102), // E Blueish-reddy-red
- new Color(255, 153, 0), // G Yellowy-reddy-yellow
- new Color(0, 102, 255), // H Greenish-bluey-blue
- new Color(102, 255, 0), // I Greenish-yellowy-green
- new Color(51, 255, 0), // L Yellowish-greeny-green
- new Color(102, 0, 255), // K Reddish-bluey-blue
- new Color(0, 255, 0), // M Greenish-greeny-green
- new Color(0, 255, 102), // F Blueish-greeny-green
- new Color(255, 204, 0), // P Reddish-yellowy-yellow
- new Color(255, 51, 0), // S Yellowish-reddy-red
- new Color(255, 102, 0), // T Reddish-yellowy-red
- new Color(0, 204, 255), // W Blueish-greeny-green
- new Color(0, 255, 204), // Y Greenish-bluey-green
- new Color(153, 255, 0), // V Yellowish-greeny-yellow
+ { new Color(204, 255, 0), // A Greenish-yellowy-yellow
+ new Color(0, 0, 255), // R Blueish-bluey-blue
+ new Color(204, 0, 255), // N Blueish-reddy-blue
+ new Color(255, 0, 0), // D Reddish-reddy-red
+ new Color(255, 255, 0), // C Yellowish-yellowy-yellow
+ new Color(255, 0, 204), // Q Reddish-bluey-red
+ new Color(255, 0, 102), // E Blueish-reddy-red
+ new Color(255, 153, 0), // G Yellowy-reddy-yellow
+ new Color(0, 102, 255), // H Greenish-bluey-blue
+ new Color(102, 255, 0), // I Greenish-yellowy-green
+ new Color(51, 255, 0), // L Yellowish-greeny-green
+ new Color(102, 0, 255), // K Reddish-bluey-blue
+ new Color(0, 255, 0), // M Greenish-greeny-green
+ new Color(0, 255, 102), // F Blueish-greeny-green
+ new Color(255, 204, 0), // P Reddish-yellowy-yellow
+ new Color(255, 51, 0), // S Yellowish-reddy-red
+ new Color(255, 102, 0), // T Reddish-yellowy-red
+ new Color(0, 204, 255), // W Blueish-greeny-green
+ new Color(0, 255, 204), // Y Greenish-bluey-green
+ new Color(153, 255, 0), // V Yellowish-greeny-yellow
Color.white, // B
Color.white, // Z
Color.white, // X
@@ -269,17 +335,32 @@ public class ResidueProperties
Color.white, // *
Color.white // .
};
+
public static final Color[] nucleotide =
- {
- new Color(100, 247, 63), // A
+ { new Color(100, 247, 63), // A
new Color(255, 179, 64), // C
new Color(235, 65, 60), // G
new Color(60, 136, 238), // T
- new Color(60, 136, 238) // U
+ new Color(60, 136, 238), // U
+ Color.white, // I (inosine)
+ Color.white, // X (xanthine)
+ Color.white, // R
+ Color.white, // Y
+ Color.white, // N
+ Color.white, // Gap
};
- public static final Color[] color =
- {
- Color.pink, // A
+
+ // Added for PurinePyrimidineColourScheme
+ public static final Color[] purinepyrimidine =
+ { new Color(255, 131, 250), // A, G, R purines purplish/orchid
+ new Color(64, 224, 208), // C,U, T, Y pyrimidines turquoise
+ Color.white, // all other nucleotides
+ Color.white // Gap
+ };
+
+ // Zappo
+ public static final Color[] zappo =
+ { Color.pink, // A
midBlue, // R
Color.green, // N
Color.red, // D
@@ -287,7 +368,7 @@ public class ResidueProperties
Color.green, // Q
Color.red, // E
Color.magenta, // G
- Color.red, // H
+ midBlue,// Color.red, // H
Color.pink, // I
Color.pink, // L
midBlue, // K
@@ -310,272 +391,181 @@ public class ResidueProperties
// Dunno where I got these numbers from
public static final double[] hyd2 =
- {
- 0.62, //A
- 0.29, //R
- -0.90, //N
- -0.74, //D
- 1.19, //C
- 0.48, //Q
- -0.40, //E
- 1.38, //G
- -1.50, //H
- 1.06, //I
- 0.64, //L
- -0.78, //K
- 0.12, //M
- -0.85, //F
- -2.53, //P
- -0.18, //S
- -0.05, //T
- 1.08, //W
- 0.81, //Y
- 0.0, //V
- 0.26, //B
- 0.0, //Z
- 0.0 //X
+ { 0.62, // A
+ 0.29, // R
+ -0.90, // N
+ -0.74, // D
+ 1.19, // C
+ 0.48, // Q
+ -0.40, // E
+ 1.38, // G
+ -1.50, // H
+ 1.06, // I
+ 0.64, // L
+ -0.78, // K
+ 0.12, // M
+ -0.85, // F
+ -2.53, // P
+ -0.18, // S
+ -0.05, // T
+ 1.08, // W
+ 0.81, // Y
+ 0.0, // V
+ 0.26, // B
+ 0.0, // Z
+ 0.0 // X
};
+
public static final double[] helix =
- {
- 1.42, 0.98, 0.67, 1.01, 0.70, 1.11, 1.51, 0.57, 1.00, 1.08, 1.21, 1.16,
- 1.45, 1.13, 0.57, 0.77, 0.83, 1.08, 0.69, 1.06, 0.84, 1.31, 1.00, 0.0
- };
+ { 1.42, 0.98, 0.67, 1.01, 0.70, 1.11, 1.51, 0.57, 1.00, 1.08, 1.21, 1.16,
+ 1.45, 1.13, 0.57, 0.77, 0.83, 1.08, 0.69, 1.06, 0.84, 1.31, 1.00, 0.0 };
+
public static final double helixmin = 0.57;
+
public static final double helixmax = 1.51;
+
public static final double[] strand =
- {
- 0.83, 0.93, 0.89, 0.54, 1.19, 1.10, 0.37, 0.75, 0.87, 1.60, 1.30, 0.74,
- 1.05, 1.38, 0.55, 0.75, 1.19, 1.37, 1.47, 1.70, 0.72, 0.74, 1.0, 0.0
- };
+ { 0.83, 0.93, 0.89, 0.54, 1.19, 1.10, 0.37, 0.75, 0.87, 1.60, 1.30, 0.74,
+ 1.05, 1.38, 0.55, 0.75, 1.19, 1.37, 1.47, 1.70, 0.72, 0.74, 1.0, 0.0 };
+
public static final double strandmin = 0.37;
+
public static final double strandmax = 1.7;
+
public static final double[] turn =
- {
- 0.66, 0.95, 1.56, 1.46, 1.19, 0.98, 0.74, 1.56, 0.95, 0.47, 0.59, 1.01,
- 0.60, 0.60, 1.52, 1.43, 0.96, 0.96, 1.14, 0.50, 1.51, 0.86, 1.00, 0, 0
- };
+ { 0.66, 0.95, 1.56, 1.46, 1.19, 0.98, 0.74, 1.56, 0.95, 0.47, 0.59, 1.01,
+ 0.60, 0.60, 1.52, 1.43, 0.96, 0.96, 1.14, 0.50, 1.51, 0.86, 1.00, 0,
+ 0 };
+
public static final double turnmin = 0.47;
+
public static final double turnmax = 1.56;
+
public static final double[] buried =
- {
- 1.7, 0.1, 0.4, 0.4, 4.6, 0.3, 0.3, 1.8, 0.8, 3.1, 2.4, 0.05, 1.9, 2.2,
- 0.6, 0.8, 0.7, 1.6, 0.5, 2.9, 0.4, 0.3, 1.358, 0.00
- };
+ { 1.7, 0.1, 0.4, 0.4, 4.6, 0.3, 0.3, 1.8, 0.8, 3.1, 2.4, 0.05, 1.9, 2.2,
+ 0.6, 0.8, 0.7, 1.6, 0.5, 2.9, 0.4, 0.3, 1.358, 0.00 };
+
public static final double buriedmin = 0.05;
+
public static final double buriedmax = 4.6;
// This is hydropathy index
// Kyte, J., and Doolittle, R.F., J. Mol. Biol.
// 1157, 105-132, 1982
public static final double[] hyd =
- {
- 1.8, -4.5, -3.5, -3.5, 2.5, -3.5, -3.5, -0.4, -3.2, 4.5, 3.8, -3.9, 1.9,
- 2.8, -1.6, -0.8, -0.7, -0.9, -1.3, 4.2, -3.5, -3.5, -0.49, 0.0
- };
+ { 1.8, -4.5, -3.5, -3.5, 2.5, -3.5, -3.5, -0.4, -3.2, 4.5, 3.8, -3.9,
+ 1.9, 2.8, -1.6, -0.8, -0.7, -0.9, -1.3, 4.2, -3.5, -3.5, -0.49, 0.0 };
+
public static final double hydmax = 4.5;
+
public static final double hydmin = -3.9;
- //public static final double hydmax = 1.38;
- //public static final double hydmin = -2.53;
+ // public static final double hydmax = 1.38;
+ // public static final double hydmin = -2.53;
private static final int[][] BLOSUM62 =
- {
- {
- 4, -1, -2, -2, 0, -1, -1, 0, -2, -1, -1, -1, -1, -2, -1, 1, 0, -3,
- -2, 0, -2, -1, 0, -4
- },
- {
- -1, 5, 0, -2, -3, 1, 0, -2, 0, -3, -2, 2, -1, -3, -2, -1, -1, -3, -2,
- -3, -1, 0, -1, -4
- },
- {
- -2, 0, 6, 1, -3, 0, 0, 0, 1, -3, -3, 0, -2, -3, -2, 1, 0, -4, -2, -3,
- 3, 0, -1, -4
- },
- {
- -2, -2, 1, 6, -3, 0, 2, -1, -1, -3, -4, -1, -3, -3, -1, 0, -1, -4,
- -3, -3, 4, 1, -1, -4
- },
- {
- 0, 3, -3, -3, 9, -3, -4, -3, -3, -1, -1, -3, -1, -2, -3, -1, -1, -2,
- -2, -1, -3, -3, -2, -4
- },
- {
- -1, 1, 0, 0, -3, 5, 2, -2, 0, -3, -2, 1, 0, -3, -1, 0, -1, -2, -1,
- -2, 0, 3, -1, -4
- },
- {
- -1, 0, 0, 2, -4, 2, 5, -2, 0, -3, -3, 1, -2, -3, -1, 0, -1, -3, -2,
- -2, 1, 4, -1, -4
- },
- {
- 0, -2, 0, -1, -3, -2, -2, 6, -2, -4, -4, -2, -3, -3, -2, 0, -2, -2,
- -3, -3, -1, -2, -1, -4
- },
- {
- -2, 0, 1, -1, -3, 0, 0, -2, 8, -3, -3, -1, -2, -1, -2, -1, -2, -2, 2,
- -3, 0, 0, -1, -4
- },
- {
- -1, -3, -3, -3, -1, -3, -3, -4, -3, 4, 2, -3, 1, 0, -3, -2, -1, -3,
- -1, 3, -3, -3, -1, -4
- },
- {
- -1, -2, -3, -4, -1, -2, -3, -4, -3, 2, 4, -2, 2, 0, -3, -2, -1, -2,
- -1, 1, -4, -3, -1, -4
- },
- {
- -1, 2, 0, -1, -3, 1, 1, -2, -1, -3, -2, 5, -1, -3, -1, 0, -1, -3, -2,
- -2, 0, 1, -1, -4
- },
- {
- -1, -1, -2, -3, -1, 0, -2, -3, -2, 1, 2, -1, 5, 0, -2, -1, -1, -1,
- -1, 1, -3, -1, -1, -4
- },
- {
- -2, -3, -3, -3, -2, -3, -3, -3, -1, 0, 0, -3, 0, 6, -4, -2, -2, 1, 3,
- -1, -3, -3, -1, -4
- },
- {
- -1, -2, -2, -1, -3, -1, -1, -2, -2, -3, -3, -1, -2, -4, 7, -1, -1,
- -4, -3, -2, -2, -1, -2, -4
- },
- {
- 1, -1, 1, 0, -1, 0, 0, 0, -1, -2, -2, 0, -1, -2, -1, 4, 1, -3, -2,
- -2, 0, 0, 0, -4
- },
- {
- 0, -1, 0, -1, -1, -1, -1, -2, -2, -1, -1, -1, -1, -2, -1, 1, 5, -2,
- -2, 0, -1, -1, 0, -4
- },
- {
- -3, -3, -4, -4, -2, -2, -3, -2, -2, -3, -2, -3, -1, 1, -4, -3, -2,
- 11, 2, -3, -4, -3, -2, -4
- },
- {
- -2, -2, -2, -3, -2, -1, -2, -3, 2, -1, -1, -2, -1, 3, -3, -2, -2, 2,
- 7, -1, -3, -2, -1, -4
- },
- {
- 0, -3, -3, -3, -1, -2, -2, -3, -3, 3, 1, -2, 1, -1, -2, -2, 0, -3,
- -1, 4, -3, -2, -1, -4
- },
- {
- -2, -1, 3, 4, -3, 0, 1, -1, 0, -3, -4, 0, -3, -3, -2, 0, -1, -4, -3,
- -3, 4, 1, -1, -4
- },
- {
- -1, 0, 0, 1, -3, 3, 4, -2, 0, -3, -3, 1, -1, -3, -1, 0, -1, -3, -2,
- -2, 1, 4, -1, -4
- },
- {
- 0, -1, -1, -1, -2, -1, -1, -1, -1, -1, -1, -1, -1, -1, -2, 0, 0, -2,
- -1, -1, -1, -1, -1, -4
- },
- {
- -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
- -4, -4, -4, -4, -4, -4, 1
- },
- };
+ {
+ { 4, -1, -2, -2, 0, -1, -1, 0, -2, -1, -1, -1, -1, -2, -1, 1, 0, -3,
+ -2, 0, -2, -1, 0, -4 },
+ { -1, 5, 0, -2, -3, 1, 0, -2, 0, -3, -2, 2, -1, -3, -2, -1, -1, -3,
+ -2, -3, -1, 0, -1, -4 },
+ { -2, 0, 6, 1, -3, 0, 0, 0, 1, -3, -3, 0, -2, -3, -2, 1, 0, -4, -2,
+ -3, 3, 0, -1, -4 },
+ { -2, -2, 1, 6, -3, 0, 2, -1, -1, -3, -4, -1, -3, -3, -1, 0, -1, -4,
+ -3, -3, 4, 1, -1, -4 },
+ { 0, 3, -3, -3, 9, -3, -4, -3, -3, -1, -1, -3, -1, -2, -3, -1, -1,
+ -2, -2, -1, -3, -3, -2, -4 },
+ { -1, 1, 0, 0, -3, 5, 2, -2, 0, -3, -2, 1, 0, -3, -1, 0, -1, -2, -1,
+ -2, 0, 3, -1, -4 },
+ { -1, 0, 0, 2, -4, 2, 5, -2, 0, -3, -3, 1, -2, -3, -1, 0, -1, -3, -2,
+ -2, 1, 4, -1, -4 },
+ { 0, -2, 0, -1, -3, -2, -2, 6, -2, -4, -4, -2, -3, -3, -2, 0, -2, -2,
+ -3, -3, -1, -2, -1, -4 },
+ { -2, 0, 1, -1, -3, 0, 0, -2, 8, -3, -3, -1, -2, -1, -2, -1, -2, -2,
+ 2, -3, 0, 0, -1, -4 },
+ { -1, -3, -3, -3, -1, -3, -3, -4, -3, 4, 2, -3, 1, 0, -3, -2, -1, -3,
+ -1, 3, -3, -3, -1, -4 },
+ { -1, -2, -3, -4, -1, -2, -3, -4, -3, 2, 4, -2, 2, 0, -3, -2, -1, -2,
+ -1, 1, -4, -3, -1, -4 },
+ { -1, 2, 0, -1, -3, 1, 1, -2, -1, -3, -2, 5, -1, -3, -1, 0, -1, -3,
+ -2, -2, 0, 1, -1, -4 },
+ { -1, -1, -2, -3, -1, 0, -2, -3, -2, 1, 2, -1, 5, 0, -2, -1, -1, -1,
+ -1, 1, -3, -1, -1, -4 },
+ { -2, -3, -3, -3, -2, -3, -3, -3, -1, 0, 0, -3, 0, 6, -4, -2, -2, 1,
+ 3, -1, -3, -3, -1, -4 },
+ { -1, -2, -2, -1, -3, -1, -1, -2, -2, -3, -3, -1, -2, -4, 7, -1, -1,
+ -4, -3, -2, -2, -1, -2, -4 },
+ { 1, -1, 1, 0, -1, 0, 0, 0, -1, -2, -2, 0, -1, -2, -1, 4, 1, -3, -2,
+ -2, 0, 0, 0, -4 },
+ { 0, -1, 0, -1, -1, -1, -1, -2, -2, -1, -1, -1, -1, -2, -1, 1, 5, -2,
+ -2, 0, -1, -1, 0, -4 },
+ { -3, -3, -4, -4, -2, -2, -3, -2, -2, -3, -2, -3, -1, 1, -4, -3, -2,
+ 11, 2, -3, -4, -3, -2, -4 },
+ { -2, -2, -2, -3, -2, -1, -2, -3, 2, -1, -1, -2, -1, 3, -3, -2, -2,
+ 2, 7, -1, -3, -2, -1, -4 },
+ { 0, -3, -3, -3, -1, -2, -2, -3, -3, 3, 1, -2, 1, -1, -2, -2, 0, -3,
+ -1, 4, -3, -2, -1, -4 },
+ { -2, -1, 3, 4, -3, 0, 1, -1, 0, -3, -4, 0, -3, -3, -2, 0, -1, -4,
+ -3, -3, 4, 1, -1, -4 },
+ { -1, 0, 0, 1, -3, 3, 4, -2, 0, -3, -3, 1, -1, -3, -1, 0, -1, -3, -2,
+ -2, 1, 4, -1, -4 },
+ { 0, -1, -1, -1, -2, -1, -1, -1, -1, -1, -1, -1, -1, -1, -2, 0, 0,
+ -2, -1, -1, -1, -1, -1, -4 },
+ { -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
+ -4, -4, -4, -4, -4, -4, 1 }, };
+
static final int[][] PAM250 =
- {
- {
- 2, -2, 0, 0, -2, 0, 0, 1, -1, -1, -2, -1, -1, -3, 1, 1, 1, -6, -3, 0,
- 0, 0, 0, -8
- },
- {
- -2, 6, 0, -1, -4, 1, -1, -3, 2, -2, -3, 3, 0, -4, 0, 0, -1, 2, -4,
- -2, -1, 0, -1, -8
- },
- {
- 0, 0, 2, 2, -4, 1, 1, 0, 2, -2, -3, 1, -2, -3, 0, 1, 0, -4, -2, -2,
- 2, 1, 0, -8
- },
- {
- 0, -1, 2, 4, -5, 2, 3, 1, 1, -2, -4, 0, -3, -6, -1, 0, 0, -7, -4, -2,
- 3, 3, -1, -8
- },
- {
- -2, -4, -4, -5, 12, -5, -5, -3, -3, -2, -6, -5, -5, -4, -3, 0, -2,
- -8, 0, -2, -4, -5, -3, -8
- },
- {
- 0, 1, 1, 2, -5, 4, 2, -1, 3, -2, -2, 1, -1, -5, 0, -1, -1, -5, -4,
- -2, 1, 3, -1, -8
- },
- {
- 0, -1, 1, 3, -5, 2, 4, 0, 1, -2, -3, 0, -2, -5, -1, 0, 0, -7, -4, -2,
- 3, 3, -1, -8
- },
- {
- 1, -3, 0, 1, -3, -1, 0, 5, -2, -3, -4, -2, -3, -5, 0, 1, 0, -7, -5,
- -1, 0, 0, -1, -8
- },
- {
- -1, 2, 2, 1, -3, 3, 1, -2, 6, -2, -2, 0, -2, -2, 0, -1, -1, -3, 0,
- -2, 1, 2, -1, -8
- },
- {
- -1, -2, -2, -2, -2, -2, -2, -3, -2, 5, 2, -2, 2, 1, -2, -1, 0, -5,
- -1, 4, -2, -2, -1, -8
- },
- {
- -2, -3, -3, -4, -6, -2, -3, -4, -2, 2, 6, -3, 4, 2, -3, -3, -2, -2,
- -1, 2, -3, -3, -1, -8
- },
- {
- -1, 3, 1, 0, -5, 1, 0, -2, 0, -2, -3, 5, 0, -5, -1, 0, 0, -3, -4, -2,
- 1, 0, -1, -8
- },
- {
- -1, 0, -2, -3, -5, -1, -2, -3, -2, 2, 4, 0, 6, 0, -2, -2, -1, -4, -2,
- 2, -2, -2, -1, -8
- },
- {
- -3, -4, -3, -6, -4, -5, -5, -5, -2, 1, 2, -5, 0, 9, -5, -3, -3, 0, 7,
- -1, -4, -5, -2, -8
- },
- {
- 1, 0, 0, -1, -3, 0, -1, 0, 0, -2, -3, -1, -2, -5, 6, 1, 0, -6, -5,
- -1, -1, 0, -1, -8
- },
- {
- 1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -3, 0, -2, -3, 1, 2, 1, -2, -3, -1,
- 0, 0, 0, -8
- },
- {
- 1, -1, 0, 0, -2, -1, 0, 0, -1, 0, -2, 0, -1, -3, 0, 1, 3, -5, -3, 0,
- 0, -1, 0, -8
- },
- {
- -6, 2, -4, -7, -8, -5, -7, -7, -3, -5, -2, -3, -4, 0, -6, -2, -5, 17,
- 0, -6, -5, -6, -4, -8
- },
- {
- -3, -4, -2, -4, 0, -4, -4, -5, 0, -1, -1, -4, -2, 7, -5, -3, -3, 0,
- 10, -2, -3, -4, -2, -8
- },
- {
- 0, -2, -2, -2, -2, -2, -2, -1, -2, 4, 2, -2, 2, -1, -1, -1, 0, -6,
- -2, 4, -2, -2, -1, -8
- },
- {
- 0, -1, 2, 3, -4, 1, 3, 0, 1, -2, -3, 1, -2, -4, -1, 0, 0, -5, -3, -2,
- 3, 2, -1, -8
- },
- {
- 0, 0, 1, 3, -5, 3, 3, 0, 2, -2, -3, 0, -2, -5, 0, 0, -1, -6, -4, -2,
- 2, 3, -1, -8
- },
- {
- 0, -1, 0, -1, -3, -1, -1, -1, -1, -1, -1, -1, -1, -2, -1, 0, 0, -4,
- -2, -1, -1, -1, -1, -8
- },
- {
- -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8,
- -8, -8, -8, -8, -8, -8, 1
- },
- };
- public static final Hashtable ssHash = new Hashtable(); // stores the number value of the aa
+ {
+ { 2, -2, 0, 0, -2, 0, 0, 1, -1, -1, -2, -1, -1, -3, 1, 1, 1, -6, -3,
+ 0, 0, 0, 0, -8 },
+ { -2, 6, 0, -1, -4, 1, -1, -3, 2, -2, -3, 3, 0, -4, 0, 0, -1, 2, -4,
+ -2, -1, 0, -1, -8 },
+ { 0, 0, 2, 2, -4, 1, 1, 0, 2, -2, -3, 1, -2, -3, 0, 1, 0, -4, -2, -2,
+ 2, 1, 0, -8 },
+ { 0, -1, 2, 4, -5, 2, 3, 1, 1, -2, -4, 0, -3, -6, -1, 0, 0, -7, -4,
+ -2, 3, 3, -1, -8 },
+ { -2, -4, -4, -5, 12, -5, -5, -3, -3, -2, -6, -5, -5, -4, -3, 0, -2,
+ -8, 0, -2, -4, -5, -3, -8 },
+ { 0, 1, 1, 2, -5, 4, 2, -1, 3, -2, -2, 1, -1, -5, 0, -1, -1, -5, -4,
+ -2, 1, 3, -1, -8 },
+ { 0, -1, 1, 3, -5, 2, 4, 0, 1, -2, -3, 0, -2, -5, -1, 0, 0, -7, -4,
+ -2, 3, 3, -1, -8 },
+ { 1, -3, 0, 1, -3, -1, 0, 5, -2, -3, -4, -2, -3, -5, 0, 1, 0, -7, -5,
+ -1, 0, 0, -1, -8 },
+ { -1, 2, 2, 1, -3, 3, 1, -2, 6, -2, -2, 0, -2, -2, 0, -1, -1, -3, 0,
+ -2, 1, 2, -1, -8 },
+ { -1, -2, -2, -2, -2, -2, -2, -3, -2, 5, 2, -2, 2, 1, -2, -1, 0, -5,
+ -1, 4, -2, -2, -1, -8 },
+ { -2, -3, -3, -4, -6, -2, -3, -4, -2, 2, 6, -3, 4, 2, -3, -3, -2, -2,
+ -1, 2, -3, -3, -1, -8 },
+ { -1, 3, 1, 0, -5, 1, 0, -2, 0, -2, -3, 5, 0, -5, -1, 0, 0, -3, -4,
+ -2, 1, 0, -1, -8 },
+ { -1, 0, -2, -3, -5, -1, -2, -3, -2, 2, 4, 0, 6, 0, -2, -2, -1, -4,
+ -2, 2, -2, -2, -1, -8 },
+ { -3, -4, -3, -6, -4, -5, -5, -5, -2, 1, 2, -5, 0, 9, -5, -3, -3, 0,
+ 7, -1, -4, -5, -2, -8 },
+ { 1, 0, 0, -1, -3, 0, -1, 0, 0, -2, -3, -1, -2, -5, 6, 1, 0, -6, -5,
+ -1, -1, 0, -1, -8 },
+ { 1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -3, 0, -2, -3, 1, 2, 1, -2, -3,
+ -1, 0, 0, 0, -8 },
+ { 1, -1, 0, 0, -2, -1, 0, 0, -1, 0, -2, 0, -1, -3, 0, 1, 3, -5, -3,
+ 0, 0, -1, 0, -8 },
+ { -6, 2, -4, -7, -8, -5, -7, -7, -3, -5, -2, -3, -4, 0, -6, -2, -5,
+ 17, 0, -6, -5, -6, -4, -8 },
+ { -3, -4, -2, -4, 0, -4, -4, -5, 0, -1, -1, -4, -2, 7, -5, -3, -3, 0,
+ 10, -2, -3, -4, -2, -8 },
+ { 0, -2, -2, -2, -2, -2, -2, -1, -2, 4, 2, -2, 2, -1, -1, -1, 0, -6,
+ -2, 4, -2, -2, -1, -8 },
+ { 0, -1, 2, 3, -4, 1, 3, 0, 1, -2, -3, 1, -2, -4, -1, 0, 0, -5, -3,
+ -2, 3, 2, -1, -8 },
+ { 0, 0, 1, 3, -5, 3, 3, 0, 2, -2, -3, 0, -2, -5, 0, 0, -1, -6, -4,
+ -2, 2, 3, -1, -8 },
+ { 0, -1, 0, -1, -3, -1, -1, -1, -1, -1, -1, -1, -1, -2, -1, 0, 0, -4,
+ -2, -1, -1, -1, -1, -8 },
+ { -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8, -8,
+ -8, -8, -8, -8, -8, -8, 1 }, };
+
+ public static final Hashtable ssHash = new Hashtable(); // stores the number
+ // value of the aa
static
{
@@ -590,18 +580,29 @@ public class ResidueProperties
ssHash.put("B", Color.yellow);
}
+ /*
+ * new Color(60, 136, 238), // U Color.white, // I Color.white, // X
+ * Color.white, // R Color.white, // Y Color.white, // N Color.white, // Gap
+ */
+
+ // JBPNote: patch matrix for T/U equivalence when working with DNA or RNA.
+ // Will equate sequences if working with mixed nucleotide sets.
+ // treats T and U identically. R and Y weak equivalence with AG and CTU.
+ // N matches any other base weakly
+ //
static final int[][] DNA =
- {
- {
- 5, -4, -4, -4, 1}, // C
- {
- -4, 5, -4, -4, 1}, // T
- {
- -4, -4, 5, -4, 1}, // A
- {
- -4, -4, -4, 5, 1}, // G
- {
- 1, 1, 1, 1, 1}, // -
+ {
+ { 10, -8, -8, -8, -8, 1, 1, 1, -8, 1, 1 }, // A
+ { -8, 10, -8, -8, -8, 1, 1, -8, 1, 1, 1 }, // C
+ { -8, -8, 10, -8, -8, 1, 1, 1, -8, 1, 1 }, // G
+ { -8, -8, -8, 10, 10, 1, 1, -8, 1, 1, 1 }, // T
+ { -8, -8, -8, 10, 10, 1, 1, -8, 1, 1, 1 }, // U
+ { 1, 1, 1, 1, 1, 10, 0, 0, 0, 1, 1 }, // I
+ { 1, 1, 1, 1, 1, 0, 10, 0, 0, 1, 1 }, // X
+ { 1, -8, 1, -8, -8, 0, 0, 10, -8, 1, 1 }, // R
+ { -8, 1, -8, 1, 1, 0, 0, -8, 10, 1, 1 }, // Y
+ { 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1 }, // N
+ { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 }, // -
};
/**
* register matrices in list
@@ -611,38 +612,59 @@ public class ResidueProperties
scoreMatrices.put("BLOSUM62", new ScoreMatrix("BLOSUM62", BLOSUM62, 0));
scoreMatrices.put("PAM250", new ScoreMatrix("PAM250", PAM250, 0));
scoreMatrices.put("DNA", new ScoreMatrix("DNA", DNA, 1));
+
}
public static final Color[] pidColours =
- {
- midBlue, new Color(153, 153, 255),
- // Color.lightGray,
- new Color(204, 204, 255),
- };
+ { midBlue, new Color(153, 153, 255),
+ // Color.lightGray,
+ new Color(204, 204, 255), };
+
public static final float[] pidThresholds =
- {
- 80, 60, 40, };
+ { 80, 60, 40, };
+
public static Hashtable codonHash = new Hashtable();
+
public static Vector Lys = new Vector();
+
public static Vector Asn = new Vector();
+
public static Vector Gln = new Vector();
+
public static Vector His = new Vector();
+
public static Vector Glu = new Vector();
+
public static Vector Asp = new Vector();
+
public static Vector Tyr = new Vector();
+
public static Vector Thr = new Vector();
+
public static Vector Pro = new Vector();
+
public static Vector Ala = new Vector();
+
public static Vector Ser = new Vector();
+
public static Vector Arg = new Vector();
+
public static Vector Gly = new Vector();
+
public static Vector Trp = new Vector();
+
public static Vector Cys = new Vector();
+
public static Vector Ile = new Vector();
+
public static Vector Met = new Vector();
+
public static Vector Leu = new Vector();
+
public static Vector Val = new Vector();
+
public static Vector Phe = new Vector();
+
public static Vector STOP = new Vector();
static
@@ -670,22 +692,135 @@ public class ResidueProperties
codonHash.put("STOP", STOP);
}
- public static Hashtable codonHash2 = new Hashtable();
+ /**
+ * Nucleotide Ambiguity Codes
+ */
+ public static final Hashtable ambiguityCodes=new Hashtable();
+ /**
+ * Codon triplets with additional symbols for unambiguous codons that include ambiguity codes
+ */
+ public static final Hashtable codonHash2 = new Hashtable();
+
+ /**
+ * all ambiguity codes for a given base
+ */
+ public final static Hashtable> _ambiguityCodes = new Hashtable>();
+
static
{
+ /**
+ * 3.2. Purine (adenine or guanine): R
+ *
+ * R is the symbol previously recommended [1].
+ */
+ ambiguityCodes.put("R", new String[]
+ { "A", "G" });
+
+ /**
+ * 3.3. Pyrimidine (thymine or cytosine): Y
+ *
+ * Y is the symbol previously recommended [1].
+ */
+ ambiguityCodes.put("Y", new String[]
+ { "T", "C" });
+ /**
+ * 3.4. Adenine or thymine: W
+ *
+ * Although several diverse symbols have been used for this pair, (and for
+ * the reciprocal pair G+C), only two symbols have a rational basis, L and
+ * W: L derives from DNA density (light; G+C - heavy - would thus be H); W
+ * derives from the strength of the hydrogen bonding interaction between the
+ * base pairs (weak for A+T: G +C - strong - would thus be S). However, the
+ * system recommended for the three-base series (not-A = B, etc., see below,
+ * section 3.8) rules out H as this would be not-G. W is thus recommended.
+ */
+ ambiguityCodes.put("W", new String[]
+ { "A", "T" });
+ /**
+ * 3.5. Guanine or cytosine: S
+ *
+ * The choice of this symbol is discussed above in section 3.4.
+ */
+ ambiguityCodes.put("S", new String[]
+ { "G", "C" });
+ /**
+ * 3.6. Adenine or cytosine: M
+ *
+ * There are few common features between A and C. The presence of an NH2
+ * group in similar positions on both bases (Fig. 1) makes possible a
+ * logically derived symbol. A and N being ruled out, M (from aMino) is
+ * recommended.
+ *
+ *
+ * Fig. 1. Origin of the symbols M and K The four bases are drawn so as to
+ * show the relationship between adenine and cytosine on the one hand, which
+ * both have aMino groups at the ring position most distant from the point
+ * of attachment to the sugar, and between guanine and thymine on the other,
+ * which both have Keto groups at the corresponding position. The ring atoms
+ * are numbered as recommended [24-26], although for the present purpose
+ * this has the disadvantage of giving discordant numbers to the
+ * corresponding positions.
+ */
+ ambiguityCodes.put("M", new String[]
+ { "A", "C" });
+ /**
+ * 3.7. Guanine or thymine: K By analogy with A and C (section 3.6), both G
+ * and T have Keto groups in similar positions (Fig. 1).
+ */
+ ambiguityCodes.put("K", new String[]
+ { "G", "T" });
+ /**
+ * 3.8. Adenine or thymine or cytosine: H
+ *
+ * Not-G is the most simple means of memorising this combination and symbols
+ * logically related to G were examined. F and H would both be suitable, as
+ * the letters before and after G in the alphabet, but A would have no
+ * equivalent to F. The use of H has historical precedence [2].
+ */
+ ambiguityCodes.put("H", new String[]
+ { "A", "T", "C" });
+ /**
+ * 3.9. Guanine or cytosine or thymine: B
+ *
+ * Not-A as above (section 3.8).
+ */
+ ambiguityCodes.put("B", new String[]
+ { "G", "T", "C" });
+ /**
+ * 3.10. Guanine or adenine or cytosine: V
+ *
+ * Not-T by analogy with not-G (section 3.8) would be U but this is ruled
+ * out to eliminate confusion with uracil. V is the next logical choice.
+ * Note that T and U may in some cases be considered to be synonyms.
+ */
+ ambiguityCodes.put("V", new String[]
+ { "G", "A", "C" });
+ /**
+ * 3.11. Guanine or adenine or thymine: D
+ *
+ * Not-C as above (section 3.8).
+ */
+ ambiguityCodes.put("D", new String[]
+ { "G", "A", "T" });
+ /**
+ * 3.12. Guanine or adenine or thymine or cytosine: N
+ */
+ ambiguityCodes.put("R", new String[]
+ { "G", "A", "T", "C" });
+ // Now build codon translation table
codonHash2.put("AAA", "K");
codonHash2.put("AAG", "K");
codonHash2.put("AAC", "N");
codonHash2.put("AAT", "N");
- codonHash2.put("CAA", "E");
- codonHash2.put("CAG", "E");
+ codonHash2.put("CAA", "Q");
+ codonHash2.put("CAG", "Q");
codonHash2.put("CAC", "H");
codonHash2.put("CAT", "H");
- codonHash2.put("GAA", "Q");
- codonHash2.put("GAG", "Q");
+ codonHash2.put("GAA", "E");
+ codonHash2.put("GAG", "E");
codonHash2.put("GAC", "D");
codonHash2.put("GAT", "D");
@@ -693,9 +828,9 @@ public class ResidueProperties
codonHash2.put("TAT", "Y");
codonHash2.put("ACA", "T");
- codonHash2.put("AAG", "T");
codonHash2.put("ACC", "T");
codonHash2.put("ACT", "T");
+ codonHash2.put("ACG", "T");
codonHash2.put("CCA", "P");
codonHash2.put("CCG", "P");
@@ -755,6 +890,145 @@ public class ResidueProperties
codonHash2.put("TTC", "F");
codonHash2.put("TTT", "F");
+
+ buildAmbiguityCodonSet();
+ }
+
+ /**
+ * programmatic generation of codons including ambiguity codes
+ */
+ public static void buildAmbiguityCodonSet()
+ {
+ if (_ambiguityCodes.size() > 0)
+ {
+ System.err
+ .println("Ignoring multiple calls to buildAmbiguityCodonSet");
+ return;
+ }
+ // Invert the ambiguity code set
+ for (Map.Entry acode : ambiguityCodes.entrySet())
+ {
+ for (String r : acode.getValue())
+ {
+ List codesfor = _ambiguityCodes.get(r);
+ if (codesfor == null)
+ {
+ _ambiguityCodes.put(r, codesfor = new ArrayList());
+ }
+ if (!codesfor.contains(acode.getKey()))
+ {
+ codesfor.add(acode.getKey());
+ }
+ else
+ {
+ System.err
+ .println("Inconsistency in the IUBMB ambiguity code nomenclature table: collision for "
+ + acode.getKey() + " in residue " + r);
+ }
+ }
+ }
+ // and programmatically add in the ambiguity codes that yield the same amino
+ // acid
+ String[] unambcodons = codonHash2.keySet().toArray(new String[codonHash2.size()]);
+ for (String codon : unambcodons)
+ {
+ String residue = codonHash2.get(codon);
+ String acodon[][] = new String[codon.length()][];
+ for (int i = 0, iSize = codon.length(); i < iSize; i++)
+ {
+ String _ac = "" + codon.charAt(i);
+ List acodes = _ambiguityCodes.get(_ac);
+ if (acodes != null)
+ {
+ acodon[i] = acodes.toArray(new String[acodes.size()]);
+ }
+ else
+ {
+ acodon[i] = new String[]
+ {};
+ }
+ }
+ // enumerate all combinations and test for veracity of translation
+ int tpos[] = new int[codon.length()], cpos[] = new int[codon.length()];
+ for (int i = 0; i < tpos.length; i++)
+ {
+ tpos[i] = -1;
+ }
+ tpos[acodon.length - 1] = 0;
+ int ipos, j;
+ while (tpos[0] < acodon[0].length)
+ {
+ // make all codons for this combination
+ char allres[][] = new char[tpos.length][];
+ String _acodon = "";
+ char _anuc;
+ for (ipos = 0; ipos < tpos.length; ipos++)
+ {
+ if (acodon[ipos].length==0 || tpos[ipos] < 0)
+ {
+ _acodon += codon.charAt(ipos);
+ allres[ipos] = new char[]
+ { codon.charAt(ipos) };
+ }
+ else
+ {
+ _acodon += acodon[ipos][tpos[ipos]];
+ String[] altbase = ambiguityCodes.get(acodon[ipos][tpos[ipos]]);
+ allres[ipos] = new char[altbase.length];
+ j = 0;
+ for (String ab : altbase)
+ {
+ allres[ipos][j++] = ab.charAt(0);
+ }
+ }
+ }
+ // test all codons for this combination
+ for (ipos = 0; ipos < cpos.length; ipos++)
+ {
+ cpos[ipos] = 0;
+ }
+ boolean valid = true;
+ do
+ {
+ String _codon = "";
+ for (j = 0; j < cpos.length; j++)
+ {
+ _codon += allres[j][cpos[j]];
+ }
+ String tr = codonHash2.get(_codon);
+ if (valid = (tr!=null && tr.equals(residue)))
+ {
+ // advance to next combination
+ ipos = acodon.length - 1;
+ while (++cpos[ipos] >= allres[ipos].length && ipos > 0)
+ {
+ cpos[ipos] = 0;
+ ipos--;
+ }
+ }
+ } while (valid && cpos[0] < allres[0].length);
+ if (valid)
+ {
+ // Add this to the set of codons we will translate
+// System.out.println("Adding ambiguity codon: " + _acodon + " for "
+// + residue);
+ codonHash2.put(_acodon, residue);
+ }
+ else
+ {
+// System.err.println("Rejecting ambiguity codon: " + _acodon
+// + " for " + residue);
+ }
+ // next combination
+ ipos = acodon.length - 1;
+ while (++tpos[ipos] >= acodon[ipos].length && ipos > 0)
+ {
+ tpos[ipos] = -1;
+ ipos--;
+ }
+ }
+ }
+
}
static
@@ -842,17 +1116,27 @@ public class ResidueProperties
Phe.addElement("TTT");
}
- //Stores residue codes/names and colours and other things
+ // Stores residue codes/names and colours and other things
public static Hashtable propHash = new Hashtable();
+
public static Hashtable hydrophobic = new Hashtable();
+
public static Hashtable polar = new Hashtable();
+
public static Hashtable small = new Hashtable();
+
public static Hashtable positive = new Hashtable();
+
public static Hashtable negative = new Hashtable();
+
public static Hashtable charged = new Hashtable();
+
public static Hashtable aromatic = new Hashtable();
+
public static Hashtable aliphatic = new Hashtable();
+
public static Hashtable tiny = new Hashtable();
+
public static Hashtable proline = new Hashtable();
static
@@ -1005,7 +1289,9 @@ public class ResidueProperties
charged.put("E", new Integer(1));
charged.put("Q", new Integer(0));
charged.put("D", new Integer(1));
- charged.put("N", new Integer(1));
+ charged.put("N", new Integer(0)); // Asparagine is polar but not charged.
+ // Alternative would be charged and
+ // negative (in basic form)?
charged.put("S", new Integer(0));
charged.put("T", new Integer(0));
charged.put("P", new Integer(0));
@@ -1167,12 +1453,7 @@ public class ResidueProperties
public static int getPAM250(String A1, String A2)
{
- int a = aaIndex[A1.charAt(0)];
- int b = aaIndex[A2.charAt(0)];
-
- int pog = ResidueProperties.PAM250[a][b];
-
- return pog;
+ return getPAM250(A1.charAt(0), A2.charAt(0));
}
public static int getBLOSUM62(char c1, char c2)
@@ -1185,10 +1466,9 @@ public class ResidueProperties
int b = aaIndex[c2];
pog = ResidueProperties.BLOSUM62[a][b];
- }
- catch (Exception e)
+ } catch (Exception e)
{
- //System.out.println("Unknown residue in " + A1 + " " + A2);
+ // System.out.println("Unknown residue in " + A1 + " " + A2);
}
return pog;
@@ -1204,8 +1484,27 @@ public class ResidueProperties
return null;
}
- public static String codonTranslate(String codon)
+ public static String codonTranslate(String lccodon)
{
+ if (false)
+ {
+ return _codonTranslate(lccodon);
+ }
+ String cdn = codonHash2.get(lccodon.toUpperCase());
+ if (cdn!=null && cdn.equals("*"))
+ {
+ return "STOP";
+ }
+ return cdn;
+ }
+ public static String _codonTranslate(String lccodon)
+ {
+ String codon = lccodon.toUpperCase();
+ // all base ambiguity codes yield an 'X' amino acid residue
+ if (codon.indexOf('X') > -1 || codon.indexOf('N') > -1)
+ {
+ return "X";
+ }
Enumeration e = codonHash.keys();
while (e.hasMoreElements())
@@ -1213,7 +1512,7 @@ public class ResidueProperties
String key = (String) e.nextElement();
Vector tmp = (Vector) codonHash.get(key);
- if (tmp.contains(codon.toUpperCase()))
+ if (tmp.contains(codon))
{
return key;
}
@@ -1234,6 +1533,7 @@ public class ResidueProperties
/**
* get a ScoreMatrix based on its string name
+ *
* @param pwtype
* @return matrix in scoreMatrices with key pwtype or null
*/
@@ -1246,4 +1546,147 @@ public class ResidueProperties
}
return null;
}
+
+ public static int getPAM250(char c, char d)
+ {
+ int a = aaIndex[c];
+ int b = aaIndex[d];
+
+ int pog = ResidueProperties.PAM250[a][b];
+
+ return pog;
+ }
+
+ public static Hashtable toDssp3State;
+ static
+ {
+ toDssp3State = new Hashtable();
+ toDssp3State.put("H", "H");
+ toDssp3State.put("E", "E");
+ toDssp3State.put("C", " ");
+ toDssp3State.put(" ", " ");
+ toDssp3State.put("T", " ");
+ toDssp3State.put("B", "E");
+ toDssp3State.put("G", "H");
+ toDssp3State.put("I", "H");
+ toDssp3State.put("X", " ");
+ }
+
+ /**
+ * translate from other dssp secondary structure alphabets to 3-state
+ *
+ * @param ssstring
+ * @return ssstring as a three-state secondary structure assignment.
+ */
+ public static String getDssp3state(String ssstring)
+ {
+ if (ssstring == null)
+ {
+ return null;
+ }
+ StringBuffer ss = new StringBuffer();
+ for (int i = 0; i < ssstring.length(); i++)
+ {
+ String ssc = ssstring.substring(i, i + 1);
+ if (toDssp3State.containsKey(ssc))
+ {
+ ss.append((String) toDssp3State.get(ssc));
+ }
+ else
+ {
+ ss.append(" ");
+ }
+ }
+ return ss.toString();
+ }
+
+ /**
+ * Used by getRNASecStrucState
+ *
+ */
+ public static Hashtable toRNAssState;
+ static
+ {
+ toRNAssState = new Hashtable();
+ toRNAssState.put(")", "S");
+ toRNAssState.put("(", "S");
+ }
+
+ /**
+ * translate to RNA secondary structure representation
+ *
+ * @param ssstring
+ * @return ssstring as a RNA-state secondary structure assignment.
+ */
+ public static String getRNASecStrucState(String ssstring)
+ {
+ if (ssstring == null)
+ {
+ return null;
+ }
+ StringBuffer ss = new StringBuffer();
+ for (int i = 0; i < ssstring.length(); i++)
+ {
+ String ssc = ssstring.substring(i, i + 1);
+ if (toRNAssState.containsKey(ssc))
+ {
+ ss.append((String) toRNAssState.get(ssc));
+ }
+ else
+ {
+ ss.append(" ");
+ }
+ }
+ return ss.toString();
+ }
+
+ // main method generates perl representation of residue property hash
+ // / cut here
+ public static void main(String[] args)
+ {
+ Hashtable aa = new Hashtable();
+ System.out.println("my %aa = {");
+ // invert property hashes
+ Enumeration prop = propHash.keys();
+ while (prop.hasMoreElements())
+ {
+ String pname = (String) prop.nextElement();
+ Hashtable phash = (Hashtable) propHash.get(pname);
+ Enumeration res = phash.keys();
+ while (res.hasMoreElements())
+ {
+ String rname = (String) res.nextElement();
+ Vector aprops = (Vector) aa.get(rname);
+ if (aprops == null)
+ {
+ aprops = new Vector();
+ aa.put(rname, aprops);
+ }
+ Integer hasprop = (Integer) phash.get(rname);
+ if (hasprop.intValue() == 1)
+ {
+ aprops.addElement(pname);
+ }
+ }
+ }
+ Enumeration res = aa.keys();
+ while (res.hasMoreElements())
+ {
+ String rname = (String) res.nextElement();
+
+ System.out.print("'" + rname + "' => [");
+ Enumeration props = ((Vector) aa.get(rname)).elements();
+ while (props.hasMoreElements())
+ {
+ System.out.print("'" + (String) props.nextElement() + "'");
+ if (props.hasMoreElements())
+ {
+ System.out.println(", ");
+ }
+ }
+ System.out.println("]" + (res.hasMoreElements() ? "," : ""));
+ }
+ System.out.println("};");
+ }
+ // to here
}