Package bgu.bio.algorithms.graphs.hsa

Examples of bgu.bio.algorithms.graphs.hsa.HSA

37
38
39
40
41
42
43
44
45
46
47
48
49
    };

    TIntArrayList[] alignment = new TIntArrayList[3];

    UnorderedMatcherFactory matcherFactory = new UnorderedMatcherFactory();
    HSA hsa = new HSA(w, matcherFactory,false);

    System.out.println("Cost t-s: " + hsa.computeHSA(t, s, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
   
   
    double ans1 = 0,ans2 = 0;
   
    //reuse
    HSA hsaEngine2 = new HSA(1, 1, cost, new UnorderedMatcherFactory(),
        true);
    double temp = hsaEngine2.computeHSA(t, s);
    ans1 = hsaEngine2.computeHSA(t, sR);
   
    //no reuse
    hsaEngine2 = new HSA(1, 1, cost, new UnorderedMatcherFactory(),
        true);
   
    temp = hsaEngine2.computeHSA(t, s);
    hsaEngine2.setFactory(new UnorderedMatcherFactory());
    ans2 = hsaEngine2.computeHSA(t, sR);
    if (!MathOperations.equals(ans1, ans2)){
      System.out.println("Got problem with matchers");
    }
  }
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
    };

    TIntArrayList[] alignment = new TIntArrayList[3];

    UnorderedMatcherFactory matcherFactory = new UnorderedMatcherFactory();
    HSA hsa = new HSA(w, matcherFactory);

    System.out.println("Cost t-s: " + hsa.computeHSA(t, s, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    System.out.println("\nCost s-t: " + hsa.computeHSA(s, t, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    System.out.println("\nCost t-t: " + hsa.computeHSA(t, t, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    System.out.println("\nCost s-s: " + hsa.computeHSA(s, s, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    long start = System.currentTimeMillis();
    int iters = 10000;
    for (int i = 0; i < iters; ++i) {
      hsa.computeHSA(t, s);
    }
    System.out.println("\nTime of " + iters + " iterations for t-s: "
        + (System.currentTimeMillis() - start));

    start = System.currentTimeMillis();
    for (int i = 0; i < iters; ++i) {
      hsa.computeHSA(s, t);
    }
    System.out.println("\nTime of " + iters + " iterations for s-t: "
        + (System.currentTimeMillis() - start));

    start = System.currentTimeMillis();
    for (int i = 0; i < iters; ++i) {
      hsa.computeHSA(t, t);
    }
    System.out.println("\nTime of " + iters + " iterations for t-t: "
        + (System.currentTimeMillis() - start));

    start = System.currentTimeMillis();
    for (int i = 0; i < iters; ++i) {
      hsa.computeHSA(s, s);
    }
    System.out.println("\nTime of " + iters + " iterations for s-s: "
        + (System.currentTimeMillis() - start));

    String flowType;
View Full Code Here
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
  }

  private static void checkTrees(Tree t, CostFunction w, Tree s) {
    TIntArrayList[] alignment = new TIntArrayList[3];
    MatcherFactory matcherFactory = new UnorderedMatcherFactory();
    HSA hsa = new HSA(w, matcherFactory);

    double cost = hsa.computeHSA(t, s, alignment);
    System.out.println("Cost: " + cost);
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }
    System.out.println();

    // checking for pooling problems:
    double currCost;
    int i = 0;
    int iters = 0;
    for (; i < iters; ++i) {
      hsa = new HSA(w, matcherFactory);

      currCost = hsa.computeHSA(t, s);
      if (!MathOperations.equals(cost, currCost)) {
        System.err.println("Different costs at repeated runs: " + cost
            + ", " + currCost);
        break;
      }
    }
    if (i == iters) {
      System.out.println("Repeated runs OK.");
    }

    // checking for symmetry problems:

    alignment = new TIntArrayList[3];
    currCost = hsa.computeHSA(s, t, alignment);
    System.out.println("Cost: " + cost);
    for (int j = 0; j < alignment[0].size(); ++j) {
      System.out.print("(" + alignment[0].get(j) + ","
          + alignment[1].get(j) + "), ");
    }
    System.out.println();

    // checking for pooling problems:
    i = 0;
    for (; i < iters; ++i) {
      hsa = new HSA(w, matcherFactory);

      currCost = hsa.computeHSA(s, t);
      if (!MathOperations.equals(cost, currCost)) {
        System.err.println("Different costs at repeated runs: " + cost
            + ", " + currCost);
        break;
      }
View Full Code Here
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
    smooth.calculateCost(s);

    TIntArrayList[] alignment = new TIntArrayList[3];
    MatcherFactory matcherFactory = new UnorderedMatcherFactory();
    // MatcherFactory matcherFactory = new OrderedMatcherFactory();
    HSA hsa = new HSA(cost, matcherFactory);

    System.out.println("Cost: " + hsa.computeHSA(s, t, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    // System.out.println("\nCost: " + hsa.computeHSA(s, t,alignment));

    System.out.println("\nCost: " + hsa.computeHSA(t, s, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    long start = System.currentTimeMillis();
    int iters = 30;
    for (int i = 0; i < iters; ++i) {
      hsa.computeHSA(t, s);
    }
    System.out.println("\nTime of " + iters + " iterations: "
        + (System.currentTimeMillis() - start));
    String flowType;
//    if (matcherFactory.make(3, 3) instanceof UnorderedBipartiteCavityMatcherMinCostMaxFlow) {
View Full Code Here
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
  }

  private static void checkTrees(Tree t, CostFunction w, Tree s) {
    TIntArrayList[] alignment = new TIntArrayList[3];
    MatcherFactory matcherFactory = new UnorderedMatcherFactory();
    HSA hsa = new HSA(w, matcherFactory);

    double cost = hsa.computeHSA(t, s, alignment);
    System.out.println("Cost: " + cost);
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }
    System.out.println();

    // checking for pooling problems:
    double currCost;
    int i = 0;
    int iters = 0;
    for (; i < iters; ++i) {
      hsa = new HSA(w, matcherFactory);

      currCost = hsa.computeHSA(t, s);
      if (!MathOperations.equals(cost, currCost)) {
        System.err.println("Different costs at repeated runs: " + cost
            + ", " + currCost);
        break;
      }
    }
    if (i == iters) {
      System.out.println("Repeated runs OK.");
    }

    // checking for symmetry problems:

    alignment = new TIntArrayList[3];
    currCost = hsa.computeHSA(s, t, alignment);
    System.out.println("Cost: " + cost);
    for (int j = 0; j < alignment[0].size(); ++j) {
      System.out.print("(" + alignment[0].get(j) + ","
          + alignment[1].get(j) + "), ");
    }
    System.out.println();

    // checking for pooling problems:
    i = 0;
    for (; i < iters; ++i) {
      hsa = new HSA(w, matcherFactory);

      currCost = hsa.computeHSA(s, t);
      if (!MathOperations.equals(cost, currCost)) {
        System.err.println("Different costs at repeated runs: " + cost
            + ", " + currCost);
        break;
      }
View Full Code Here
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
    smooth.calculateCost(s);

    TIntArrayList[] alignment = new TIntArrayList[3];
    MatcherFactory matcherFactory = new UnorderedMatcherFactory();
    // MatcherFactory matcherFactory = new OrderedMatcherFactory();
    HSA hsa = new HSA(cost, matcherFactory);

    System.out.println("Cost: " + hsa.computeHSA(s, t, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    // System.out.println("\nCost: " + hsa.computeHSA(s, t,alignment));

    System.out.println("\nCost: " + hsa.computeHSA(t, s, alignment));
    for (int i = 0; i < alignment[0].size(); ++i) {
      System.out.print("(" + alignment[0].get(i) + ","
          + alignment[1].get(i) + "), ");
    }

    long start = System.currentTimeMillis();
    int iters = 30;
    for (int i = 0; i < iters; ++i) {
      hsa.computeHSA(t, s);
    }
    System.out.println("\nTime of " + iters + " iterations: "
        + (System.currentTimeMillis() - start));
    String flowType;
    // if (matcherFactory.make(3, 3) instanceof
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
    smooth.calculateCost(sR);

    double ans1 = 0, ans2 = 0;

    // reuse
    HSA hsaEngine2 = new HSA(1, 1, cost, new UnorderedMatcherFactory(),
        true);
    hsaEngine2.computeHSA(t, s);
    ans1 = hsaEngine2.computeHSA(t, sR);

    // no reuse
    hsaEngine2 = new HSA(1, 1, cost, new UnorderedMatcherFactory(), true);

    hsaEngine2.computeHSA(t, s);
    hsaEngine2.setFactory(new UnorderedMatcherFactory());
    ans2 = hsaEngine2.computeHSA(t, sR);
    Assert.assertEquals("Got a problem with the matchers", true,
        MathOperations.equals(ans1, ans2));
  }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
    smooth.calculateCost(s);

    double ans1 = 0, ans2 = 0;

    // reuse
    HSA hsaEngine = new HSA(1, 1, cost, new OrderedMatcherFactory(), true);

    pruneRooted.calculateCost(t);
    pruneRooted.calculateCost(s);
    ans1 = hsaEngine.computeHSA(t, s);

    pruneUnrooted.calculateCost(t);
    pruneUnrooted.calculateCost(s);
    TIntArrayList[] tb = new TIntArrayList[3];
    ans2 = hsaEngine.computeHSA(t, s, tb);
    for (int i = 0; i < tb[0].size(); i++) {
      System.out.println(tb[0].getQuick(i) + " -> " + tb[1].getQuick(i));
    }
    Assert.assertEquals("Should be unrooted alignment", false,
        MathOperations.equals(ans1, ans2));
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
    }
 
    double ans1 = 0, ans2 = 0;

    // reuse
    HSA hsaEngine2 = new HSA(1, 1, cost, new OrderedMatcherFactory(),
        true);
    TIntArrayList[] trace = new TIntArrayList[3];
    ans1 = hsaEngine2.computeHSA(t, t, trace);

    Assert.assertEquals("trace should be the same", trace[0], trace[1]);
    ans2 = hsaEngine2.computeHSA(t, trace);
   
    System.out.println(ans1);
    System.out.println(ans2);

    Assert.assertEquals(
View Full Code Here
TOP

Related Classes of bgu.bio.algorithms.graphs.hsa.HSA

  • bgu.bio.algorithms.graphs.hsa.matchers.BipartiteCavityMatcher
  • bgu.bio.algorithms.graphs.Test
  • bgu.bio.algorithms.graphs.TestHSA
  • bgu.bio.algorithms.graphs.TestHSAOnInteger
  • gnu.trove.list.array.TIntArrayList
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.