jpayne@68: package aligner;
jpayne@68: 
jpayne@68: import java.util.Arrays;
jpayne@68: 
jpayne@68: import shared.KillSwitch;
jpayne@68: import shared.Tools;
jpayne@68: 
jpayne@68: /**
jpayne@68:  * Based on MSA9PBA, but reduced to a single matrix. */
jpayne@68: public final class SingleStateAlignerPacBioAdapter {
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	public SingleStateAlignerPacBioAdapter(int maxRows_, int maxColumns_, int qlen){
jpayne@68: //		assert(maxColumns_>=200);
jpayne@68: //		assert(maxRows_>=200);
jpayne@68: 		maxRows=maxRows_;
jpayne@68: 		maxColumns=maxColumns_;
jpayne@68: 		packed=new int[maxRows+1][maxColumns+1];
jpayne@68: 
jpayne@68: 		insScoreArray=KillSwitch.allocInt1D(5);
jpayne@68: 		delScoreArray=KillSwitch.allocInt1D(5);
jpayne@68: 		matchScoreArray=KillSwitch.allocInt1D(5);
jpayne@68: 		subScoreArray=KillSwitch.allocInt1D(5);
jpayne@68: 
jpayne@68: 		Arrays.fill(insScoreArray, POINTSoff_INS|MODE_INS);
jpayne@68: 		Arrays.fill(delScoreArray, POINTSoff_DEL|MODE_DEL);
jpayne@68: 		Arrays.fill(matchScoreArray, POINTSoff_MATCH|MODE_MATCH);
jpayne@68: 		Arrays.fill(subScoreArray, POINTSoff_SUB|MODE_SUB);
jpayne@68: 		
jpayne@68: 		insScoreArray[MODE_INS]=POINTSoff_INS2|MODE_INS;
jpayne@68: 		delScoreArray[MODE_DEL]=POINTSoff_DEL2|MODE_DEL;
jpayne@68: 		matchScoreArray[MODE_MATCH]=POINTSoff_MATCH2|MODE_MATCH;
jpayne@68: 		subScoreArray[MODE_SUB]=POINTSoff_SUB2|MODE_SUB;
jpayne@68: 		
jpayne@68: 		vertLimit=new int[maxRows+1];
jpayne@68: 		horizLimit=new int[maxColumns+1];
jpayne@68: 		Arrays.fill(vertLimit, BADoff);
jpayne@68: 		Arrays.fill(horizLimit, BADoff);
jpayne@68: 		
jpayne@68: //		for(int i=0; i<maxColumns+1; i++){
jpayne@68: //			scores[0][i]=0-i;
jpayne@68: //		}
jpayne@68: 		
jpayne@68: 		for(int i=1; i<=maxRows; i++){
jpayne@68: 			for(int j=1; j<packed[i].length; j++){
jpayne@68: 				packed[i][j]|=BADoff;
jpayne@68: 			}
jpayne@68: 		}
jpayne@68: 		for(int i=0; i<=maxRows; i++){
jpayne@68: 
jpayne@68: 			int prevScore=(i<2 ? 0 : packed[i-1][0]);
jpayne@68: 			int score=(i<2 ? (i*POINTSoff_INS) : prevScore+POINTSoff_INS2);
jpayne@68: 
jpayne@68: 			packed[i][0]=score;
jpayne@68: 		}
jpayne@68: 		for(int i=0; i<packed[0].length; i++){
jpayne@68: 			packed[0][i]=packed[0][i]|(i<<STARTOFFSET);
jpayne@68: 			int x=packed[0].length-i;
jpayne@68: 			int qbases=qlen-x;
jpayne@68: 			if(qbases>0){
jpayne@68: 				packed[0][i]|=calcDelScoreOffset(qbases); //Forces consumption of query
jpayne@68: 			}
jpayne@68: 		}
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	/** return new int[] {rows, maxCol, maxState, maxScore, maxStart};
jpayne@68: 	 * Will not fill areas that cannot match minScore */
jpayne@68: 	public final int[] fillLimited(byte[] read, byte[] ref, int refStartLoc, int refEndLoc, int minScore){
jpayne@68: 		return fillLimitedX(read, ref, refStartLoc, refEndLoc, minScore);
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	/** return new int[] {rows, maxCol, maxState, maxScore, maxStart};
jpayne@68: 	 * Will not fill areas that cannot match minScore */
jpayne@68: 	private final int[] fillLimitedX(byte[] read, byte[] ref, int refStartLoc, int refEndLoc, int minScore){
jpayne@68: 		return fillUnlimited(read, ref, refStartLoc, refEndLoc, minScore);
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	/** return new int[] {rows, maxCol, maxState, maxScore, maxStart};
jpayne@68: 	 * Does not require a min score (ie, same as old method) */
jpayne@68: 	private final int[] fillUnlimited(byte[] read, byte[] ref, int refStartLoc, int refEndLoc, final int minScore){
jpayne@68: 		rows=read.length;
jpayne@68: 		columns=refEndLoc-refStartLoc+1;
jpayne@68: 		
jpayne@68: 		//temporary, for finding a bug
jpayne@68: 		if(rows>maxRows || columns>maxColumns){
jpayne@68: 			throw new RuntimeException("rows="+rows+", maxRows="+maxRows+", cols="+columns+", maxCols="+maxColumns+"\n"+new String(read)+"\n");
jpayne@68: 		}
jpayne@68: 		
jpayne@68: 		assert(rows<=maxRows) : "Check that values are in-bounds before calling this function: "+rows+", "+maxRows;
jpayne@68: 		assert(columns<=maxColumns) : "Check that values are in-bounds before calling this function: "+columns+", "+maxColumns;
jpayne@68: 		
jpayne@68: 		assert(refStartLoc>=0) : "Check that values are in-bounds before calling this function: "+refStartLoc;
jpayne@68: 		assert(refEndLoc<ref.length) : "Check that values are in-bounds before calling this function: "+refEndLoc+", "+ref.length;
jpayne@68: 
jpayne@68: 		final int refOffset=refStartLoc-1;
jpayne@68: 		for(int row=1; row<=rows; row++){
jpayne@68: 
jpayne@68: 			final byte qBase=read[row-1];
jpayne@68: 			for(int col=1; col<=columns; col++){
jpayne@68: 				iterationsUnlimited++;
jpayne@68: 				
jpayne@68: 				final byte rBase=ref[refOffset+col];
jpayne@68: 				
jpayne@68: 				final boolean match=(qBase==rBase);//Note that qBase will never be 'N'
jpayne@68: 
jpayne@68: 				final int valueFromDiag=packed[row-1][col-1];
jpayne@68: 				final int valueFromDel=packed[row][col-1];
jpayne@68: 				final int valueFromIns=packed[row-1][col];
jpayne@68: 				final int stateFromDiag=valueFromDiag&MODEMASK;
jpayne@68: 				final int scoreFromDiag=valueFromDiag&HIGHMASK;
jpayne@68: 				final int stateFromDel=valueFromDel&MODEMASK;
jpayne@68: 				final int scoreFromDel=valueFromDel&HIGHMASK;
jpayne@68: 				final int stateFromIns=valueFromIns&MODEMASK;
jpayne@68: 				final int scoreFromIns=valueFromIns&HIGHMASK;
jpayne@68: 				
jpayne@68: //				final boolean prevMatch=stateFromDiag==MODE_MATCH;
jpayne@68: //				final boolean prevSub=stateFromDiag==MODE_SUB;
jpayne@68: //				final boolean prevDel=stateFromDel==MODE_DEL;
jpayne@68: //				final boolean prevIns=stateFromIns==MODE_INS;
jpayne@68: 				
jpayne@68: 				//Old conditional code, replaced by faster arrays
jpayne@68: //				final int diagScoreM=MODE_MATCH|(prevMatch ? POINTSoff_MATCH2 : POINTSoff_MATCH);
jpayne@68: //				final int diagScoreS=MODE_SUB|(prevSub ? POINTSoff_SUB2 : POINTSoff_SUB);
jpayne@68: //				final int delScore=scoreFromDel+(prevDel ? POINTSoff_DEL2 : POINTSoff_DEL)|MODE_DEL;
jpayne@68: //				final int insScore=scoreFromIns+(prevIns ? POINTSoff_INS2 : POINTSoff_INS)|MODE_INS;
jpayne@68: 				
jpayne@68: 				final int diagScoreM=matchScoreArray[stateFromDiag];
jpayne@68: 				final int diagScoreS=subScoreArray[stateFromDiag];
jpayne@68: 				final int delScore=scoreFromDel+delScoreArray[stateFromDel];
jpayne@68: 				final int insScore=scoreFromIns+insScoreArray[stateFromIns];
jpayne@68: 				
jpayne@68: 				int diagScore=(match ? diagScoreM : diagScoreS);
jpayne@68: 				diagScore=scoreFromDiag+(rBase!='N' ? diagScore : POINTSoff_NOREF_MODE_SUB);
jpayne@68: 				
jpayne@68: 				int score=diagScore>=delScore ? diagScore : delScore;
jpayne@68: 				score=score>=insScore ? score : insScore;
jpayne@68: 				
jpayne@68: 				packed[row][col]=score;
jpayne@68: 			}
jpayne@68: 		}
jpayne@68: 		
jpayne@68: 
jpayne@68: 		int maxCol=-1;
jpayne@68: 		int maxState=-1;
jpayne@68: 		int maxStart=-1;
jpayne@68: 		int maxScore=Integer.MIN_VALUE;
jpayne@68: 		
jpayne@68: 		for(int col=1; col<=columns; col++){
jpayne@68: 			int x=packed[rows][col];
jpayne@68: 			if((x&SCOREMASK)>maxScore){
jpayne@68: 				maxScore=x;
jpayne@68: 				maxCol=col;
jpayne@68: 				maxState=x&MODEMASK;
jpayne@68: 				maxStart=x&STARTMASK;
jpayne@68: 			}
jpayne@68: 		}
jpayne@68: 		maxScore>>=SCOREOFFSET;
jpayne@68: 
jpayne@68: //		System.err.println("Returning "+rows+", "+maxCol+", "+maxState+", "+maxScore+"; minScore="+minScore);
jpayne@68: 		return maxScore<minScore ? null : new int[] {rows, maxCol, maxState, maxScore, maxStart};
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	/** Generates the match string */
jpayne@68: 	public final byte[] traceback(int refStartLoc, int refEndLoc, int row, int col, int state){
jpayne@68: //		assert(false);
jpayne@68: 		assert(refStartLoc<=refEndLoc) : refStartLoc+", "+refEndLoc;
jpayne@68: 		assert(row==rows);
jpayne@68: 		
jpayne@68: 		byte[] out=new byte[row+col-1]; //TODO if an out of bound crash occurs, try removing the "-1".
jpayne@68: 		int outPos=0;
jpayne@68: 
jpayne@68: //		assert(state==(packed[row][col]&MODEMASK));
jpayne@68: 		
jpayne@68: 		while(row>0 && col>0){
jpayne@68: 			state=(packed[row][col]&MODEMASK);
jpayne@68: 			if(state==MODE_MATCH){
jpayne@68: 				col--;
jpayne@68: 				row--;
jpayne@68: 				out[outPos]='m';
jpayne@68: 			}else if(state==MODE_SUB){
jpayne@68: 				col--;
jpayne@68: 				row--;
jpayne@68: 				out[outPos]='S';
jpayne@68: 			}else if(state==MODE_DEL){
jpayne@68: 				col--;
jpayne@68: 				out[outPos]='D';
jpayne@68: 			}else if(state==MODE_INS){
jpayne@68: 				row--;
jpayne@68: 				out[outPos]='I';
jpayne@68: 			}else{
jpayne@68: 				assert(false) : state;
jpayne@68: 			}
jpayne@68: 			outPos++;
jpayne@68: 		}
jpayne@68: 		
jpayne@68: 		assert(row==0 || col==0);
jpayne@68: 		if(col!=row){
jpayne@68: 			while(row>0){
jpayne@68: 				out[outPos]='X';
jpayne@68: 				outPos++;
jpayne@68: 				row--;
jpayne@68: 				col--;
jpayne@68: 			}
jpayne@68: 			if(col>0){
jpayne@68: 				//do nothing
jpayne@68: 			}
jpayne@68: 		}
jpayne@68: 		
jpayne@68: 		//Shrink and reverse the string
jpayne@68: 		byte[] out2=new byte[outPos];
jpayne@68: 		for(int i=0; i<outPos; i++){
jpayne@68: 			out2[i]=out[outPos-i-1];
jpayne@68: 		}
jpayne@68: 		out=null;
jpayne@68: 		
jpayne@68: 		return out2;
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	/** @return {score, bestRefStart, bestRefStop} */
jpayne@68: 	public final int[] score(final byte[] read, final byte[] ref, final int refStartLoc, final int refEndLoc,
jpayne@68: 			final int maxRow, final int maxCol, final int maxState/*, final int maxScore, final int maxStart*/){
jpayne@68: 		
jpayne@68: 		int row=maxRow;
jpayne@68: 		int col=maxCol;
jpayne@68: 		int state=maxState;
jpayne@68: 
jpayne@68: 		assert(maxState>=0 && maxState<packed.length) :
jpayne@68: 			maxState+", "+maxRow+", "+maxCol+"\n"+new String(read)+"\n"+toString(ref, refStartLoc, refEndLoc);
jpayne@68: 		assert(maxRow>=0 && maxRow<packed.length) :
jpayne@68: 			maxState+", "+maxRow+", "+maxCol+"\n"+new String(read)+"\n"+toString(ref, refStartLoc, refEndLoc);
jpayne@68: 		assert(maxCol>=0 && maxCol<packed[0].length) :
jpayne@68: 			maxState+", "+maxRow+", "+maxCol+"\n"+new String(read)+"\n"+toString(ref, refStartLoc, refEndLoc);
jpayne@68: 		
jpayne@68: 		int score=packed[maxRow][maxCol]&SCOREMASK; //Or zero, if it is to be recalculated
jpayne@68: 		
jpayne@68: 		if(row<rows){
jpayne@68: 			int difR=rows-row;
jpayne@68: 			int difC=columns-col;
jpayne@68: 			
jpayne@68: 			while(difR>difC){
jpayne@68: 				score+=POINTSoff_NOREF;
jpayne@68: 				difR--;
jpayne@68: 			}
jpayne@68: 			
jpayne@68: 			row+=difR;
jpayne@68: 			col+=difR;
jpayne@68: 			
jpayne@68: 		}
jpayne@68: 		
jpayne@68: 		assert(refStartLoc<=refEndLoc);
jpayne@68: 		assert(row==rows);
jpayne@68: 
jpayne@68: 		
jpayne@68: 		final int bestRefStop=refStartLoc+col-1;
jpayne@68: 		
jpayne@68: 		while(row>0 && col>0){
jpayne@68: 			state=(packed[row][col]&MODEMASK);
jpayne@68: 			if(state==MODE_MATCH){
jpayne@68: 				col--;
jpayne@68: 				row--;
jpayne@68: 			}else if(state==MODE_SUB){
jpayne@68: 				col--;
jpayne@68: 				row--;
jpayne@68: 			}else if(state==MODE_DEL){
jpayne@68: 				col--;
jpayne@68: 			}else if(state==MODE_INS){
jpayne@68: 				row--;
jpayne@68: 			}else{
jpayne@68: 				assert(false) : state;
jpayne@68: 			}
jpayne@68: 		}
jpayne@68: //		assert(false) : row+", "+col;
jpayne@68: 		if(row>col){
jpayne@68: 			col-=row;
jpayne@68: 		}
jpayne@68: 		
jpayne@68: 		final int bestRefStart=refStartLoc+col;
jpayne@68: 		
jpayne@68: 		score>>=SCOREOFFSET;
jpayne@68: //		System.err.println("t2\t"+score+", "+maxScore+", "+maxStart+", "+bestRefStart);
jpayne@68: 		int[] rvec;
jpayne@68: 		if(bestRefStart<refStartLoc || bestRefStop>refEndLoc){ //Suggest extra padding in cases of overflow
jpayne@68: 			int padLeft=Tools.max(0, refStartLoc-bestRefStart);
jpayne@68: 			int padRight=Tools.max(0, bestRefStop-refEndLoc);
jpayne@68: 			rvec=new int[] {score, bestRefStart, bestRefStop, padLeft, padRight};
jpayne@68: 		}else{
jpayne@68: 			rvec=new int[] {score, bestRefStart, bestRefStop};
jpayne@68: 		}
jpayne@68: 		return rvec;
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	/** Will not fill areas that cannot match minScore.
jpayne@68: 	 * @return {score, bestRefStart, bestRefStop}  */
jpayne@68: 	public final int[] fillAndScoreLimited(byte[] read, byte[] ref, int refStartLoc, int refEndLoc, int minScore){
jpayne@68: 		int a=Tools.max(0, refStartLoc);
jpayne@68: 		int b=Tools.min(ref.length-1, refEndLoc);
jpayne@68: 		assert(b>=a);
jpayne@68: 		
jpayne@68: 		if(b-a>=maxColumns){
jpayne@68: 			System.err.println("Warning: Max alignment columns exceeded; restricting range. "+(b-a+1)+" > "+maxColumns);
jpayne@68: 			assert(false) : refStartLoc+", "+refEndLoc;
jpayne@68: 			b=Tools.min(ref.length-1, a+maxColumns-1);
jpayne@68: 		}
jpayne@68: 		int[] max=fillLimited(read, ref, a, b, minScore);
jpayne@68: //		return max==null ? null : new int[] {max[3], 0, max[1]};
jpayne@68: 		
jpayne@68: 		int[] score=(max==null ? null : score(read, ref, a, b, max[0], max[1], max[2]/*, max[3], max[4]*/));
jpayne@68: 		
jpayne@68: 		return score;
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	public static final String toString(byte[] ref, int startLoc, int stopLoc){
jpayne@68: 		StringBuilder sb=new StringBuilder(stopLoc-startLoc+1);
jpayne@68: 		for(int i=startLoc; i<=stopLoc; i++){sb.append((char)ref[i]);}
jpayne@68: 		return sb.toString();
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	public static int calcDelScore(int len){
jpayne@68: 		if(len<=0){return 0;}
jpayne@68: 		int score=POINTS_DEL;
jpayne@68: 		if(len>1){
jpayne@68: 			score+=(len-1)*POINTS_DEL2;
jpayne@68: 		}
jpayne@68: 		return score;
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	private static int calcDelScoreOffset(int len){
jpayne@68: 		if(len<=0){return 0;}
jpayne@68: 		int score=POINTSoff_DEL;
jpayne@68: 		if(len>1){
jpayne@68: 			score+=(len-1)*POINTSoff_DEL2;
jpayne@68: 		}
jpayne@68: 		return score;
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	public static int calcInsScore(int len){
jpayne@68: 		if(len<=0){return 0;}
jpayne@68: 		int score=POINTS_INS;
jpayne@68: 		
jpayne@68: 		if(len>1){
jpayne@68: 			score+=(len-1)*POINTS_INS2;
jpayne@68: 		}
jpayne@68: 		return score;
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	private static int calcInsScoreOffset(int len){
jpayne@68: 		if(len<=0){return 0;}
jpayne@68: 		int score=POINTSoff_INS;
jpayne@68: 		
jpayne@68: 		if(len>1){
jpayne@68: 			score+=(len-1)*POINTSoff_INS2;
jpayne@68: 		}
jpayne@68: 		return score;
jpayne@68: 	}
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	private final int maxRows;
jpayne@68: 	public final int maxColumns;
jpayne@68: 
jpayne@68: 	private final int[][] packed;
jpayne@68: 
jpayne@68: 	private final int[] vertLimit;
jpayne@68: 	private final int[] horizLimit;
jpayne@68: 
jpayne@68: 	private final int[] insScoreArray;
jpayne@68: 	private final int[] delScoreArray;
jpayne@68: 	private final int[] matchScoreArray;
jpayne@68: 	private final int[] subScoreArray;
jpayne@68: 
jpayne@68: 	public static final int MODEBITS=3;
jpayne@68: 	public static final int STARTBITS=9;
jpayne@68: 	public static final int LOWBITS=MODEBITS+STARTBITS;
jpayne@68: 	public static final int SCOREBITS=32-STARTBITS;
jpayne@68: 	public static final int MAX_START=((1<<STARTBITS)-1);
jpayne@68: 	public static final int MAX_SCORE=((1<<(SCOREBITS-1))-1)-2000;
jpayne@68: 	public static final int MIN_SCORE=0-MAX_SCORE; //Keeps it 1 point above "BAD".
jpayne@68: 
jpayne@68: //	public static final int MODEOFFSET=0; //Always zero.
jpayne@68: 	public static final int STARTOFFSET=MODEBITS;
jpayne@68: 	public static final int SCOREOFFSET=LOWBITS;
jpayne@68: 
jpayne@68: 	public static final int MODEMASK=~((-1)<<MODEBITS);
jpayne@68: 	public static final int STARTMASK=(~((-1)<<STARTBITS))<<STARTOFFSET;
jpayne@68: 	public static final int SCOREMASK=(~((-1)<<SCOREBITS))<<SCOREOFFSET;
jpayne@68: 	public static final int HIGHMASK=SCOREMASK|STARTMASK;
jpayne@68: 
jpayne@68: 	//For some reason changing MODE_DEL from 1 to 0 breaks everything
jpayne@68: 	private static final byte MODE_DEL=1;
jpayne@68: 	private static final byte MODE_INS=2;
jpayne@68: 	private static final byte MODE_SUB=3;
jpayne@68: 	private static final byte MODE_MATCH=4;
jpayne@68: 	
jpayne@68: 	public static final int POINTS_NOREF=-10;
jpayne@68: 	public static final int POINTS_MATCH=90;
jpayne@68: 	public static final int POINTS_MATCH2=100; //Note:  Changing to 90 substantially reduces false positives
jpayne@68: 	public static final int POINTS_SUB=-143;
jpayne@68: 	public static final int POINTS_SUB2=-54;
jpayne@68: 	public static final int POINTS_INS=-207;
jpayne@68: 	public static final int POINTS_INS2=-51;
jpayne@68: 	public static final int POINTS_INS3=-37;
jpayne@68: 	public static final int POINTS_DEL=-273;
jpayne@68: 	public static final int POINTS_DEL2=-38;
jpayne@68: 	
jpayne@68: 	
jpayne@68: //	public static final int POINTS_NOREF=-10;
jpayne@68: //	public static final int POINTS_NOCALL=-10;
jpayne@68: //	public static final int POINTS_MATCH=90;
jpayne@68: //	public static final int POINTS_MATCH2=100; //Note:  Changing to 90 substantially reduces false positives
jpayne@68: //	public static final int POINTS_SUB=-143;
jpayne@68: //	public static final int POINTS_SUB2=-54;
jpayne@68: //	public static final int POINTS_INS=-207;
jpayne@68: //	public static final int POINTS_INS2=-51;
jpayne@68: //	public static final int POINTS_INS3=-37;
jpayne@68: //	public static final int POINTS_DEL=-273;
jpayne@68: //	public static final int POINTS_DEL2=-38;
jpayne@68: 	
jpayne@68: 	public static final int BAD=MIN_SCORE-1;
jpayne@68: 	
jpayne@68: 	
jpayne@68: 	public static final int POINTSoff_NOREF=(POINTS_NOREF<<SCOREOFFSET);
jpayne@68: 	public static final int POINTSoff_NOREF_MODE_SUB=POINTSoff_NOREF|MODE_SUB;
jpayne@68: 	public static final int POINTSoff_MATCH=(POINTS_MATCH<<SCOREOFFSET);
jpayne@68: 	public static final int POINTSoff_MATCH2=(POINTS_MATCH2<<SCOREOFFSET);
jpayne@68: 	public static final int POINTSoff_SUB=(POINTS_SUB<<SCOREOFFSET);
jpayne@68: 	public static final int POINTSoff_SUB2=(POINTS_SUB2<<SCOREOFFSET);
jpayne@68: 	public static final int POINTSoff_INS=(POINTS_INS<<SCOREOFFSET);
jpayne@68: 	public static final int POINTSoff_INS2=(POINTS_INS2<<SCOREOFFSET);
jpayne@68: 	public static final int POINTSoff_DEL=(POINTS_DEL<<SCOREOFFSET);
jpayne@68: 	public static final int POINTSoff_DEL2=(POINTS_DEL2<<SCOREOFFSET);
jpayne@68: 	public static final int BADoff=(BAD<<SCOREOFFSET);
jpayne@68: 	public static final int MAXoff_SCORE=MAX_SCORE<<SCOREOFFSET;
jpayne@68: 	public static final int MINoff_SCORE=MIN_SCORE<<SCOREOFFSET;
jpayne@68: 	
jpayne@68: 	private int rows;
jpayne@68: 	private int columns;
jpayne@68: 
jpayne@68: 	public long iterationsLimited=0;
jpayne@68: 	public long iterationsUnlimited=0;
jpayne@68: 
jpayne@68: 	public boolean verbose=false;
jpayne@68: 	public boolean verbose2=false;
jpayne@68: 	
jpayne@68: }