/**
* Creates a new AlignSeq object.
*
- * @param s1 first sequence for alignment
- * @param s2 second sequence for alignment
- * @param type molecule type, either AlignSeq.PEP or AlignSeq.DNA
+ * @param s1
+ * first sequence for alignment
+ * @param s2
+ * second sequence for alignment
+ * @param type
+ * molecule type, either AlignSeq.PEP or AlignSeq.DNA
*/
public AlignSeq(SequenceI s1, SequenceI s2, String type)
{
SequenceI alSeq1 = new Sequence(s1.getName(), getAStr1());
alSeq1.setStart(s1.getStart() + getSeq1Start() - 1);
alSeq1.setEnd(s1.getStart() + getSeq1End() - 1);
- alSeq1.setDatasetSequence(s1.getDatasetSequence() == null ? s1 : s1
- .getDatasetSequence());
+ alSeq1.setDatasetSequence(
+ s1.getDatasetSequence() == null ? s1 : s1.getDatasetSequence());
return alSeq1;
}
SequenceI alSeq2 = new Sequence(s2.getName(), getAStr2());
alSeq2.setStart(s2.getStart() + getSeq2Start() - 1);
alSeq2.setEnd(s2.getStart() + getSeq2End() - 1);
- alSeq2.setDatasetSequence(s2.getDatasetSequence() == null ? s2 : s2
- .getDatasetSequence());
+ alSeq2.setDatasetSequence(
+ s2.getDatasetSequence() == null ? s2 : s2.getDatasetSequence());
return alSeq2;
}
if (s1str.length() == 0 || s2str.length() == 0)
{
- output.append("ALL GAPS: "
- + (s1str.length() == 0 ? s1.getName() : " ")
- + (s2str.length() == 0 ? s2.getName() : ""));
+ output.append(
+ "ALL GAPS: " + (s1str.length() == 0 ? s1.getName() : " ")
+ + (s2str.length() == 0 ? s2.getName() : ""));
return;
}
if (!PEP.equals(moleculeType) && !DNA.equals(moleculeType))
{
output.append("Wrong type = dna or pep only");
- throw new Error(MessageManager.formatMessage(
- "error.unknown_type_dna_or_pep",
- new String[] { moleculeType }));
+ throw new Error(MessageManager
+ .formatMessage("error.unknown_type_dna_or_pep", new String[]
+ { moleculeType }));
}
type = moleculeType;
- scoreMatrix = ScoreModels.getInstance().getDefaultModel(
- PEP.equals(type));
+ scoreMatrix = ScoreModels.getInstance()
+ .getDefaultModel(PEP.equals(type));
}
/**
float pairwiseScore = scoreMatrix.getPairwiseScore(s1str.charAt(i),
s2str.charAt(j));
- score[i][j] = max(score[i - 1][j - 1]
- + (pairwiseScore * 10), E[i][j], F[i][j]);
+ score[i][j] = max(score[i - 1][j - 1] + (pairwiseScore * 10),
+ E[i][j], F[i][j]);
traceback[i][j] = findTrace(i, j);
}
}
*/
public jalview.datamodel.Mapping getMappingFromS1(boolean allowmismatch)
{
- ArrayList<Integer> as1 = new ArrayList<Integer>(), as2 = new ArrayList<Integer>();
+ ArrayList<Integer> as1 = new ArrayList<Integer>(),
+ as2 = new ArrayList<Integer>();
int pdbpos = s2.getStart() + getSeq2Start() - 2;
int alignpos = s1.getStart() + getSeq1Start() - 2;
int lp2 = pdbpos - 3, lp1 = alignpos - 3;
}
// construct range pairs
- int[] mapseq1 = new int[as1.size() + (lastmatch ? 1 : 0)], mapseq2 = new int[as2
- .size() + (lastmatch ? 1 : 0)];
+ int[] mapseq1 = new int[as1.size() + (lastmatch ? 1 : 0)],
+ mapseq2 = new int[as2.size() + (lastmatch ? 1 : 0)];
int i = 0;
for (Integer ip : as1)
{
List<SequenceI> ochains, AlignmentI al, String dnaOrProtein,
boolean removeOldAnnots)
{
- List<SequenceI> orig = new ArrayList<SequenceI>(), repl = new ArrayList<SequenceI>();
+ List<SequenceI> orig = new ArrayList<SequenceI>(),
+ repl = new ArrayList<SequenceI>();
List<AlignSeq> aligs = new ArrayList<AlignSeq>();
if (al != null && al.getHeight() > 0)
{
SequenceI[] originalSequences, String[] omitHidden, int start,
int end, boolean ungapped)
{
+ return (float[]) computeRedundancyMatrixWithRep(originalSequences,
+ omitHidden, start, end, ungapped)[0];
+ }
+
+ public static Object[] computeRedundancyMatrixWithRep(
+ SequenceI[] originalSequences, String[] omitHidden, int start,
+ int end, boolean ungapped)
+ {
+
int height = originalSequences.length;
float[] redundancy = new float[height];
+ SequenceI[] rep = new SequenceI[height];
int[] lngth = new int[height];
for (int i = 0; i < height; i++)
{
// use real sequence length rather than string length
if (lngth[j] < lngth[i])
{
- redundancy[j] = Math.max(pid, redundancy[j]);
+ if (pid > redundancy[j])
+ {
+ rep[j] = originalSequences[i];
+ redundancy[j] = pid;
+ }
}
else
{
- redundancy[i] = Math.max(pid, redundancy[i]);
+ if (pid > redundancy[i])
+ {
+ rep[i] = originalSequences[j];
+ redundancy[i] = pid;
+ }
}
}
}
- return redundancy;
+ return new Object[] { redundancy, rep };
}
}