1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
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
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
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
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
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
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
use log::{info};
use std::process;
use crate::arena::ArenaTree;
use crate::arena::Event;
use crate::arena::PIPEBLOCK;
use crate::arena::{lca};
pub fn map_transfer(transfers: Vec<(String,String)> ,
parasite_tree: &mut ArenaTree<String>) -> Vec<(String,String)> {
let mut map_transfers = vec![];
for (start, end) in transfers {
let map_start = parasite_tree.get_index(start.to_string())
.expect("[map_transfer] unable to find start node");
let map_start = parasite_tree.arena[map_start].location.to_string();
let map_end = parasite_tree.get_index(end.to_string())
.expect("[map_transfer] unable to find end node");
let map_end = parasite_tree.arena[map_end].location.to_string();
map_transfers.push((map_start,map_end));
}
map_transfers
}
pub fn map_transfer_mul(transfers: Vec<(String,String)> ,
parasite_trees: &mut Vec<ArenaTree<String>>) -> Vec<(String,String)> {
let mut map_transfers = vec![];
let nb_par = parasite_trees.len();
let mut map_start: Result<usize, usize> = Err(0);
let mut map_end: Result<usize, usize> = Err(0);
for (start, end) in transfers {
let mut i = 0;
while i < nb_par {
map_start = parasite_trees[i].get_index(start.to_string());
match map_start {
Ok(_) => {
info!("[map_transfer_mul] Find transfert start in parasite tree {}",i);
break
},
Err(_e) => {},
}
i = i + 1;
};
info!("Map start {:?}",map_start);
let map_start = match map_start {
Ok(m) => m,
Err(_e) => panic!("Unable to find start of transfer"),
};
let map_start = parasite_trees[i].arena[map_start].location.to_string();
let mut i = 0;
while i < nb_par {
map_end = parasite_trees[i].get_index(end.to_string());
match map_end {
Ok(_) => {
info!("[map_transfer_mul] Find transfert end in parasite tree {}",i);
break
},
Err(_e) => {},
}
i = i + 1;
};
let map_end = match map_end {
Ok(m) => m,
Err(_e) => panic!("Unable to find end of transfer"),
};
let map_end = parasite_trees[i].arena[map_end].location.to_string();
map_transfers.push((map_start,map_end));
}
map_transfers
}
pub fn get_gtransfer(gene_tree: &mut ArenaTree<String>) -> Vec<(String,String)> {
let mut transfers = vec![];
for index in &gene_tree.arena {
if index.is_a_transfert {
let parent = index.parent;
let parent = match parent {
Some(p) => p,
None => panic!("[get_gtransfert] the node has no parent"),
};
let end = index.location.to_string();
let start = gene_tree.arena[parent].location.to_string();
transfers.push((start,end));
};
};
transfers
}
pub fn map_parasite_g2s(para_as_species: &mut ArenaTree<String>,para_as_gene: &mut ArenaTree<String>,) {
for index in &mut para_as_species.arena {
let name = &index.name;
let i = para_as_gene.get_index(name.to_string());
match i {
Ok(i) => {
let e = ¶_as_gene.arena[i].e;
info!("[map_parasite_g2s] Mapping of {} OK, event is {:?} (transfert: {})",name,e,¶_as_gene.arena[i].is_a_transfert);
index.is_a_transfert = para_as_gene.arena[i].is_a_transfert;
index.e = match e {
&Event::Duplication => Event::Duplication,
&Event::BranchingOut => Event::BranchingOut,
&Event::Speciation => Event::Speciation,
&Event::BifurcationOut => Event::BifurcationOut,
&Event::Loss => Event::Loss,
&Event::Leaf => Event::Leaf,
_ => {
eprintln!("Event {:?} not selected",e);
Event::Undef
},
};
},
Err(_err) => {
info!("map_parasite_g2s] Unable to map {}",name);
},
}
}
}
pub fn map_parasite_s2g(para_as_species: &mut ArenaTree<String>,
para_as_gene: &mut ArenaTree<String>,
gene_trees : &mut std::vec::Vec<ArenaTree<String>>) {
let mut virt_svg = 0;
for index in ¶_as_gene.arena {
let name = &index.name;
let i = para_as_species.get_index(name.to_string());
match i {
Ok(_i) => {
info!("[map_parasite_s2g] Mapping of {} OK",name);
},
Err(_err) => {
info!("[map_parasite_s2g] Unable to map {} {:?}, new node needed",name,&index.e);
info!("[map_parasite_s2g] Creation of new species node");
let p = &index.parent;
let p = match p {
Some(p) => p,
None => {
eprintln!("\n[map_parasite_s2g] ERROR:");
eprintln!("Unable to map the reconciled recGeneTree from '-f' file with the SpTree from '-g' file");
eprintln!("");
eprintln!("The following node in the 'path' reconciled tree was not found \
in the 'pipe' tree:\n{:?} ",index);
eprintln!("\nThis may happen when a loss is represented by \
'virtual' node in the reconciled tree, and the program will create \
a new node to deal with this. But the current missing node is a root \
it can not be a virtual node, so it seems it is actually not possible to map.");
process::exit(1);},
};
let parent_name = para_as_gene.arena[*p].name.clone();
info!("[map_parasite_s2g] parent of the node in the path parasite tree \
(i.e. recGeneTree from -f file) is {}({})",
p,parent_name);
let j = para_as_species.get_index(parent_name.to_string());
let j = match j {
Ok(j) => j,
Err(_e) =>
{
eprintln!("\n[map_parasite_s2g] ERROR:");
eprintln!("Unable to find {} in the pipe parasite tree \
(i.e. specTree from -g file)", parent_name);
process::exit(1);
},
};
info!("[map_parasite_s2g] Mapping of parent {} OK",parent_name);
info!("[map_parasite_s2g] Parents: {:?} <=> {:?}",para_as_species.arena[j],para_as_gene.arena[*p]);
info!("[map_parasite_s2g] Event of the current path parasite tree node is {:?}",index.e );
match index.e {
Event::Loss => {
info!("[map_parasite_s2g] => missing node is a Loss, I add it to parent");
let new_loss = para_as_species.new_node(name.to_string());
para_as_species.arena[new_loss].name = name.to_string();
para_as_species.arena[new_loss].parent = Some(j);
para_as_species.arena[j].children.push(new_loss);
info!("[map_parasite_s2g] LOSS ADDED {:?}",para_as_species.arena[new_loss]);
info!("[map_parasite_s2g] => parent is now : {:?}",para_as_species.arena[j]);
},
Event::Leaf => {
info!("[map_parasite_s2g] => missing species node is a Leaf, I add it to parent");
let new_leaf = para_as_species.new_node(name.to_string());
para_as_species.arena[new_leaf].name = name.to_string();
para_as_species.arena[new_leaf].parent = Some(j);
para_as_species.arena[j].children.push(new_leaf);
let gnodes = ¶_as_species.arena[j].nodes;
let &nbg = ¶_as_species.arena[j].nbg;
para_as_species.arena[new_leaf].nodes = gnodes.to_vec();
para_as_species.arena[new_leaf].nbg = nbg;
para_as_species.arena[j].nbg = 0;
para_as_species.arena[j].nodes = [].to_vec();
info!("[map_parasite_s2g] parent species node is now #{} {:?}",j,para_as_species.arena[j]);
info!("[map_parasite_s2g] added species leave is now #{} {:?}",new_leaf,para_as_species.arena[new_leaf]);
info!("[map_parasite_s2g] the reconciled species node is still {:?}",index);
let new_gnodes = ¶_as_species.arena[new_leaf].nodes;
info!("[map_parasite_s2g] Loop over associated nodes {:?}",new_gnodes);
let mut add_gnodes = [].to_vec();
for (ng,nn) in new_gnodes {
info!("\n[map_parasite_s2g]");
info!("[map_parasite_s2g] Modify gene tree number {}, node {}",*ng,nn );
info!("[map_parasite_s2g] Before : {:?}", &gene_trees[*ng].arena[*nn]);
match gene_trees[*ng].arena[*nn].parent {
Some(p) => info!("[map_parasite_s2g] Parent = {:?}:", &gene_trees[*ng].arena[p]),
None => {},
};
let sons = &gene_trees[*ng].arena[*nn].children;
if sons.len() > 0 {
info!("[map_parasite_s2g] Left = {:?} ", &gene_trees[*ng].arena[sons[0]]);
info!("[map_parasite_s2g] Right = {:?} ", &gene_trees[*ng].arena[sons[1]]);
}
info!("[map_parasite_s2g] Modify gene tree number {}",*ng);
info!("[map_parasite_s2g] Redefine location of the node {}.",nn);
info!("[map_parasite_s2g] Previous {:?}:", &gene_trees[*ng].arena[*nn]);
gene_trees[*ng].arena[*nn].location = para_as_species.arena[new_leaf].name.to_string();
info!("[map_parasite_s2g] New {:?}:", &gene_trees[*ng].arena[*nn]);
if nn > &0 {
let p = gene_trees[*ng].arena[*nn].parent;
let parent = match p {
Some(p) => p,
None => panic!("[map_parasite_s2g] Unable to find parent"),
};
if gene_trees[*ng].arena[parent].e == Event::BranchingOut {continue};
if gene_trees[*ng].arena[parent].e == Event::Duplication {continue};
info!("[map_parasite_s2g] Adding 2 new genes.");
let new_svgnode = gene_trees[*ng].new_node("virtualsvg_".to_string()
+ &virt_svg.to_string());
gene_trees[*ng].arena[new_svgnode].name = "virtualsvg_".to_string()
+ &virt_svg.to_string();
virt_svg = virt_svg + 1 ;
gene_trees[*ng].arena[new_svgnode].location = index.name.clone();
gene_trees[*ng].arena[new_svgnode].virtualsvg = true;
gene_trees[*ng].arena[new_svgnode].is_a_transfert = gene_trees[*ng].arena[parent].is_a_transfert;
if gene_trees[*ng].arena[*nn].is_a_transfert {
gene_trees[*ng].arena[new_svgnode].visible = false;
}
let new_svgnode_bis = gene_trees[*ng].new_node("virtualsvg_".to_string()
+ &virt_svg.to_string());
gene_trees[*ng].arena[new_svgnode_bis].name = "virtualsvg_".to_string()
+ &virt_svg.to_string();
virt_svg = virt_svg + 1 ;
gene_trees[*ng].arena[new_svgnode_bis].location = index.name.clone();
gene_trees[*ng].arena[new_svgnode_bis].virtualsvg = true;
add_gnodes.push((j,*ng,(new_svgnode_bis,new_svgnode)));
gene_trees[*ng].arena[new_svgnode].parent=p;
gene_trees[*ng].arena[*nn].parent=Some(new_svgnode);
gene_trees[*ng].arena[new_svgnode_bis].parent=Some(new_svgnode);
gene_trees[*ng].arena[new_svgnode_bis].visible = false;
gene_trees[*ng].arena[new_svgnode].children.push(new_svgnode_bis);
gene_trees[*ng].arena[new_svgnode].children.push(*nn);
gene_trees[*ng].arena[parent].children.push(new_svgnode);
gene_trees[*ng].arena[parent].children.retain(|&x| x != *nn);
info!("[map_parasite_s2g] Previous node : {:?}",gene_trees[*ng].arena[*nn]);
info!("[map_parasite_s2g] Parent : {:?}",gene_trees[*ng].arena[parent]);
info!("[map_parasite_s2g] Virtual 1 : {:?}",gene_trees[*ng].arena[new_svgnode]);
info!("[map_parasite_s2g] Virtual 2 : {:?}",gene_trees[*ng].arena[new_svgnode_bis]);
info!("[map_parasite_s2g] new gene added.");
}
}
info!("[map_parasite_s2g] End of the loop.");
info!("[map_parasite_s2g] Associates the new virtual gene nodes to the pipe parasite tree.");
for (node,ng,(node1,node2)) in add_gnodes {
info!("[map_parasite_s2g] Adding gene nodes of tree number {} to species node {} ({},{})",ng,node,node1,node2);
info!("[map_parasite_s2g] Species node was {:?}",para_as_species.arena[node]);
para_as_species.arena[node].nbg = para_as_species.arena[node].nbg + 1;
para_as_species.arena[node].nodes.push((ng,node1)) ;
para_as_species.arena[node].nbg = para_as_species.arena[node].nbg + 1;
para_as_species.arena[node].nodes.push((ng,node2)) ;
info!("[map_parasite_s2g] Species node is now {:?}",para_as_species.arena[node]);
}
},
_ => {
info!("[map_parasite_s2g] => missing node is a not Loss nor a Leaf, I insert it between parent and chidren");
let new_node = para_as_species.new_node(name.to_string());
para_as_species.arena[new_node].name = name.to_string();
let children = ¶_as_species.arena[j].children;
let left = children[0];
let right = children[1];
para_as_species.arena[left].parent = Some(new_node);
para_as_species.arena[right].parent = Some(new_node);
para_as_species.arena[new_node].children.push(left);
para_as_species.arena[new_node].children.push(right);
para_as_species.arena[j].children.retain(|&x| x != left);
para_as_species.arena[j].children.retain(|&x| x != right);
para_as_species.arena[j].children.push(new_node);
para_as_species.arena[new_node].parent = Some(j);
let gnodes = ¶_as_species.arena[j].nodes;
let &nbg = ¶_as_species.arena[j].nbg;
para_as_species.arena[new_node].nodes = gnodes.to_vec();
para_as_species.arena[new_node].nbg = nbg;
para_as_species.arena[j].nbg = 0;
para_as_species.arena[j].nodes = [].to_vec();
let new_gnodes = ¶_as_species.arena[new_node].nodes;
let mut add_gnodes = [].to_vec();
for (ng,nn) in new_gnodes {
info!("[map_parasite_s2g] Modify gene tree number {}",*ng);
info!("[map_parasite_s2g] Redefine location of the node.");
info!("[map_parasite_s2g] Previous {:?}:", &gene_trees[*ng].arena[*nn]);
gene_trees[*ng].arena[*nn].location = para_as_species.arena[new_node].name.to_string();
info!("[map_parasite_s2g] New {:?}:", &gene_trees[*ng].arena[*nn]);
if (nn > &0) && (!index.is_a_transfert) {
info!("[map_parasite_s2g] Node is not a gene root nor a transfer: adding 2 new genes.");
let p = gene_trees[*ng].arena[*nn].parent;
let parent = match p {
Some(p) => p,
None => panic!("[map_parasite_s2g] Unable to find parent"),
};
let new_svgnode = gene_trees[*ng].new_node("virtualsvg_".to_string()
+ &virt_svg.to_string());
gene_trees[*ng].arena[new_svgnode].name = "virtualsvg_".to_string()
+ &virt_svg.to_string();
virt_svg = virt_svg + 1 ;
gene_trees[*ng].arena[new_svgnode].location = index.name.clone();
gene_trees[*ng].arena[new_svgnode].virtualsvg = true;
let new_svgnode_bis = gene_trees[*ng].new_node("virtualsvg_".to_string()
+ &virt_svg.to_string());
gene_trees[*ng].arena[new_svgnode_bis].name = "virtualsvg_".to_string()
+ &virt_svg.to_string();
virt_svg = virt_svg + 1 ;
gene_trees[*ng].arena[new_svgnode_bis].location = index.name.clone();
gene_trees[*ng].arena[new_svgnode_bis].virtualsvg = true;
add_gnodes.push((j,*ng,(new_svgnode_bis,new_svgnode)));
gene_trees[*ng].arena[new_svgnode].parent=p;
gene_trees[*ng].arena[*nn].parent=Some(new_svgnode);
gene_trees[*ng].arena[new_svgnode_bis].parent=Some(new_svgnode);
gene_trees[*ng].arena[new_svgnode_bis].visible = false;
gene_trees[*ng].arena[new_svgnode].children.push(new_svgnode_bis);
gene_trees[*ng].arena[new_svgnode].children.push(*nn);
gene_trees[*ng].arena[parent].children.push(new_svgnode);
gene_trees[*ng].arena[parent].children.retain(|&x| x != *nn);
info!("[map_parasite_s2g] new gene added.");
}
}
for (node,ng,(node1,node2)) in add_gnodes {
info!("[map_parasite_s2g] Adding gene nodes of tree number {} to species node {} ({},{})",ng,node,node1,node2);
para_as_species.arena[node].nbg = para_as_species.arena[node].nbg + 1;
para_as_species.arena[node].nodes.push((ng,node1)) ;
para_as_species.arena[node].nbg = para_as_species.arena[node].nbg + 1;
para_as_species.arena[node].nodes.push((ng,node2)) ;
}
},
};
},
}
}
}
pub fn map_gene_host(gene_trees: &mut Vec<ArenaTree<String>>, tree_para_pipes: &mut Vec<ArenaTree<String>>, tree_host_pipe:&mut ArenaTree<String>) {
let mut j = 0;
let nb_nodes = tree_host_pipe.arena.len();
while j < nb_nodes {
tree_host_pipe.arena[j].nbg = 0;
tree_host_pipe.arena[j].nodes = vec![];
tree_host_pipe.arena[j].width = PIPEBLOCK;
tree_host_pipe.arena[j].height = PIPEBLOCK;
j = j + 1 ;
}
let mut i = 0;
let nb_genes = gene_trees.len();
let nb_par = tree_para_pipes.len();
while i < nb_genes {
let mut j = 0;
let nb_nodes = gene_trees[i].arena.len();
let mut virtual_nodes:std::vec::Vec<usize> = Vec::new();
while j < nb_nodes {
let mut global_find_spec = false;
let mut k = 0;
while k < nb_par {
let espece = gene_trees[i].arena[j].location.clone();
let espece_index = tree_para_pipes[k].get_index(espece);
let mut find_spec = false;
let espece_index = match espece_index {
Ok(n) => {
if find_spec { panic!("[map_gene_host] Multiple species matches") }
find_spec = true;
global_find_spec = true;
n
},
Err(_e) => {
info!("species {} not found in parasite tree number {}", gene_trees[i].arena[j].location.clone(),k);
0
},
};
if find_spec {
gene_trees[i].arena[j].location = tree_para_pipes[k].arena[espece_index].location.clone();
if tree_para_pipes[k].arena[espece_index].is_a_transfert {
gene_trees[i].arena[j].is_a_transfert = true;
let parent = gene_trees[i].arena[j].parent;
match parent {
None => panic!("[map_gene_host] Node has no parent"),
Some(p) => gene_trees[i].arena[p].e = Event::BifurcationOut,
};
}
if gene_trees[i].arena[j].e == Event::Undef {
if gene_trees[i].arena[j].children.len() > 0 {
virtual_nodes.push(j);
}
}
}
k = k + 1;
}
if !global_find_spec {
panic!("[map_gene_host] Unable to map node {:?} loc={:?}",gene_trees[i].arena[j].name.clone(),gene_trees[i].arena[j].location.clone())
}
j = j + 1;
}
for j in virtual_nodes {
let espece = gene_trees[i].arena[j].location.clone();
let espece_index = tree_host_pipe.get_index(espece);
let espece_index = match espece_index {
Ok(n) => {
n
},
Err(_e) => {
panic!("[map_gene_host] species not found in host tree");
},
};
let parent = tree_host_pipe.arena[espece_index].parent;
let parent = match parent {
Some(p) => p,
None => panic!("[map_gene_host] species has no parent in host tree"),
};
let espece = &tree_host_pipe.arena[parent].name;
gene_trees[i].arena[j].location = espece.to_string();
}
i = i + 1;
}
}
#[allow(dead_code)]
pub fn select_transfer(transfers: & Vec<(String,String)>,species_tree: &mut ArenaTree<String>) -> Vec<(String,String)> {
let mut selected = vec![];
for (start,end) in transfers {
let s = species_tree.get_index(start.to_string()).expect("[select_transfer] Unable fo find start");
let e = species_tree.get_index(end.to_string()).expect("[select_transfer] Unable fo find start");
let ancestor = lca(species_tree,s,e);
if (ancestor != s) && (ancestor != e) {
selected.push((start.clone(),end.clone()));
}
}
selected
}
pub fn optimisation(transfer: & (String,String),species_tree: &mut ArenaTree<String>) -> usize {
info!("[optimisation]");
let (start,end) = transfer;
info!("[optimisation] Transfer {}->{}",start,end);
let s = species_tree.get_index(start.to_string()).expect("[optimisation] Unable fo find start");
let e = species_tree.get_index(end.to_string()).expect("[optimisation] Unable fo find start");
let ancestor = lca(species_tree,s,e);
info!("[optimisation] Ancestor of {}->{} is {}",start,end, &species_tree.arena[ancestor].name);
let droite = species_tree.arena[ancestor].children[1];
let gauche = species_tree.arena[ancestor].children[0];
info!("[optimisation] Rigth son of ancestor is {}",&species_tree.arena[droite].name);
let mut _right_left_start = false;
if droite == s {
_right_left_start = true;
}
else {
let mut parent = species_tree.arena[s].parent;
while parent != None {
let p = match parent {
Some(p) => p,
None => panic!("[optimisation] unexpected None"),
};
if p == droite {
_right_left_start = true;
}
parent = species_tree.arena[p].parent;
}
}
if _right_left_start {
info!("[optimisation] The start of transfer is on the right side");
info!("[optimisation] Start: Check if {} is not {} nor its parent {}",
species_tree.arena[s].name,species_tree.arena[droite].name,
species_tree.arena[ancestor].name);
if (s != droite ) && ( s!= ancestor ){
info!("[optimisation] Increment 'go left' at {}",species_tree.arena[s].name);
species_tree.arena[s].go_left = species_tree.arena[s].go_left +1;
let mut parent = species_tree.arena[s].parent;
info!("[optimisation] Start: Add a go left from parent of {} to {}",
species_tree.arena[s].name,species_tree.arena[droite].name);
while parent != Some(droite) && parent != Some(ancestor) && parent != None {
let p = match parent {
Some(p) => p,
None => panic!("[optimisation] unexpected None"),
};
info!("[optimisation] Increment go left at {}",species_tree.arena[p].name);
species_tree.arena[p].go_left = species_tree.arena[p].go_left +1;
parent = species_tree.arena[p].parent;
}
}
info!("[optimisation] End: Check if {} is not {} nor its parent {}",
species_tree.arena[e].name,species_tree.arena[gauche].name,species_tree.arena[ancestor].name);
if (e != gauche ) && ( e!= ancestor) {
info!("[optimisation] Increment go right at {}",species_tree.arena[e].name);
species_tree.arena[e].go_right = species_tree.arena[e].go_right +1;
let mut parent = species_tree.arena[e].parent;
info!("[optimisation] End: Add a go right from parent of {} to {}",
species_tree.arena[e].name,species_tree.arena[gauche].name);
while parent != Some(gauche) && parent != Some(ancestor) {
let p = match parent {
Some(p) => p,
None => panic!("[optimisation] unexpected None"),
};
info!("[optimisation] Increment go right at {}",species_tree.arena[p].name);
species_tree.arena[p].go_right = species_tree.arena[p].go_right +1;
parent = species_tree.arena[p].parent;
}
}
}
else {
info!("[optimisation] The start is on the left side");
info!("[optimisation] Start: Check if {} is not {} nor its parent {}",
species_tree.arena[s].name,species_tree.arena[gauche].name,
species_tree.arena[ancestor].name);
if (s != gauche ) && ( s!= ancestor){
info!("[optimisation] Increment go rigth at {}",species_tree.arena[s].name);
species_tree.arena[s].go_right = species_tree.arena[s].go_right +1;
let mut parent = species_tree.arena[s].parent;
info!("[optimisation] Start: Add a go right from parent of {} to {}",
species_tree.arena[s].name,species_tree.arena[gauche].name);
while parent != Some(gauche) && parent != Some(ancestor) && parent != None {
let p = match parent {
Some(p) => p,
None => panic!("[optimisation] unexpected None"),
};
info!("[optimisation] Increment go right at {}",species_tree.arena[p].name);
species_tree.arena[p].go_right = species_tree.arena[p].go_right +1;
parent = species_tree.arena[p].parent;
}
}
info!("[optimisation] End: Check if {} is not {} nor its parent {}",
species_tree.arena[e].name,species_tree.arena[droite].name,
species_tree.arena[ancestor].name);
if (e != droite ) && ( e != ancestor ){
info!("[optimisation] Increment go left at {}",species_tree.arena[e].name);
species_tree.arena[e].go_left = species_tree.arena[e].go_left +1;
let mut parent = species_tree.arena[e].parent;
info!("[optimisation] End: Add a go left from parent of {} to {}",
species_tree.arena[e].name,species_tree.arena[droite].name);
while parent != Some(droite) && parent != Some(ancestor) {
let p = match parent {
Some(p) => p,
None => panic!("[optimisation] unexpected None"),
};
info!("[optimisation] Increment go left at {}",species_tree.arena[p].name);
species_tree.arena[p].go_left = species_tree.arena[p].go_left +1;
parent = species_tree.arena[p].parent;
}
}
}
ancestor
}
pub fn check_optimisation(transfer: & (String,String), species_tree: &mut ArenaTree<String>,node: usize) {
let (start,end) = transfer;
info!("[check_optimisation]");
info!("[check_optimisation] Processing transfer {}->{} for node {}",start,end,&species_tree.arena[node].name);
let s = species_tree.get_index(start.to_string()).expect("[check_optimisation] Unable fo find start");
let e = species_tree.get_index(end.to_string()).expect("[check_optimisation]] Unable fo find start");
let children = &mut species_tree.arena[node].children;
if children.len() > 0 {
let left = children[0];
let right = children[1];
let goleft_left = species_tree.arena[left].go_left as i32;
let goright_left = species_tree.arena[left].go_right as i32;
let score_goleft_left = goleft_left - goright_left;
let goleft_right = species_tree.arena[right].go_left as i32;
let goright_right = species_tree.arena[right].go_right as i32;
let score_goleft_right = goleft_right - goright_right;
let switch = score_goleft_right > score_goleft_left;
if switch {
info!("[check_optimisation] Try to switch node {} : ",species_tree.arena[node].name);
if species_tree.arena[node].fixed {
info!("[check_optimisation] Not possible : node is fixed");
}
else {
info!("[check_optimisation] OK");
}
}
if switch && ( species_tree.arena[node].fixed == false ){
info!("[check_optimisation] Inversion at node {} {} ({}>{})",node,
species_tree.arena[node].name,score_goleft_right,score_goleft_left);
species_tree.arena[node].children[0] = right;
species_tree.arena[node].children[1] = left;
}
if (node != e ) && (node != s) {
info!("[check_optimisation] Fixing node orientation {}",species_tree.arena[node].name);
species_tree.arena[node].fixed = true;
}
species_tree.arena[node].go_right = 0;
species_tree.arena[node].go_left = 0;
if (left != e ) && (left != s) {
check_optimisation(transfer,species_tree,left);
}
if (right != e ) && (right != s) {
check_optimisation(transfer,species_tree,right);
}
}
}
pub fn classify_transfer(transfer: & (String,String),species_tree: &mut ArenaTree<String>, index: & usize) {
let (start,end) = transfer;
info!("[classify_transfer] Transfer {}->{}",start,end);
let s = species_tree.get_index(start.to_string()).expect("[classify_transfer] Unable fo find start");
let e = species_tree.get_index(end.to_string()).expect("[classify_transfer] Unable fo find start");
let ancestor = lca(species_tree,s,e);
let mut parent = species_tree.arena[s].parent;
while (parent != Some(ancestor)) && (parent != None) {
let p = match parent {
Some(p) => p,
None => panic!("[classify_transfer] unexpected None"),
};
species_tree.arena[p].transfers.push(*index);
parent = species_tree.arena[p].parent;
};
let mut parent = species_tree.arena[e].parent;
while (parent != Some(ancestor)) && (parent != None) {
let p = match parent {
Some(p) => p,
None => panic!("[classify_transfer] unexpected None"),
};
species_tree.arena[p].transfers.push(*index);
parent = species_tree.arena[p].parent;
};
}
pub fn reorder_transfers(species_tree: &mut ArenaTree<String>, node: usize, ordered: &mut Vec<usize> ) {
let tr = &species_tree.arena[node].transfers;
info!("[reorder_transfers_transfer] Transfers at {} = {:?}", &species_tree.arena[node].name,tr);
for t in tr {
if !ordered.contains(&t) {
ordered.push(*t);
}
}
let children = &mut species_tree.arena[node].children;
if children.len() > 0 {
let left = children[0];
let right = children[1];
reorder_transfers(species_tree,left,ordered);
reorder_transfers(species_tree,right,ordered);
}
}