2 |
26 Feb 07 |
jari |
1 |
/* |
2 |
26 Feb 07 |
jari |
Copyright @ 1999-2005, The Institute for Genomic Research (TIGR). |
2 |
26 Feb 07 |
jari |
All rights reserved. |
2 |
26 Feb 07 |
jari |
4 |
*/ |
2 |
26 Feb 07 |
jari |
5 |
/* |
2 |
26 Feb 07 |
jari |
* $RCSfile: Alphabet.java,v $ |
2 |
26 Feb 07 |
jari |
* $Revision: 1.3 $ |
2 |
26 Feb 07 |
jari |
* $Date: 2005/03/10 15:40:35 $ |
2 |
26 Feb 07 |
jari |
* $Author: braistedj $ |
2 |
26 Feb 07 |
jari |
* $State: Exp $ |
2 |
26 Feb 07 |
jari |
11 |
*/ |
2 |
26 Feb 07 |
jari |
12 |
package org.tigr.microarray.mev.motif; |
2 |
26 Feb 07 |
jari |
13 |
|
2 |
26 Feb 07 |
jari |
14 |
public class Alphabet { |
2 |
26 Feb 07 |
jari |
15 |
public int n; /* number of LETTERS */ |
2 |
26 Feb 07 |
jari |
16 |
private String alphabet; /* ALPHABET */ |
2 |
26 Feb 07 |
jari |
17 |
public String code2let; /* CODE2LETTER */ |
2 |
26 Feb 07 |
jari |
18 |
public String code2lower; /* CODE2LETTER lower case */ |
2 |
26 Feb 07 |
jari |
19 |
public char[] let2code; /* LETTER2CODE */ |
2 |
26 Feb 07 |
jari |
20 |
private String C; /* complementary bases */ |
2 |
26 Feb 07 |
jari |
21 |
private String prs; /* pairs string */ |
2 |
26 Feb 07 |
jari |
22 |
private char[][] R; /* relatedness scoring matrix */ |
2 |
26 Feb 07 |
jari |
23 |
private char[][] pairs; /* residue pairs */ |
2 |
26 Feb 07 |
jari |
24 |
private long loR; /* lowest value in R */ |
2 |
26 Feb 07 |
jari |
25 |
private long hiR; /* highest value in R */ |
2 |
26 Feb 07 |
jari |
26 |
private long npairs; /* number of pairs */ |
2 |
26 Feb 07 |
jari |
27 |
private boolean[] paired; /* is residue r paired? */ |
2 |
26 Feb 07 |
jari |
28 |
private int ALPHA_NUM_SYMBOLS=127; |
2 |
26 Feb 07 |
jari |
29 |
|
2 |
26 Feb 07 |
jari |
30 |
public Alphabet(String Letters, char[] R) { |
2 |
26 Feb 07 |
jari |
31 |
int i; |
2 |
26 Feb 07 |
jari |
32 |
char c; |
2 |
26 Feb 07 |
jari |
33 |
this.n = Letters.length(); |
2 |
26 Feb 07 |
jari |
34 |
this.alphabet=new String(Letters); /* ALPHABET */ |
2 |
26 Feb 07 |
jari |
35 |
this.code2let=new String(Letters); /* CODE2LETTER */ |
2 |
26 Feb 07 |
jari |
36 |
this.code2lower=new String(Letters); /* LETTER2CODE */ |
2 |
26 Feb 07 |
jari |
37 |
this.let2code=new char[ALPHA_NUM_SYMBOLS]; |
2 |
26 Feb 07 |
jari |
38 |
for (i=0; i<ALPHA_NUM_SYMBOLS; i++) { |
2 |
26 Feb 07 |
jari |
39 |
let2code[i]=0; /* =error */ |
2 |
26 Feb 07 |
jari |
40 |
} |
2 |
26 Feb 07 |
jari |
41 |
for (i=0; i<this.n; i++) { |
2 |
26 Feb 07 |
jari |
42 |
c = Letters.charAt(i); |
2 |
26 Feb 07 |
jari |
43 |
this.let2code[c] = (char)i; |
2 |
26 Feb 07 |
jari |
44 |
} |
2 |
26 Feb 07 |
jari |
45 |
if (R==null) { /* RELATION */ |
2 |
26 Feb 07 |
jari |
46 |
this.R = null; |
2 |
26 Feb 07 |
jari |
47 |
} |
2 |
26 Feb 07 |
jari |
48 |
this.paired=new boolean[this.n+1]; |
2 |
26 Feb 07 |
jari |
49 |
for (i=0; i<=this.n; i++) { |
2 |
26 Feb 07 |
jari |
50 |
this.paired[i]=false; |
2 |
26 Feb 07 |
jari |
51 |
} |
2 |
26 Feb 07 |
jari |
52 |
this.pairs = null; |
2 |
26 Feb 07 |
jari |
53 |
this.prs = null; |
2 |
26 Feb 07 |
jari |
54 |
this.C = null; |
2 |
26 Feb 07 |
jari |
55 |
} |
2 |
26 Feb 07 |
jari |
56 |
} |