-/* Jalview - a java multiple alignment editor\r
- * Copyright (C) 1998 Michele Clamp\r
- *\r
- * This program is free software; you can redistribute it and/or\r
- * modify it under the terms of the GNU General Public License\r
- * as published by the Free Software Foundation; either version 2\r
- * of the License, or (at your option) any later version.\r
- *\r
- * This program is distributed in the hope that it will be useful,\r
- * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
- * GNU General Public License for more details.\r
- *\r
- * You should have received a copy of the GNU General Public License\r
- * along with this program; if not, write to the Free Software\r
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\r
- */\r
-package jalview.analysis;\r
-\r
-import jalview.schemes.*;\r
-import jalview.datamodel.SequenceI;\r
-import jalview.util.*;\r
-import jalview.io.*;\r
-\r
-import java.util.*;\r
-import java.io.*;\r
-import java.awt.*;\r
-\r
-public class AlignSeq {\r
-\r
- int[][] score;\r
- int[][] E;\r
- int[][] F;\r
- int[][] traceback;\r
-\r
- int[] seq1;\r
- int[] seq2;\r
-\r
- SequenceI s1;\r
- SequenceI s2;\r
-\r
- String s1str;\r
- String s2str;\r
-\r
- int maxi;\r
- int maxj;\r
-\r
- int[] aseq1;\r
- int[] aseq2;\r
-\r
- String astr1 = "";\r
- String astr2 = "";\r
-\r
- int seq1start;\r
- int seq1end;\r
- int seq2start;\r
- int seq2end;\r
-\r
- int count;\r
-\r
- int maxscore;\r
- float pid;\r
- int prev = 0;\r
-\r
- public static java.util.Hashtable dnaHash = new java.util.Hashtable();\r
-\r
- static {\r
- dnaHash.put("C", new Integer(0));\r
- dnaHash.put("T", new Integer(1));\r
- dnaHash.put("A", new Integer(2));\r
- dnaHash.put("G", new Integer(3));\r
- dnaHash.put("-", new Integer(4));\r
- }\r
-\r
- static String dna[] = {"C","T","A","G","-"};\r
- static String pep[] = {"A","R","N","D","C","Q","E","G","H","I","L","K","M","F","P","S","T","W","Y","V","B","Z","X","-"};\r
-\r
- int gapOpen = 120;\r
- int gapExtend = 20;\r
-\r
- int lookup[][] = ResidueProperties.getBLOSUM62();\r
- String intToStr[] = pep;\r
- int defInt = 23;\r
-\r
- String output = "";\r
-\r
- String type;\r
- Runtime rt;\r
- public AlignSeq() {}\r
-\r
- public AlignSeq(SequenceI s1, SequenceI s2,String type) {\r
- rt = Runtime.getRuntime();\r
- SeqInit(s1,s2,type);\r
- }\r
-\r
- public int getMaxScore() {\r
- return maxscore;\r
- }\r
-\r
- public int getSeq2Start() {\r
- return seq2start;\r
- }\r
-\r
- public int getSeq2End() {\r
- return seq2end;\r
- }\r
-\r
- public int getSeq1Start() {\r
- return seq1start;\r
- }\r
-\r
- public int getSeq1End() {\r
- return seq1end;\r
- }\r
-\r
- public String getOutput() {\r
- return output;\r
- }\r
-\r
- public String getAStr1() {\r
- return astr1;\r
- }\r
- public String getAStr2() {\r
- return astr2;\r
- }\r
- public int [] getASeq1() {\r
- return aseq1;\r
- }\r
- public int [] getASeq2() {\r
- return aseq2;\r
- }\r
- public SequenceI getS1() {\r
- return s1;\r
- }\r
- public SequenceI getS2() {\r
- return s2;\r
- }\r
-\r
- public void SeqInit(SequenceI s1, SequenceI s2,String type) {\r
- s1str = extractGaps(".",s1.getSequence());\r
- s2str = extractGaps(".",s2.getSequence());\r
- s1str = extractGaps("-",s1str);\r
- s2str = extractGaps("-",s2str);\r
- s1str = extractGaps(" ",s1str);\r
- s2str = extractGaps(" ",s2str);\r
-\r
- this.s1 = s1;\r
- this.s2 = s2;\r
-\r
- this.type = type;\r
-\r
- if (type.equals("pep")) {\r
- lookup = ResidueProperties.getBLOSUM62();\r
- intToStr = pep;\r
- defInt = 23;\r
- } else if (type.equals("dna")) {\r
- lookup = ResidueProperties.getDNA();\r
- intToStr = dna;\r
- defInt = 4;\r
- } else {\r
- output = output + ("Wrong type = dna or pep only");\r
- System.exit(0);\r
- }\r
-\r
-\r
- //System.out.println("lookuip " + rt.freeMemory() + " "+ rt.totalMemory());\r
- seq1 = new int[s1str.length()];\r
- //System.out.println("seq1 " + rt.freeMemory() +" " + rt.totalMemory());\r
- seq2 = new int[s2str.length()];\r
- //System.out.println("seq2 " + rt.freeMemory() + " " + rt.totalMemory());\r
- score = new int[s1str.length()][s2str.length()];\r
- //System.out.println("score " + rt.freeMemory() + " " + rt.totalMemory());\r
- E = new int[s1str.length()][s2str.length()];\r
- //System.out.println("E " + rt.freeMemory() + " " + rt.totalMemory());\r
- F = new int[s1str.length()][s2str.length()];\r
- traceback = new int[s1str.length()][s2str.length()];\r
- //System.out.println("F " + rt.freeMemory() + " " + rt.totalMemory());\r
- seq1 = stringToInt(s1str,type);\r
- //System.out.println("seq1 " + rt.freeMemory() + " " + rt.totalMemory());\r
- seq2 = stringToInt(s2str,type);\r
- //System.out.println("Seq2 " + rt.freeMemory() + " " + rt.totalMemory());\r
-\r
- // long tstart = System.currentTimeMillis();\r
- // calcScoreMatrix();\r
- //long tend = System.currentTimeMillis();\r
-\r
- //System.out.println("Time take to calculate score matrix = " + (tend-tstart) + " ms");\r
-\r
-\r
- // printScoreMatrix(score);\r
- //System.out.println();\r
-\r
- //printScoreMatrix(traceback);\r
- //System.out.println();\r
-\r
- // printScoreMatrix(E);\r
- //System.out.println();\r
-\r
- ///printScoreMatrix(F);\r
- //System.out.println();\r
- // tstart = System.currentTimeMillis();\r
- //traceAlignment();\r
- //tend = System.currentTimeMillis();\r
- //System.out.println("Time take to traceback alignment = " + (tend-tstart) + " ms");\r
- }\r
-\r
- public void traceAlignment() {\r
-\r
- // Find the maximum score along the rhs or bottom row\r
- int max = -9999;\r
- for (int i = 0; i < seq1.length; i++) {\r
- if (score[i][seq2.length - 1] > max ) {\r
- max = score[i][seq2.length - 1];\r
- maxi = i;\r
- maxj = seq2.length-1;\r
- }\r
- }\r
- for (int j = 0; j < seq2.length; j++) {\r
- if (score[seq1.length - 1][j] > max ) {\r
- max = score[seq1.length - 1][j];\r
- maxi = seq1.length-1;\r
- maxj = j;\r
- }\r
- }\r
-\r
- // System.out.println(maxi + " " + maxj + " " + score[maxi][maxj]);\r
-\r
- int i = maxi;\r
- int j = maxj;\r
- int trace;\r
- maxscore = score[i][j] / 10;\r
-\r
- seq1end = maxi+1;\r
- seq2end = maxj+1;\r
-\r
- aseq1 = new int[seq1.length + seq2.length];\r
- aseq2 = new int[seq1.length + seq2.length];\r
-\r
- count = seq1.length + seq2.length - 1;\r
-\r
- while (i>0 && j >0) {\r
-\r
- if (aseq1[count] != defInt && i >=0) {\r
- aseq1[count] = seq1[i];\r
- astr1 = intToStr[seq1[i]] + astr1;\r
- }\r
-\r
- if (aseq2[count] != defInt && j > 0) {\r
- aseq2[count] = seq2[j];\r
- astr2 = intToStr[seq2[j]] + astr2;\r
- }\r
- trace = findTrace(i,j);\r
- if (trace == 0) {\r
- i--;\r
- j--;\r
-\r
- } else if (trace == 1) {\r
- j--;\r
- aseq1[count] = defInt;\r
- astr1 = "-" + astr1.substring(1);\r
- } else if (trace == -1) {\r
- i--;\r
- aseq2[count] = defInt;\r
- astr2 = "-" + astr2.substring(1);\r
- }\r
- count--;\r
- }\r
-\r
- seq1start = i+1;\r
- seq2start = j+1;\r
-\r
- if (aseq1[count] != defInt) {\r
- aseq1[count] = seq1[i];\r
- astr1 = intToStr[seq1[i]] + astr1;\r
- }\r
-\r
- if (aseq2[count] != defInt) {\r
- aseq2[count] = seq2[j];\r
- astr2 = intToStr[seq2[j]] + astr2;\r
- }\r
- }\r
-\r
- public void printAlignment() {\r
- // Find the biggest id length for formatting purposes\r
- int maxid = s1.getName().length();\r
-\r
- if (s2.getName().length() > maxid) {\r
- maxid = s2.getName().length();\r
- }\r
-\r
- int len = 72 - maxid - 1;\r
- int nochunks = ((aseq1.length - count) / len) + 1;\r
- pid = 0;\r
- int overlap = 0;\r
-\r
- output = output + ("Score = " + score[maxi][maxj] + "\n");\r
- output = output + ("Length of alignment = " + (aseq1.length-count) + "\n");\r
- output = output + ("Sequence ");\r
- output = output + (new Format("%" + maxid + "s").form(s1.getName()));\r
- output = output + (" : " + seq1start + " - " + seq1end + " (Sequence length = " + s1str.length() + ")\n");\r
- output = output + ("Sequence ");\r
- output = output + (new Format("%" + maxid + "s").form(s2.getName()));\r
- output = output + (" : " + seq2start + " - " + seq2end + " (Sequence length = " + s2str.length() + ")\n\n");\r
-\r
- for (int j = 0; j < nochunks; j++) {\r
- // Print the first aligned sequence\r
- output = output + (new Format("%" + (maxid) + "s").form(s1.getName()) + " ");\r
- for (int i = 0; i < len ; i++) {\r
-\r
- if ((count + i + j*len) < aseq1.length) {\r
- output = output + (new Format("%s").form(intToStr[aseq1[count + i + j*len]]));\r
- }\r
- }\r
-\r
- output = output + ("\n");\r
- output = output + (new Format("%" + (maxid) + "s").form(" ") + " ");\r
- // Print out the matching chars\r
- for (int i = 0; i < len ; i++) {\r
-\r
- if ((count + i + j*len) < aseq1.length) {\r
- if ( intToStr[aseq1[count+i+j*len]].equals(intToStr[aseq2[count+i+j*len]]) && !intToStr[aseq1[count+i+j*len]].equals("-")) {\r
- pid++;\r
- output = output + ("|");\r
- } else if (type.equals("pep")) {\r
- if (ResidueProperties.getPAM250(intToStr[aseq1[count+i+j*len]],intToStr[aseq2[count+i+j*len]]) > 0) {\r
- output = output + (".");\r
- } else {\r
- output = output + (" ");\r
- }\r
- } else {\r
- output = output + (" ");\r
- }\r
-\r
- }\r
- }\r
- // Now print the second aligned sequence\r
- output = output + ("\n");\r
- output = output + (new Format("%" + (maxid) + "s").form(s2.getName()) + " " );\r
- for (int i = 0; i < len ; i++) {\r
- if ((count + i + j*len) < aseq1.length) {\r
- output = output + (new Format("%s").form(intToStr[aseq2[count + i + j*len]]));\r
- }\r
- }\r
- output = output + ("\n\n");\r
- }\r
- pid = pid/(float)(aseq1.length-count)*100;\r
- output = output + (new Format("Percentage ID = %2.2f\n\n").form(pid));\r
-\r
- }\r
-\r
- public void printScoreMatrix(int[][] mat) {\r
- int n = seq1.length;\r
- int m = seq2.length;\r
-\r
- for (int i = 0; i < n;i++) {\r
- // Print the top sequence\r
- if (i == 0) {\r
- Format.print(System.out,"%8s",s2str.substring(0,1));\r
- for (int jj = 1;jj < m; jj++) {\r
- Format.print(System.out,"%5s",s2str.substring(jj,jj+1));\r
- }\r
- System.out.println();\r
- }\r
-\r
- for (int j = 0;j < m; j++) {\r
- if (j == 0) {\r
- Format.print(System.out,"%3s",s1str.substring(i,i+1));\r
- }\r
- Format.print(System.out,"%3d ",mat[i][j]/10);\r
- }\r
- System.out.println();\r
- }\r
- }\r
-\r
- public int findTrace(int i,int j) {\r
- int t = 0;\r
- int max = score[i-1][j-1] + lookup[seq1[i]][seq2[j]] * 10;\r
-\r
- if (F[i][j] > max) {\r
- max = F[i][j];\r
- t = -1;\r
- } else if (F[i][j] == max) {\r
- if (prev == -1) {\r
- max = F[i][j];\r
- t = -1;\r
- }\r
- }\r
- if (E[i][j] >= max) {\r
- max = E[i][j];\r
- t = 1;\r
- } else if (E[i][j] == max) {\r
- if (prev == 1) {\r
- max = E[i][j];\r
- t = 1;\r
- }\r
- }\r
- prev = t;\r
- return t;\r
- }\r
-\r
- public void calcScoreMatrix() {\r
-\r
-\r
- int n = seq1.length;\r
- int m = seq2.length;\r
-\r
-\r
- // top left hand element\r
- score[0][0] = lookup[seq1[0]][seq2[0]] * 10;\r
- E[0][0] = -gapExtend;\r
- F[0][0] = 0;\r
-\r
- // Calculate the top row first\r
- for (int j=1; j < m; j++) {\r
- // What should these values be? 0 maybe\r
- E[0][j] = max(score[0][j-1] - gapOpen,E[0][j-1] - gapExtend);\r
- F[0][j] = -gapExtend;\r
-\r
- score[0][j] = max( lookup[seq1[0]][seq2[j]] * 10 ,-gapOpen,-gapExtend);\r
-\r
- traceback[0][j] = 1;\r
- }\r
-\r
- // Now do the left hand column\r
- for (int i=1; i < n; i++) {\r
- E[i][0] = -gapOpen;\r
- F[i][0] = max(score[i-1][0]-gapOpen,F[i-1][0]-gapExtend);\r
-\r
- score[i][0] = max( lookup[seq1[i]][seq2[0]] * 10 ,E[i][0],F[i][0]);\r
- traceback[i][0] = -1;\r
- }\r
-\r
- // Now do all the other rows\r
- for (int i = 1; i < n; i++) {\r
- for (int j = 1; j < m; j++) {\r
-\r
- E[i][j] = max(score[i][j-1] - gapOpen, E[i][j-1] - gapExtend);\r
- F[i][j] = max(score[i-1][j] - gapOpen, F[i-1][j] - gapExtend);\r
-\r
- score[i][j] = max(score[i-1][j-1] + lookup[seq1[i]][seq2[j]]*10,\r
- E[i][j],\r
- F[i][j]);\r
- traceback[i][j] = findTrace(i,j);\r
- }\r
- }\r
-\r
- }\r
- public static String extractChars(String chars, String seq) {\r
- String out = seq;\r
- for (int i=0; i < chars.length(); i++) {\r
- String gap = chars.substring(i,i+1);\r
- out = extractGaps(gap,out);\r
- }\r
- return out;\r
- }\r
- public static String extractGaps(String gapChar, String seq) {\r
- StringTokenizer str = new StringTokenizer(seq,gapChar);\r
- String newString = "";\r
-\r
- while (str.hasMoreTokens()) {\r
- newString = newString + str.nextToken();\r
- }\r
- return newString;\r
- }\r
-\r
-\r
- public int max(int i1, int i2, int i3) {\r
- int max = i1;\r
- if (i2 > i1) {\r
- max = i2;\r
- }\r
- if (i3 > max) {\r
- max = i3;\r
- }\r
- return max;\r
- }\r
-\r
- public int max(int i1, int i2) {\r
- int max = i1;\r
- if (i2 > i1) {\r
- max = i2;\r
- }\r
- return max;\r
- }\r
-\r
- public int[] stringToInt(String s,String type) {\r
- int[] seq1 = new int[s.length()];\r
-\r
- for (int i = 0;i < s.length(); i++) {\r
- String ss = s.substring(i,i+1).toUpperCase();\r
- try {\r
- if (type.equals("pep")) {\r
- seq1[i] = ((Integer)ResidueProperties.aaHash.get(ss)).intValue();\r
- } else if (type.equals("dna")) {\r
- seq1[i] = ((Integer)dnaHash.get(ss)).intValue();\r
- }\r
- if (seq1[i] > 23) {\r
- seq1[i] = 23;\r
- }\r
- } catch (Exception e) {\r
- if (type.equals("dna")) {\r
- seq1[i] = 4;\r
- } else {\r
- seq1[i] = 23;\r
- }\r
- }\r
- }\r
- return seq1;\r
- }\r
-\r
- public static void displayMatrix(Graphics g, int[][] mat, int n, int m,int psize) {\r
-\r
- int max = -1000;\r
- int min = 1000;\r
-\r
- for (int i=0; i < n; i++) {\r
- for (int j=0; j < m; j++) {\r
- if (mat[i][j] >= max) {\r
- max = mat[i][j];\r
- }\r
- if (mat[i][j] <= min) {\r
- min = mat[i][j];\r
- }\r
- }\r
- }\r
- System.out.println(max + " " + min);\r
- for (int i=0; i < n; i++) {\r
- for (int j=0; j < m; j++) {\r
- int x = psize*i;\r
- int y = psize*j;\r
- // System.out.println(mat[i][j]);\r
- float score = (float)(mat[i][j] - min)/(float)(max-min);\r
- g.setColor(new Color(score,0,0));\r
- g.fillRect(x,y,psize,psize);\r
- // System.out.println(x + " " + y + " " + score);\r
- }\r
-\r
- }\r
- }\r
-\r
-}\r
+/*
+* Jalview - A Sequence Alignment Editor and Viewer
+* Copyright (C) 2006 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
+*/
+package jalview.analysis;
+
+import jalview.datamodel.SequenceI;
+
+import jalview.schemes.*;
+
+import jalview.util.*;
+
+import java.awt.*;
+
+import java.util.*;
+
+
+/**
+ *
+ *
+ * @author $author$
+ * @version $Revision$
+ */
+public class AlignSeq
+{
+ public static final String PEP = "pep";
+ public static final String DNA = "dna";
+ /** DOCUMENT ME!! */
+ public static java.util.Hashtable dnaHash = new java.util.Hashtable();
+
+ static
+ {
+ dnaHash.put("C", new Integer(0));
+ dnaHash.put("T", new Integer(1));
+ dnaHash.put("A", new Integer(2));
+ dnaHash.put("G", new Integer(3));
+ dnaHash.put("-", new Integer(4));
+ }
+
+ static String[] dna = { "C", "T", "A", "G", "-" };
+ static String[] pep =
+ {
+ "A", "R", "N", "D", "C", "Q", "E", "G", "H", "I", "L", "K", "M", "F",
+ "P", "S", "T", "W", "Y", "V", "B", "Z", "X", "-"
+ };
+ int[][] score;
+ int[][] E;
+ int[][] F;
+ int[][] traceback;
+ int[] seq1;
+ int[] seq2;
+ SequenceI s1;
+ SequenceI s2;
+ public String s1str;
+ public String s2str;
+ int maxi;
+ int maxj;
+ int[] aseq1;
+ int[] aseq2;
+ public String astr1="";
+ public String astr2="";
+
+ /** DOCUMENT ME!! */
+ public int seq1start;
+
+ /** DOCUMENT ME!! */
+ public int seq1end;
+
+ /** DOCUMENT ME!! */
+ public int seq2start;
+
+ /** DOCUMENT ME!! */
+ public int seq2end;
+ int count;
+
+ /** DOCUMENT ME!! */
+ public int maxscore;
+ float pid;
+ int prev = 0;
+ int gapOpen = 120;
+ int gapExtend = 20;
+ int[][] lookup = ResidueProperties.getBLOSUM62();
+ String[] intToStr = pep;
+ int defInt = 23;
+ StringBuffer output = new StringBuffer();
+ String type;
+
+ /**
+ * Creates a new AlignSeq object.
+ *
+ * @param s1 DOCUMENT ME!
+ * @param s2 DOCUMENT ME!
+ * @param type DOCUMENT ME!
+ */
+ public AlignSeq(SequenceI s1, SequenceI s2, String type)
+ {
+ SeqInit(s1, s1.getSequenceAsString(), s2, s2.getSequenceAsString(), type);
+ }
+
+ /**
+ * Creates a new AlignSeq object.
+ *
+ * @param s1 DOCUMENT ME!
+ * @param s2 DOCUMENT ME!
+ * @param type DOCUMENT ME!
+ */
+ public AlignSeq(SequenceI s1,
+ String string1,
+ SequenceI s2,
+ String string2,
+ String type)
+ {
+ SeqInit(s1, string1, s2, string2, type);
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int getMaxScore()
+ {
+ return maxscore;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int getSeq2Start()
+ {
+ return seq2start;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int getSeq2End()
+ {
+ return seq2end;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int getSeq1Start()
+ {
+ return seq1start;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int getSeq1End()
+ {
+ return seq1end;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public String getOutput()
+ {
+ return output.toString();
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public String getAStr1()
+ {
+ return astr1;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public String getAStr2()
+ {
+ return astr2;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int[] getASeq1()
+ {
+ return aseq1;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int[] getASeq2()
+ {
+ return aseq2;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public SequenceI getS1()
+ {
+ return s1;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public SequenceI getS2()
+ {
+ return s2;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @param s1 DOCUMENT ME!
+ * @param string1 - string to align for sequence1
+ * @param s2 sequence 2
+ * @param string2 - string to align for sequence2
+ * @param type DNA or PEPTIDE
+ */
+ public void SeqInit(SequenceI s1,
+ String string1,
+ SequenceI s2,
+ String string2,
+ String type)
+ {
+ this.s1 = s1;
+ this.s2 = s2;
+ setDefaultParams(type);
+ SeqInit(string1,string2);
+ }
+ public void SeqInit(SequenceI s1,
+ String string1,
+ SequenceI s2,
+ String string2,
+ ScoreMatrix scoreMatrix) {
+ this.s1=s1;
+ this.s2=s2;
+ setType(scoreMatrix.isDNA() ? AlignSeq.DNA : AlignSeq.PEP);
+ lookup=scoreMatrix.getMatrix();
+ }
+ /**
+ * construct score matrix for string1 and string2 (after removing any existing gaps
+ * @param string1
+ * @param string2
+ */
+ private void SeqInit(String string1, String string2) {
+ s1str = extractGaps(jalview.util.Comparison.GapChars, string1);
+ s2str = extractGaps(jalview.util.Comparison.GapChars, string2);
+
+ if(s1str.length()==0 || s2str.length()==0)
+ {
+ output.append("ALL GAPS: " +
+ (s1str.length()==0?s1.getName():" ")
+ +(s2str.length()==0?s2.getName():""));
+ return;
+ }
+
+ //System.out.println("lookuip " + rt.freeMemory() + " "+ rt.totalMemory());
+ seq1 = new int[s1str.length()];
+
+ //System.out.println("seq1 " + rt.freeMemory() +" " + rt.totalMemory());
+ seq2 = new int[s2str.length()];
+
+ //System.out.println("seq2 " + rt.freeMemory() + " " + rt.totalMemory());
+ score = new int[s1str.length()][s2str.length()];
+
+ //System.out.println("score " + rt.freeMemory() + " " + rt.totalMemory());
+ E = new int[s1str.length()][s2str.length()];
+
+ //System.out.println("E " + rt.freeMemory() + " " + rt.totalMemory());
+ F = new int[s1str.length()][s2str.length()];
+ traceback = new int[s1str.length()][s2str.length()];
+
+ //System.out.println("F " + rt.freeMemory() + " " + rt.totalMemory());
+ seq1 = stringToInt(s1str, type);
+
+ //System.out.println("seq1 " + rt.freeMemory() + " " + rt.totalMemory());
+ seq2 = stringToInt(s2str, type);
+
+ //System.out.println("Seq2 " + rt.freeMemory() + " " + rt.totalMemory());
+ // long tstart = System.currentTimeMillis();
+ // calcScoreMatrix();
+ //long tend = System.currentTimeMillis();
+ //System.out.println("Time take to calculate score matrix = " + (tend-tstart) + " ms");
+ // printScoreMatrix(score);
+ //System.out.println();
+ //printScoreMatrix(traceback);
+ //System.out.println();
+ // printScoreMatrix(E);
+ //System.out.println();
+ ///printScoreMatrix(F);
+ //System.out.println();
+ // tstart = System.currentTimeMillis();
+ //traceAlignment();
+ //tend = System.currentTimeMillis();
+ //System.out.println("Time take to traceback alignment = " + (tend-tstart) + " ms");
+ }
+
+ private void setDefaultParams(String type) {
+ setType(type);
+
+ if (type.equals(AlignSeq.PEP))
+ {
+ lookup = ResidueProperties.getDefaultPeptideMatrix();
+ }
+ else if (type.equals(AlignSeq.DNA))
+ {
+ lookup = ResidueProperties.getDefaultDnaMatrix();
+ }
+ }
+
+ private void setType(String type2) {
+ this.type = type2;
+ if (type.equals(AlignSeq.PEP))
+ {
+ intToStr = pep;
+ defInt = 23;
+ }
+ else if (type.equals(AlignSeq.DNA))
+ {
+ intToStr = dna;
+ defInt = 4;
+ }
+ else
+ {
+ output.append("Wrong type = dna or pep only");
+ throw new Error("Unknown Type "+type2+" - dna or pep are the only allowed values.");
+ }
+ }
+
+ /**
+ * DOCUMENT ME!
+ */
+ public void traceAlignment()
+ {
+ // Find the maximum score along the rhs or bottom row
+ int max = -9999;
+
+ for (int i = 0; i < seq1.length; i++)
+ {
+ if (score[i][seq2.length - 1] > max)
+ {
+ max = score[i][seq2.length - 1];
+ maxi = i;
+ maxj = seq2.length - 1;
+ }
+ }
+
+ for (int j = 0; j < seq2.length; j++)
+ {
+ if (score[seq1.length - 1][j] > max)
+ {
+ max = score[seq1.length - 1][j];
+ maxi = seq1.length - 1;
+ maxj = j;
+ }
+ }
+
+ // System.out.println(maxi + " " + maxj + " " + score[maxi][maxj]);
+ int i = maxi;
+ int j = maxj;
+ int trace;
+ maxscore = score[i][j] / 10;
+
+ seq1end = maxi + 1;
+ seq2end = maxj + 1;
+
+ aseq1 = new int[seq1.length + seq2.length];
+ aseq2 = new int[seq1.length + seq2.length];
+
+ count = (seq1.length + seq2.length) - 1;
+
+ while ((i > 0) && (j > 0))
+ {
+ if ((aseq1[count] != defInt) && (i >= 0))
+ {
+ aseq1[count] = seq1[i];
+ astr1 = intToStr[seq1[i]] + astr1;
+ }
+
+ if ((aseq2[count] != defInt) && (j > 0))
+ {
+ aseq2[count] = seq2[j];
+ astr2 = intToStr[seq2[j]] + astr2;
+ }
+
+ trace = findTrace(i, j);
+
+ if (trace == 0)
+ {
+ i--;
+ j--;
+ }
+ else if (trace == 1)
+ {
+ j--;
+ aseq1[count] = defInt;
+ astr1 = "-" + astr1.substring(1);
+ }
+ else if (trace == -1)
+ {
+ i--;
+ aseq2[count] = defInt;
+ astr2 = "-" + astr2.substring(1);
+ }
+
+ count--;
+ }
+
+ seq1start = i + 1;
+ seq2start = j + 1;
+
+ if (aseq1[count] != defInt)
+ {
+ aseq1[count] = seq1[i];
+ astr1 = intToStr[seq1[i]] + astr1;
+ }
+
+ if (aseq2[count] != defInt)
+ {
+ aseq2[count] = seq2[j];
+ astr2 = intToStr[seq2[j]] + astr2;
+ }
+ }
+
+ /**
+ * DOCUMENT ME!
+ */
+ public void printAlignment(java.io.PrintStream os)
+ {
+ // Find the biggest id length for formatting purposes
+ int maxid = s1.getName().length();
+
+ if (s2.getName().length() > maxid)
+ {
+ maxid = s2.getName().length();
+ }
+
+ int len = 72 - maxid - 1;
+ int nochunks = ((aseq1.length - count) / len) + 1;
+ pid = 0;
+
+ output.append("Score = " + score[maxi][maxj] + "\n");
+ output.append("Length of alignment = " + (aseq1.length - count) + "\n");
+ output.append("Sequence ");
+ output.append(new Format("%" + maxid + "s").form(s1.getName()));
+ output.append(" : " + s1.getStart() + " - " + s1.getEnd() + " (Sequence length = " +
+ s1str.length() + ")\n");
+ output .append("Sequence ");
+ output.append(new Format("%" + maxid + "s").form(s2.getName()));
+ output.append(" : " + s2.getStart() + " - " + s2.getEnd() + " (Sequence length = " +
+ s2str.length() + ")\n\n");
+
+ for (int j = 0; j < nochunks; j++)
+ {
+ // Print the first aligned sequence
+ output.append(new Format("%" + (maxid) + "s").form(s1.getName()) + " ");
+
+ for (int i = 0; i < len; i++)
+ {
+ if ((count + i + (j * len)) < aseq1.length)
+ {
+ output.append(new Format("%s").form(intToStr[aseq1[count + i +
+ (j * len)]]));
+ }
+ }
+
+ output.append("\n");
+ output.append(new Format("%" + (maxid) + "s").form(" ") + " ");
+
+ // Print out the matching chars
+ for (int i = 0; i < len; i++)
+ {
+ if ((count + i + (j * len)) < aseq1.length)
+ {
+ if (intToStr[aseq1[count + i + (j * len)]].equals(
+ intToStr[aseq2[count + i + (j * len)]]) &&
+ !intToStr[aseq1[count + i + (j * len)]].equals("-"))
+ {
+ pid++;
+ output.append("|");
+ }
+ else if (type.equals("pep"))
+ {
+ if (ResidueProperties.getPAM250(
+ intToStr[aseq1[count + i + (j * len)]],
+ intToStr[aseq2[count + i + (j * len)]]) > 0)
+ {
+ output.append(".");
+ }
+ else
+ {
+ output.append(" ");
+ }
+ }
+ else
+ {
+ output.append(" ");
+ }
+ }
+ }
+
+ // Now print the second aligned sequence
+ output = output.append("\n");
+ output = output.append(new Format("%" + (maxid) + "s").form(s2.getName()) + " ");
+
+ for (int i = 0; i < len; i++)
+ {
+ if ((count + i + (j * len)) < aseq1.length)
+ {
+ output .append(new Format("%s").form(intToStr[aseq2[count + i +
+ (j * len)]]));
+ }
+ }
+
+ output = output .append("\n\n");
+ }
+
+ pid = pid / (float) (aseq1.length - count) * 100;
+ output = output.append(new Format("Percentage ID = %2.2f\n\n").form(pid));
+
+ try{
+ os.print(output.toString());
+ }catch(Exception ex){}
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @param mat DOCUMENT ME!
+ */
+ public void printScoreMatrix(int[][] mat)
+ {
+ int n = seq1.length;
+ int m = seq2.length;
+
+ for (int i = 0; i < n; i++)
+ {
+ // Print the top sequence
+ if (i == 0)
+ {
+ Format.print(System.out, "%8s", s2str.substring(0, 1));
+
+ for (int jj = 1; jj < m; jj++)
+ {
+ Format.print(System.out, "%5s", s2str.substring(jj, jj + 1));
+ }
+
+ System.out.println();
+ }
+
+ for (int j = 0; j < m; j++)
+ {
+ if (j == 0)
+ {
+ Format.print(System.out, "%3s", s1str.substring(i, i + 1));
+ }
+
+ Format.print(System.out, "%3d ", mat[i][j] / 10);
+ }
+
+ System.out.println();
+ }
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @param i DOCUMENT ME!
+ * @param j DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int findTrace(int i, int j)
+ {
+ int t = 0;
+ int max = score[i - 1][j - 1] + (lookup[seq1[i]][seq2[j]] * 10);
+
+ if (F[i][j] > max)
+ {
+ max = F[i][j];
+ t = -1;
+ }
+ else if (F[i][j] == max)
+ {
+ if (prev == -1)
+ {
+ max = F[i][j];
+ t = -1;
+ }
+ }
+
+ if (E[i][j] >= max)
+ {
+ max = E[i][j];
+ t = 1;
+ }
+ else if (E[i][j] == max)
+ {
+ if (prev == 1)
+ {
+ max = E[i][j];
+ t = 1;
+ }
+ }
+
+ prev = t;
+
+ return t;
+ }
+
+ /**
+ * DOCUMENT ME!
+ */
+ public void calcScoreMatrix()
+ {
+ int n = seq1.length;
+ int m = seq2.length;
+
+ // top left hand element
+ score[0][0] = lookup[seq1[0]][seq2[0]] * 10;
+ E[0][0] = -gapExtend;
+ F[0][0] = 0;
+
+ // Calculate the top row first
+ for (int j = 1; j < m; j++)
+ {
+ // What should these values be? 0 maybe
+ E[0][j] = max(score[0][j - 1] - gapOpen, E[0][j - 1] - gapExtend);
+ F[0][j] = -gapExtend;
+
+ score[0][j] = max(lookup[seq1[0]][seq2[j]] * 10, -gapOpen,
+ -gapExtend);
+
+ traceback[0][j] = 1;
+ }
+
+ // Now do the left hand column
+ for (int i = 1; i < n; i++)
+ {
+ E[i][0] = -gapOpen;
+ F[i][0] = max(score[i - 1][0] - gapOpen, F[i - 1][0] - gapExtend);
+
+ score[i][0] = max(lookup[seq1[i]][seq2[0]] * 10, E[i][0], F[i][0]);
+ traceback[i][0] = -1;
+ }
+
+ // Now do all the other rows
+ for (int i = 1; i < n; i++)
+ {
+ for (int j = 1; j < m; j++)
+ {
+ E[i][j] = max(score[i][j - 1] - gapOpen, E[i][j - 1] -
+ gapExtend);
+ F[i][j] = max(score[i - 1][j] - gapOpen, F[i - 1][j] -
+ gapExtend);
+
+ score[i][j] = max(score[i - 1][j - 1] +
+ (lookup[seq1[i]][seq2[j]] * 10), E[i][j], F[i][j]);
+ traceback[i][j] = findTrace(i, j);
+ }
+ }
+ }
+
+
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @param gapChar DOCUMENT ME!
+ * @param seq DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public static String extractGaps(String gapChar, String seq)
+ {
+ StringTokenizer str = new StringTokenizer(seq, gapChar);
+ StringBuffer newString = new StringBuffer();
+
+ while (str.hasMoreTokens())
+ {
+ newString.append( str.nextToken() );
+ }
+
+ return newString.toString();
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @param i1 DOCUMENT ME!
+ * @param i2 DOCUMENT ME!
+ * @param i3 DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int max(int i1, int i2, int i3)
+ {
+ int max = i1;
+
+ if (i2 > i1)
+ {
+ max = i2;
+ }
+
+ if (i3 > max)
+ {
+ max = i3;
+ }
+
+ return max;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @param i1 DOCUMENT ME!
+ * @param i2 DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int max(int i1, int i2)
+ {
+ int max = i1;
+
+ if (i2 > i1)
+ {
+ max = i2;
+ }
+
+ return max;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @param s DOCUMENT ME!
+ * @param type DOCUMENT ME!
+ *
+ * @return DOCUMENT ME!
+ */
+ public int[] stringToInt(String s, String type)
+ {
+ int[] seq1 = new int[s.length()];
+
+ for (int i = 0; i < s.length(); i++)
+ {
+ // String ss = s.substring(i, i + 1).toUpperCase();
+ char c = s.charAt(i);
+ if ('a' <= c && c <= 'z')
+ {
+ // TO UPPERCASE !!!
+ c -= ('a' - 'A');
+ }
+
+
+ try
+ {
+ if (type.equals("pep"))
+ {
+ seq1[i] = ResidueProperties.aaIndex[c];
+ }
+ else if (type.equals("dna"))
+ {
+ seq1[i] = ResidueProperties.nucleotideIndex[c];
+ }
+
+ if (seq1[i] > 23)
+ {
+ seq1[i] = 23;
+ }
+ }
+ catch (Exception e)
+ {
+ if (type.equals("dna"))
+ {
+ seq1[i] = 4;
+ }
+ else
+ {
+ seq1[i] = 23;
+ }
+ }
+ }
+
+ return seq1;
+ }
+
+ /**
+ * DOCUMENT ME!
+ *
+ * @param g DOCUMENT ME!
+ * @param mat DOCUMENT ME!
+ * @param n DOCUMENT ME!
+ * @param m DOCUMENT ME!
+ * @param psize DOCUMENT ME!
+ */
+ public static void displayMatrix(Graphics g, int[][] mat, int n, int m,
+ int psize)
+ {
+ int max = -1000;
+ int min = 1000;
+
+ for (int i = 0; i < n; i++)
+ {
+ for (int j = 0; j < m; j++)
+ {
+ if (mat[i][j] >= max)
+ {
+ max = mat[i][j];
+ }
+
+ if (mat[i][j] <= min)
+ {
+ min = mat[i][j];
+ }
+ }
+ }
+
+ System.out.println(max + " " + min);
+
+ for (int i = 0; i < n; i++)
+ {
+ for (int j = 0; j < m; j++)
+ {
+ int x = psize * i;
+ int y = psize * j;
+
+ // System.out.println(mat[i][j]);
+ float score = (float) (mat[i][j] - min) / (float) (max - min);
+ g.setColor(new Color(score, 0, 0));
+ g.fillRect(x, y, psize, psize);
+
+ // System.out.println(x + " " + y + " " + score);
+ }
+ }
+ }
+}
git://source.jalview.org / jalview.git / blobdiff