-
Notifications
You must be signed in to change notification settings - Fork 12
/
rcldo.pl.in
executable file
·554 lines (485 loc) · 16.7 KB
/
rcldo.pl.in
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
#!/usr/bin/perl
my $VERSION='__SETVERSION__';
use strict;
use warnings;
use Scalar::Util qw(looks_like_number);
## This program provides various data-wrangling capabilities for rcl
## Most modes are not interesting for users, except 'label', which
## translates numerical indices to labels.
## A neater interface might be nice, e.g. rcldo.pl --mode=label --annotfile=FILE etc
%::help = ( clstag => <<EOH
clstag FILENAME
FILENAME will generally contain a clustering in mcl matrix format.
Expects FILENAME to contain the pattern [rI]\\d{2,}, that is, the letter
r or I followed by at least two digits; these are taken to encode either
a resolution parameter (Leiden) or an inflation parameter (mcl).
This outputs the number found. If the environment variable RCLPLOT_PARAM_SCALE
is set the result is first divided by 10 ** RCLPLOT_PARAM_SCALE .
EOH
, label => <<EOH
label TABFILE <STDIN>
Reads STDIN. Expects a header line containing a column name 'elements'. Each
field in the nodes column is expected to be a space-separated list of
indexes. This mode replaces the indexes with the corresponding labels and
copies the rest of the input verbatim.
TABFILE: mcl tab file containing label mapping.
EOH
, labelcls => <<EOH
labelcls TABFILE <STDIN>
As above, additionally expects 'nesting' column. the 'elements' column is de-multiplexed
over the 'nesting' column to make a Seurat-type cluster file; a label called '__dummy__'
is ignored/skipped.
TABFILE: mcl tab file containing label mapping.
EOH
, distwrangle => <<EOH
distwrangle NUM <STDIN>
Reads STDIN which should be clmdist output. Each line of that output
refers to two file names, both encoding clusterings. The file names are
parsed for resolution parameter information as under clstag.
NUM: total number of nodes
EOH
, granul => <<EOH
granul FILENAME
FILENAME should contain a clustering in mcl matrix format. expects
FILENAME to contain the same infix as described under clstag (r\\d{2,} or
I\\d{2,}). Outputs cumulative fractional proportion of nodes contained in
cluster of size <= x.
Used by: rcl-qc
EOH
, 'heatannot[cls]' => <<EOH
heatannot[cls] ANNOTATIONFILE PARTITIONFILE TABFILE outputbase
ANNOTATIONFILE e.g. output as from celltypist (however, tab-separated rather than csv)
A rectangular matrix; column names are terms, row names are cell barcodes, the data
are scores for each barcode/term combination.
PARTITIONFILE Either an rcl output file rcl.hm.* (heatmap-ready data produced by
rcl select) in mode heatannot
or an mcl clustering in mode heatannotcls
TABFILE mcl tab file containing label mapping.
outputbase prefix for output
Used by: rcl-qc heatannot[cls]
EOH
);
sub help {
my $mode = shift;
if (defined($::help{$mode})) {
print "$::help{$mode}\n";
exit 0;
}
else {
if ($mode eq 'all') {
print <<EOH;
Usage:
$::help{clstag}
$::help{label}
$::help{labelcls}
$::help{distwrangle}
$::help{granul}
$::help{'heatannot[cls]'}
EOH
exit 0;
}
else {
print <<EOH;
Available modes:
clstag label labelcls granul distwrangle heatannot heatannotcls
Use rcldo.pl MODE for descriptions
Most modes are for rcl internal usage, you may mostly care about label mode.
EOH
exit 1;
}
}
}
my $mode = shift || help('all');
$::demux = 0;
if ($mode eq 'version') {
print "rcldo.pl version $VERSION\n";
exit 0;
}
# This depends on all othermodes needing at least one argument.
elsif (!@ARGV) {
# it makes sense in a limited and specific way.
$mode = 'heatannot[cls]' if $mode eq 'heatannot' || $mode eq 'heatannotcls';
help($mode);
}
if ($mode eq 'granul') {
granul();
}
elsif ($mode eq 'distwrangle') {
distwrangle();
}
elsif ($mode eq 'label') {
die "Need <tabfile>\n" unless @ARGV == 1;
my $tabfile = shift;
labelwrangle($tabfile);
}
elsif ($mode eq 'labelcls') {
die "Need <tabfile>\n" unless @ARGV == 1;
my $tabfile = shift;
$::demux = 1;
labelwrangle($tabfile);
}
elsif ($mode eq 'clstag') {
die "Need file name\n" unless @ARGV == 1;
my $tag = get_tag(@ARGV);
my $scale = $ENV{RCLPLOT_PARAM_SCALE} || 0;
$tag /= 10 ** $scale;
print "$tag\n";
}
elsif ($mode eq 'heatannot' || $mode eq 'heatannotcls') {
die "Need <annotationfile> <partitionhierarchyfile> <tabfile> <outputbase>\n" unless @ARGV == 4;
my ($fnannot, $fnhier, $fntab, $fnbase) = @ARGV;
my ($dfannot, $termlist) = read_node_annotation_table($fnannot);
my $tab = read_tab($fntab);
my $dispatch = $mode eq 'heatannot' ? 'rclhm' : 'cls';
read_partition_hierarchy($dispatch, $fnhier, $dfannot, $termlist, $tab, $fnbase);
}
else {
die "Unknown mode $mode\n";
}
$::median_warning = 0;
sub get_tag {
my $fname = shift;
die "No file name supplied" unless $fname;
$fname =~ /[rI](\d{2,})\b/ || die "Cannot find resolution parameter from file [$fname]\n";
return $1;
}
sub labelwrangle {
my $tabfile = shift;
my $tab = read_tab($tabfile);
my $bat = { reverse %$tab }; # myes, dangersign.
my $header = <>;
chomp $header;
my @header = split "\t", $header;
my $N = @header;
my %mapcount = ();
my $node_index = -1;
my $id_nesting = -1;
my $index = 0;
for (@header) {
$node_index = $index if $_ eq 'elements';
$id_nesting = $index if $_ eq 'nesting';
$index++;
}
die "No nodes column found\n" unless $node_index >= 0;
die "No id column found\n" unless (!$::demux || $id_nesting >=0);
print "$header\n" unless $::demux;
my %cls = ();
while (<>) {
chomp;
# -1 below is to retain empty fields.
my @F = split "\t", $_, -1;
my $NF = @F;
die "Column count mismatch ($N/$NF) on line $.\n" unless $N == $NF;
my $nodelist = $F[$node_index];
my @labels = ();
if ($nodelist eq '-') {
push @labels, '-';
}
else {
for my $n (split " ", $nodelist, -1) {
die "Weird entry [$n] on line $.\n" unless $n =~ /^[0-9]+$/;
die "[$n] not present in tab on line $.\n" unless defined($tab->{$n});
push @labels, $tab->{$n};
$mapcount{$n}++;
}
}
if ($::demux) {
for my $l (@labels) {
$cls{$l} = $F[$id_nesting];
}
}
else {
$F[$node_index] = join " ", @labels;
local $" = "\t";
print "@F\n";
}
}
if ($::demux) {
for my $l (sort { $bat->{$a} <=> $bat->{$b} } keys %cls) {
print "$l\t$cls{$l}\n" unless $l eq '__dummy__';
}
}
my %hist = ( 0 => 0 );
for (values %mapcount) {
$hist{$_}++;
}
for (sort { $a <=> $b } keys %hist) {
printf STDERR "%6d keys were mapped %d times\n", $hist{$_}, $_;
}
}
sub distwrangle {
my $T = shift @ARGV;
my $scale = $ENV{RCLPLOT_PARAM_SCALE} || 0;
while (<>) {
chomp;
/d1=(\d+)\s+d2=(\d+).*?[rI](\d{2,})\b.*?[rI](\d{2,})/ || die "No match on line [$_]\n";
my $d1=$1; # Leading zeroes do not lead to octal
my $d2=$2; # ^
my $x=$3;
my $y=$4;
if ($scale) {
$x /= 10**$scale;
$y /= 10**$scale;
}
print $d1/$T, "\t$x\t$y\n";
print $d2/$T, "\t$y\t$x\n";
}
}
sub granul {
my @x = 0..80;
# TODO make below flexible.
my @y = grep { $_ <= 10000 } map { 10 ** ($_/10) } @x;
my $runningtotal = 0;
my $y = 0;
my $size = 0;
my $fname = shift @ARGV;
my $totalsize = shift @ARGV;
my $tag = get_tag($fname);
my $scale = $ENV{RCLPLOT_PARAM_SCALE} || 0;
$tag /= 10**$ENV{RCLPLOT_PARAM_SCALE};
while (<>) {
chomp;
$size = $_;
while ($size > $y[$y]) {
my $fraction = $runningtotal/$totalsize;
print "$tag\t$y\t$fraction\t$y[$y]\n";
$y++;
}
$runningtotal += $size;
}
while ($y < @y) {
my $fraction = $runningtotal/$totalsize;
print "$tag\t$y\t$fraction\t$y[$y]\n";
$y++;
}
}
sub attach_annotation {
my ($h, $v) = @_;
my %h = ();
for (my $i=0; $i<@$h; $i++) {
$h{$h->[$i]} = $v->[$i];
}
return \%h;
}
sub read_node_annotation_table {
my $fntable = shift;
print STDERR "-- Annotation table $fntable\n";
open(CT, "<$fntable") || die "Cannot open annotation table $fntable\n";
my $header = <CT>;
chomp $header;
my @header = split "\t", $header;
shift @header if $header[0] eq ""; # empty field, the row name tab.
my %dfannot = ();
while (<CT>) {
chomp;
my @F = split "\t";
my $cell = shift @F;
die "Cardinal error $.\n" unless @F == @header;
$dfannot{$cell} = attach_annotation(\@header, [@F]);
} close(CT);
return (\%dfannot, \@header);
}
sub read_tab {
my $tabfile = shift;
open(TAB, "<$tabfile") || die "No tab\n";
my %tab = ();
while (<TAB>) {
chomp;
my @F = split "\t";
die "Tab error [$_]\n" unless @F == 2;
$tab{$F[0]} = $F[1];
}
return \%tab;
}
sub get_median {
my $ref = shift;
my $N = @$ref;
if (!$N) {
print STDERR "## warning empty array for median\n" if $::median_warning++ < 10;
return 0;
}
my $i = int(($N+1)/2);
$i = $N-1 if $i >= $N;
return $ref->[$i];
}
# Used for sorting nodes in dendrogram to ensure same sorting as in input.
# e.g. A B_A B_B_A B_B_C ..... .... AB_A
# TODO revisit this make it less fuzzy.
sub bycluskey {
return length($a) <=> length($b) || $a cmp $b;
}
my $hm_order = 1;
sub hm_newick {
my ($hm_nodes, $hm_tree, $lim, $depth, $key, $branchlength) = @_;
# Dangersign NewickSelection.
# Below is brittle. The idea is that we never stop at
# internal nodes, but only filter on size once at a leaf node. This
# ensures (with clearest/simplest/tightest coupling) that our
# dendrogram matches the table filtering. However, the
# implementation needs to be more explicit about this (e.g.
# is_internal). The hm_tree, hm_nodes data structures need more
# scrutitinising.
# Currently, ComplexHeatmap requires alphabetically ordered
# nodes in the dendrogram (this is to be fixed, https://github.com/jokergoo/ComplexHeatmap/issues/949)
#
my @children = grep { !defined($hm_nodes->{$_}{size}) || $hm_nodes->{$_}{size} >= $lim } sort bycluskey keys %{$hm_tree->{$key}};
if (!@children) {
die "No info for childless node $key\n" unless defined($hm_nodes->{$key});
die "Leaf key error for $key $hm_order\n" if defined($hm_nodes->{$key}) && !defined($hm_nodes->{$key}{ival});
my ($ival, $level, $type) = map { $hm_nodes->{$key}{$_} } qw(ival level type);
my $up = $ival - $branchlength;
# print STDERR "l\t$depth\t$key\t$branchlength\t$ival\t$up\n";
return 'x' . sprintf("%05d", $hm_order++) . ".$key" . ':' . $up;
}
else {
# TODO: check ival/pival, definition of up.
my $ival = $branchlength;
if (defined($hm_nodes->{$key}) && !defined($hm_nodes->{$key}{ival})) {
my @huh = keys %{$hm_nodes->{$key}};
die "Internal key error for $key $hm_order [@huh]\n"
}
$ival = $hm_nodes->{$key}{ival} if defined($hm_nodes->{$key});
my $up = $ival - $branchlength;
# print STDERR "i\t$depth\t$key\t$branchlength\t$ival\t$up\n";
my @newick = ();
for my $child (@children) {
my $nwk = hm_newick($hm_nodes, $hm_tree, $lim, $depth+1, $child, $branchlength + $up);
push @newick, $nwk;
}
return "(" . (join ",", @newick) . "):$up";
}
}
sub sdev {
my ($df, $term, $avg, $NU) = @_;
my $tally = 0;
for my $node (keys %$df) {
$tally += ($df->{$node}{$term} - $avg)**2;
}
my $sd = sqrt($tally/$NU);
print STDERR "-- $sd $avg $term\n";
return $sd;
}
## fixme / todo
## $lim and $prefix are two mechanisms for selection (size, and subtree respectively).
## $lim is passed to newick recursion routine; does this help prevent tree malformedness,
## as compared to doing at the input stage? Well yes-ish: "internal key error"
## It is worse however, $lim (RCLPLOT_HEAT_LIMIT) leads to breakage on its own;
## ("Dendrogram has 9 elements, table s30/hm.abc.sum.txt has 2 elements")
## it worked at some point; perhaps weeding out leaf nodes smaller than RESLIMIT is ok.
## This needs work.
## $prefix on its own seems to work.
sub read_partition_hierarchy {
my %hm_tree = ();
my %hm_nodes = ( root => { level => 0, type => 'cls', ival => 0, print => 0 } );
my $inputmode = shift;
my $datafile = shift;
my $dfannot = shift;
my $termlist = shift;
my $tab = shift;
my $fnbase = shift;
my $lim = $ENV{RCLPLOT_HEAT_LIMIT} || 1;
my $restful = defined($ENV{RCLPLOT_HEAT_NOREST}) ? 0 : 1;
my @nwk_check = ();
open(CLS, "<$datafile") || die "No partition input file\n";
my %cls = ();
my $toplevel = 'root';
my %df_uv_sum = (); # universe sum for term
my %df_uv_sigma = (); # universe sdev for term
my $NU = keys %$dfannot;
print STDERR "-- computing term universe for $NU terms\n";
for my $term (@$termlist) {
for (sort keys %$dfannot ) {
die "No $term score for $_\n" unless defined($dfannot->{$_}{$term});
$df_uv_sum{$term} += $dfannot->{$_}{$term};
}
my $avg = $df_uv_sum{$term} / $NU;
$df_uv_sigma{$term} = sdev($dfannot, $term, $avg, $NU);
}
open (GLORIOUS, ">$fnbase.sum.txt") || die "Cannot open cluster-summed output table $fnbase.sum.txt\n";
open (NWK, ">$fnbase.nwk") || die "Cannot open Newick output table $fnbase.nwk\n";
print STDERR "-- computing cluster/term aggregate scores \n";
local $" = "\t";
print GLORIOUS "Type\tJoinval\tSize\tNesting\t@$termlist\n";
my @bglevel = map { log($df_uv_sum{$_}) / log(10) } @$termlist;
my @bgsum = map { $df_uv_sum{$_} } @$termlist;
my @bgsigma = map { $df_uv_sigma{$_} } @$termlist;
print GLORIOUS "NA\tNA\t$NU\tUniverse_sum\t@bgsum\n";
print GLORIOUS "NA\tNA\t$NU\tUniverse_sdev\t@bgsigma\n";
my $prefix = defined($ENV{RCLPLOT_CLS_PREFIX}) ? $ENV{RCLPLOT_CLS_PREFIX} : "";
# level, type(rest/cls), Ncls, Nmiss, elements
while (<CLS>) {
chomp;
if ($. == 1 && $inputmode eq 'rclhm') {
die "Header [$_] not matched\n" unless $_ eq "level\ttree\ttype\tjoinval\tN1\tN2\tnesting\telements";
next;
}
my ($level, $treeid, $type, $joinval, $N1, $N2, $nesting, $elems) = (1, 'L', 'cls', 0, 0, 0, "A", "");
if ($inputmode eq 'rclhm') {
($level, $treeid, $type, $joinval, $N1, $N2, $nesting, $elems) = split "\t";
next unless $nesting =~ /^$prefix/;
# next unless $N2 >= $lim;
# would be nice to be able to do this, but currently not possible
# see fixme above.
$hm_nodes{$nesting}{ival} = $joinval;
$hm_nodes{$nesting}{level} = $level;
$hm_nodes{$nesting}{type} = $type;
$hm_nodes{$nesting}{size} = $N2;
$hm_nodes{$nesting}{print} = 1;
$hm_tree{$nesting} = {};
# _A are the residual clusters; their joinval is the
# joinval for the parent cluster (which we need).
# Hence we need a _A residual cluster for
# every non-leaf RCL cluster, even if it is empty.
my $branch = $nesting;
while ($branch =~ s/^(.*)(_.+?)$/$1/) {
$hm_tree{$1}{"$1$2"} = 1; # Dangersign format dependency.
if ($2 eq '_A') { # Dangersign even more so.
$hm_nodes{$1}{ival} = $joinval;
}
$branch = $1;
}
$hm_tree{'root'}{$branch} = 1;
}
elsif ($inputmode eq 'cls') {
$elems = $_;
}
else {
die "Pity\n";
}
my @elems = length($elems) ? map { $tab->{$_} } split /\s+/, $elems : ();
die "Error cls input $.\n" unless $inputmode eq 'cls' || $N2 == @elems;
$N2 = $N1 = @elems unless $N2; # This is for mode 'cls'.
next unless $N2 >= $lim; # Dangersign; NewickSelection dependency.
push @nwk_check, $nesting;
if (@elems <= 1) {
print STDERR "## small cluster [$level $type $joinval $N1 $N2 $elems]\n";
}
my %df = ();
for my $t (@$termlist) {
my $sum = 0;
for my $e (@elems) {
next if $e eq '__dummy__';
die "No $e $t\n" unless defined($dfannot->{$e}{$t});
$sum += $dfannot->{$e}{$t};
}
$df{$t}{sum} = $sum;
}
my @values_gl = map { $df{$_}{sum}} @$termlist;
print GLORIOUS "$type\t$joinval\t$N2\t$nesting\t@values_gl\n";
} close(CLS);
if ($inputmode eq 'rclhm') {
my $nwk = hm_newick(\%hm_nodes, \%hm_tree, $lim, 0, 'root', 0, 0);
print NWK "($nwk)\n";
$nwk =~ s/.*?x\d+\.(\w+):\d+/$1-/g;
$nwk =~ s/-\).*//;
my $nwk2 = join '-', @nwk_check;
if ($nwk ne $nwk2) {
print STDERR "-- Error heatmap and dendrogram not matching\n$nwk\n$nwk2\n";
}
else {
print STDERR "-- Matching heatmap data and RCL dendrogram produced in $fnbase.sum.txt and $fnbase.nwk\n";
}
}
close(NWK);
close(GLORIOUS);
}