public void run() {
Node root = new Node(new Tetranucleotide("AAAA"));
long pick;
String time;
int cores = Runtime.getRuntime().availableProcessors();
// System.out.println("Votre machine a " + cores + " cpu(s).");
// System.out.println("Un même nombre de threads vas être utilisé pour être optimal.\n");
System.out.println("l\ttime\t\tresult");
System.out.println("");
// Calculate A (l = 1)
pick = System.currentTimeMillis();
for (Tetranucleotide key : this.dicoS12.keySet()) root.addA(key, null);
Case caseA = new Case(root.getASon(), Case.TypeCase.ABorder);
time = getInterval(pick, System.currentTimeMillis());
System.out.println(1 + "\t" + time + "\t" + caseA.count());
// Calculate B and A2 (l = 2)
pick = System.currentTimeMillis();
Graph g;
for (Tetranucleotide key : this.dicoS114.keySet()) {
g = Graph.createGraph(new Node(null, key));
if (g.isCircular()) root.addB(key, null);
}
Case caseB = new Case(root.getBSon(), Case.TypeCase.BBorder);
Case caseA2 = caseA.addEnsemble(Algorithm_tree.dicoS12, Case.TypeCase.ABorder);
time = getInterval(pick, System.currentTimeMillis());
System.out.println(2 + "\t" + time + "\t" + (caseA2.count() + caseB.count()));
// Calculate l = i until i == limit
Diagonal buffer = new Diagonal();
Diagonal bufferTemp;
buffer.add(caseB);
buffer.add(caseA2);
int limit = 5;
for (int i = 2; i < limit; i++) {
pick = System.currentTimeMillis();
bufferTemp = buffer.compute();
time = getInterval(pick, System.currentTimeMillis());
System.out.println(buffer.id + "\t" + time + "\t" + buffer.nbCIrcular);
buffer = bufferTemp;
}
}
