* symbols. Instances of this class are immutable and thread-safe, so the same
* object is returned from calls to getInstance().
*/
-public class ScoreMatrix extends SimilarityScoreModel implements
- PairwiseScoreModelI
+public class ScoreMatrix extends SimilarityScoreModel
+ implements PairwiseScoreModelI
{
private static final char GAP_CHARACTER = Comparison.GAP_DASH;
private float minValue;
private float maxValue;
-
+
+ private boolean symmetric;
+
/**
* Constructor given a name, symbol alphabet, and matrix of scores for pairs
* of symbols. The matrix should be square and of the same size as the
* @param values
* Pairwise scores indexed according to the symbol alphabet
*/
- public ScoreMatrix(String theName, String theDescription,
- char[] alphabet, float[][] values)
+ public ScoreMatrix(String theName, String theDescription, char[] alphabet,
+ float[][] values)
{
if (alphabet.length != values.length)
{
findMinMax();
+ symmetric = checkSymmetry();
+
/*
* crude heuristic for now...
*/
}
/**
+ * Answers true if the matrix is symmetric, else false. Usually, substitution
+ * matrices are symmetric, which allows calculations to be short cut.
+ *
+ * @return
+ */
+ private boolean checkSymmetry()
+ {
+ for (int i = 0; i < matrix.length; i++)
+ {
+ for (int j = i; j < matrix.length; j++)
+ {
+ if (matrix[i][j] != matrix[j][i])
+ {
+ return false;
+ }
+ }
+ }
+ return true;
+ }
+
+ /**
* Record the minimum and maximum score values
*/
protected void findMinMax()
* @param params
* @return
*/
- protected MatrixI findSimilarities(String[] seqs, SimilarityParamsI params)
+ protected MatrixI findSimilarities(String[] seqs,
+ SimilarityParamsI params)
{
- double[][] values = new double[seqs.length][];
+ double[][] values = new double[seqs.length][seqs.length];
for (int row = 0; row < seqs.length; row++)
{
- values[row] = new double[seqs.length];
- for (int col = 0; col < seqs.length; col++)
+ for (int col = symmetric ? row : 0; col < seqs.length; col++)
{
double total = computeSimilarity(seqs[row], seqs[col], params);
values[row][col] = total;
+ if (symmetric)
+ {
+ values[col][row] = total;
+ }
}
}
return new Matrix(values);
{
return this;
}
+
+ public boolean isSymmetric()
+ {
+ return symmetric;
+ }
}