X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fschemes%2FConsensus.java;h=ac895bbb6f90f460037bc0940a152d73948ba59b;hb=7bc213bae5828287329a3490faba291706599b03;hp=17cb789355ff58c402230beb53bafd530e538fb6;hpb=0f530039f8c0ac9c6613063a576c3a13c8644fcd;p=jalview.git diff --git a/src/jalview/schemes/Consensus.java b/src/jalview/schemes/Consensus.java index 17cb789..ac895bb 100755 --- a/src/jalview/schemes/Consensus.java +++ b/src/jalview/schemes/Consensus.java @@ -1,5 +1,6 @@ -/* Jalview - a java multiple alignment editor - * Copyright (C) 1998 Michele Clamp +/* + * Jalview - A Sequence Alignment Editor and Viewer + * Copyright (C) 2005 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 @@ -13,64 +14,67 @@ * * 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. + * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA */ - package jalview.schemes; //////////////////////////////////////////// // This does nothing at all at the moment!!!!!!!!!! // AW 15th Dec 2004 ///////////////////////////////////////// -public class Consensus { - +public class Consensus +{ int[] mask; double threshold; - String maskstr; + String maskstr; - public Consensus(String mask, double threshold) { + public Consensus(String mask, double threshold) + { // this.id = id; // this.mask = mask; - this.maskstr = mask; + this.maskstr = mask; setMask(mask); this.threshold = threshold; } - public void setMask(String s) { + public void setMask(String s) + { this.mask = setNums(s); + // for (int i=0; i < mask.length; i++) { // System.out.println(mask[i] + " " + ResidueProperties.aa[mask[i]]); // } } - public boolean isConserved(int[][] cons2,int col ,int size) { + public boolean isConserved(int[][] cons2, int col, int size) + { int tot = 0; + for (int i = 0; i < mask.length; i++) + { tot += cons2[col][mask[i]]; + } - if ( (double) tot > threshold * size / 100) + if ( (double) tot > ( (threshold * size) / 100)) + { return true; + } return false; } int[] setNums(String s) { - int [] out = new int[s.length()]; + int[] out = new int[s.length()]; int i = 0; + while (i < s.length()) { - out[i] = ( (Integer) ResidueProperties.aaHash.get(s.substring(i, i + 1))).intValue(); + out[i] = ( (Integer) ResidueProperties.aaHash.get(s.substring(i, + i + 1))).intValue(); i++; - } return out; } - - } - - - -