X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Futil%2FComparison.java;h=d4fc233b901a57835f85c8a3705bb797072fa254;hb=ce039b3f8a0b9a3a266838082a678821507ddcc3;hp=22e1ab7b39d3070c163f3bcd4dbcfb9b6d1e40f5;hpb=136c0793b90b72b928c4d77dc109dd5c644e00d3;p=jalview.git diff --git a/src/jalview/util/Comparison.java b/src/jalview/util/Comparison.java index 22e1ab7..d4fc233 100644 --- a/src/jalview/util/Comparison.java +++ b/src/jalview/util/Comparison.java @@ -40,8 +40,9 @@ public class Comparison public static final char GAP_DASH = '-'; - public static final String GapChars = new String(new char[] { GAP_SPACE, - GAP_DOT, GAP_DASH }); + public static final String GapChars = new String( + new char[] + { GAP_SPACE, GAP_DOT, GAP_DASH }); /** * DOCUMENT ME! @@ -71,7 +72,8 @@ public class Comparison * int * @return float */ - public static float compare(SequenceI ii, SequenceI jj, int start, int end) + public static float compare(SequenceI ii, SequenceI jj, int start, + int end) { String si = ii.getSequenceAsString(); String sj = jj.getSequenceAsString(); @@ -97,8 +99,8 @@ public class Comparison { for (int j = 0; j < jlen; j++) { - if (si.substring(start + j, start + j + 1).equals( - sj.substring(start + j, start + j + 1))) + if (si.substring(start + j, start + j + 1) + .equals(sj.substring(start + j, start + j + 1))) { match++; } @@ -112,8 +114,8 @@ public class Comparison { for (int j = 0; j < jlen; j++) { - if (si.substring(start + j, start + j + 1).equals( - sj.substring(start + j, start + j + 1))) + if (si.substring(start + j, start + j + 1) + .equals(sj.substring(start + j, start + j + 1))) { match++; } @@ -150,7 +152,8 @@ public class Comparison * @deprecated use PIDModel.computePID() */ @Deprecated - public final static float PID(String seq1, String seq2, int start, int end) + public final static float PID(String seq1, String seq2, int start, + int end) { return PID(seq1, seq2, start, end, true, false); } @@ -282,35 +285,10 @@ public class Comparison { return false; } - char[][] letters = new char[seqs.length][]; - for (int i = 0; i < seqs.length; i++) - { - if (seqs[i] != null) - { - char[] sequence = seqs[i].getSequence(); - if (sequence != null) - { - letters[i] = sequence; - } - } - } - - return areNucleotide(letters); - } - /** - * Answers true if more than 85% of the sequence residues (ignoring gaps) are - * A, G, C, T or U, else false. This is just a heuristic guess and may give a - * wrong answer (as AGCT are also amino acid codes). - * - * @param letters - * @return - */ - static final boolean areNucleotide(char[][] letters) - { int ntCount = 0; int aaCount = 0; - for (char[] seq : letters) + for (SequenceI seq : seqs) { if (seq == null) { @@ -318,8 +296,10 @@ public class Comparison } // TODO could possibly make an informed guess just from the first sequence // to save a lengthy calculation - for (char c : seq) + int len = seq.getLength(); + for (int i = 0; i < len; i++) { + char c = seq.getCharAt(i); if (isNucleotide(c)) { ntCount++; @@ -419,8 +399,8 @@ public class Comparison flattened.add(s); } } - final SequenceI[] oneDArray = flattened.toArray(new SequenceI[flattened - .size()]); + final SequenceI[] oneDArray = flattened + .toArray(new SequenceI[flattened.size()]); return isNucleotide(oneDArray); }