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
|
#!/usr/bin/perl -w
# Originally by Mike Schatz, modified by Maria Nattestad
# github.com/marianattestad/assemblytics
use strict;
my @chromosome_filter_choices = ("all-chromosomes","primary-chromosomes");
my @longrange_filter_choices = ("include-longrange","exclude-longrange","longrange-only");
my @output_file_choices = ("bed","bedpe");
my $USAGE = "Usage:\nAssemblytics_between_alignments.pl coords.tab minimum_event_size maximum_event_size [@chromosome_filter_choices] [@longrange_filter_choices] [@output_file_choices] > fusions.svs.bedpe ";
my $coordsfile = shift @ARGV or die $USAGE;
my $minimum_event_size = int(shift @ARGV);
my $maximum_event_size = int(shift @ARGV);
my $chromosome_filter = shift @ARGV or die $USAGE;
my $longrange_filter = shift @ARGV or die $USAGE;
my $output_file = shift @ARGV or die $USAGE;
# How close do alignments have to be in order to call deletions and insertions? (as opposed to contractions and expansions)
my $narrow_threshold = 50;
# Number of basepairs of distance in either the reference or the query before we call an SV long-range
my $longrange = $maximum_event_size;
# What is the longest two alignments can map apart in the query before we throw the variant between them away?
my $max_query_dist = 100000;
my %chromosome_filter_choices_hash = map { $_, 1 } @chromosome_filter_choices;
my %longrange_filter_choices_hash = map { $_, 1 } @longrange_filter_choices;
my %output_file_choices_hash = map { $_, 1 } @output_file_choices;
if ( $chromosome_filter_choices_hash{ $chromosome_filter } && $longrange_filter_choices_hash{ $longrange_filter } && $output_file_choices_hash { $output_file }) {
# All is well with the world
} else {
die $USAGE;
}
if ($longrange_filter ne "exclude-longrange" && $output_file eq "bed"){
die "Cannot output bed while allowing long-range variants\n$USAGE";
}
open COORDS, "$coordsfile" or die "Can't process $coordsfile ($!)\n";
## Require the flanking alignments are at least this long to call an SV
## Note there is no minimum length for fusions, this is determined by how
## the delta file was filtered
my $MIN_SV_ALIGN = 100;
#my $minimum_event_size = 50;
my $approximately_zero = $narrow_threshold;
my %alignments;
my $numalignments = 0;
while (<COORDS>)
{
chomp;
my @vals = split /\s+/, $_;
my $rid = $vals[6];
my $qid = $vals[7];
my $a;
$a->{"rstart"} = $vals[0];
$a->{"rend"} = $vals[1];
$a->{"qstart"} = $vals[2];
$a->{"qend"} = $vals[3];
$a->{"rlen"} = $vals[4];
$a->{"qlen"} = $vals[5];
$a->{"rid"} = $vals[6];
$a->{"qid"} = $vals[7];
$a->{"str"} = $_;
$a->{"qidx"} = 0;
$a->{"qrc"} = ($a->{"qend"} > $a->{"qstart"}) ? 0 : 1;
push @{$alignments{$qid}->{$rid}}, $a; # a is a hash with all the info for one alignment
$numalignments++;
}
print STDERR "Loaded $numalignments alignments\n";
my $candidatefusions = 0;
my $candidatesvs = 0;
my $sv_id_counter = 0;
my %svstats;
foreach my $qid (sort keys %alignments) # query name is the key for the alignments hash
{
my @refs = sort keys %{$alignments{$qid}}; # grab all alignments of that query
my $numref = scalar @refs;
## Resort the alignments by query sort position
my @qaligns;
foreach my $rid (@refs)
{
foreach my $a (@{$alignments{$qid}->{$rid}})
{
push @qaligns, $a;
}
}
## Now record the index of the sorted query indices
@qaligns = sort { $a->{"qstart"} <=> $b->{"qstart"}} @qaligns;
for (my $i=0; $i < scalar @qaligns; $i++)
{
$qaligns[$i]->{"qidx"} = $i;
}
## scan for SVs
my $numalign = scalar @qaligns;
if ($numalign > 1) # if the query has more than 1 alignment
{
## note skip first one
for (my $j = 1; $j < $numalign; $j++)
{
my $ai = $qaligns[$j-1];
my $aj = $qaligns[$j];
my $istr = $ai->{"str"};
my $jstr = $aj->{"str"};
my $rid = $ai->{"rid"};
if (($ai->{"rlen"} >= $MIN_SV_ALIGN) &&
($aj->{"rlen"} >= $MIN_SV_ALIGN))
{
## r alignments are always forward, q alignments may be flipped
my $rpos;
my $qpos;
my $rdist = 0;
my $qdist = 0;
my $svtype = 0;
my $chromi = $ai->{"rid"};
my $chromj = $aj->{"rid"};
my $posi;
my $posj;
my $strandi;
my $strandj;
$sv_id_counter++;
if (($ai->{"qrc"} == 0) && ($aj->{"qrc"} == 0))
{
## ri: [1 - 1000] | j: [2000 - 3000] => 1000
## qi: [1 - 1000] | j: [2000 - 3000] => 1000
$svtype = "FF";
$qdist = $aj->{"qstart"} - $ai->{"qend"};
$rdist = $aj->{"rstart"} - $ai->{"rend"};
if ($rdist >= 0) { $rpos = sprintf("%s:%d-%d:+", $rid, $ai->{"rend"}, $aj->{"rstart"}); }
else { $rpos = sprintf("%s:%d-%d:-", $rid, $aj->{"rstart"}, $ai->{"rend"}); }
if ($qdist >= 0) { $qpos = sprintf("%s:%d-%d:+", $qid, $ai->{"qend"}, $aj->{"qstart"}); }
else { $qpos = sprintf("%s:%d-%d:-", $qid, $aj->{"qstart"}, $ai->{"qend"}); }
# When the alignments are forward-forward, the connection point is at the end of the first (i: rend) and at the beginning of the second (j: rstart)
# i + - j
# ------> -------->
$posi = $ai->{"rend"};
$posj = $aj->{"rstart"};
$strandi = "+";
$strandj = "-";
}
elsif (($ai->{"qrc"} == 1) && ($aj->{"qrc"} == 1))
{
## ri: [2000 - 3000] | j: [1 - 1000] => 1000
## qi: [1000 - 1] | j: [3000 - 2000] => 1000
$svtype = "RR";
$rdist = $ai->{"rstart"} - $aj->{"rend"};
$qdist = $aj->{"qend"} - $ai->{"qstart"};
if ($rdist >= 0) { $rpos = sprintf("%s:%d-%d:+", $rid, $aj->{"rend"}, $ai->{"rstart"}); }
else { $rpos = sprintf("%s:%d-%d:-", $rid, $ai->{"rstart"}, $aj->{"rend"}); }
if ($qdist >= 0) { $qpos = sprintf("%s:%d-%d:+", $qid, $ai->{"qstart"}, $aj->{"qend"}); }
else { $qpos = sprintf("%s:%d-%d:-", $qid, $aj->{"qend"}, $ai->{"qstart"}); }
# When the alignments are reverse-reverse, the connection point is at the beginning of the first (i: rstart) and at the end of the second (j: rend)
# j + - i
# <------- <--------
$posi = $ai->{"rstart"}; # rstart means first reference coordinate, not with respect to the contig
$posj = $aj->{"rend"}; # rend means last reference coordinate, not with respect to the contig
$strandi = "-";
$strandj = "+";
}
elsif (($ai->{"qrc"} == 0) && ($aj->{"qrc"} == 1))
{
## ri: [1 - 1000] | j: [2000 - 3000] => 1000
## qi: [1 - 1000] | j: [3000 - 2000] => 1000
$svtype = "FR";
$qdist = $aj->{"qend"} - $ai->{"qend"};
$rdist = $aj->{"rstart"} - $ai->{"rend"};
if ($rdist >= 0) { $rpos = sprintf("%s:%d-%d:+", $rid, $ai->{"rend"}, $aj->{"rstart"}); }
else { $rpos = sprintf("%s:%d-%d:-", $rid, $aj->{"rstart"}, $ai->{"rend"}); }
if ($qdist >= 0) { $qpos = sprintf("%s:%d-%d:+", $qid, $ai->{"qend"}, $aj->{"qend"}); }
else { $qpos = sprintf("%s:%d-%d:-", $qid, $aj->{"qend"}, $ai->{"qend"}); }
# When the alignments are forward-reverse, the connection point is at the beginning of the first (i: rstart) and at the end of the second (j: rend)
# i + j +
# -------> <--------
$posi = $ai->{"rend"};
$posj = $aj->{"rend"};
$strandi = "+";
$strandj = "+";
}
elsif (($ai->{"qrc"} == 1) && ($aj->{"qrc"} == 0))
{
## ri: [1 - 1000] | j: [2000 - 3000] => 1000
## qi: [1000 - 1] | j: [2000 - 3000] => 1000
$svtype = "RF";
$qdist = $ai->{"qend"} - $aj->{"qend"};
$rdist = $aj->{"rstart"} - $ai->{"rend"};
if ($rdist >= 0) { $rpos = sprintf("%s:%d-%d:+", $rid, $ai->{"rend"}, $aj->{"rstart"}); }
else { $rpos = sprintf("%s:%d-%d:-", $rid, $aj->{"rstart"}, $ai->{"rend"}); }
if ($qdist >= 0) { $qpos = sprintf("%s:%d-%d:+", $qid, $aj->{"qend"}, $ai->{"qend"}); }
else { $qpos = sprintf("%s:%d-%d:-", $qid, $ai->{"qend"}, $aj->{"qend"}); }
# When the alignments are reverse-forward:
# - i - j
# <------- -------->
$posi = $ai->{"rstart"};
$posj = $aj->{"rstart"};
$strandi = "-";
$strandj = "-";
}
else
{
my $irc = $ai->{"qrc"};
my $jrc = $aj->{"qrc"};
print "ERROR: Unknown SV: $irc $jrc\n";
print "$istr\n";
print "$jstr\n";
die "ERROR: Unknown SV: $irc $jrc\n";
}
my $totaldist = $rdist + $qdist;
my $typeguess = "";
my $abs_event_size = abs($rdist-$qdist);
if ($chromi ne $chromj) { # interchromosomal
$typeguess = "Interchromosomal";
$rdist = 0;
} else { # same chromosome
if ($strandi eq $strandj) {
$typeguess = "Inversion";
$abs_event_size = $rdist;
}
elsif ($qdist > $rdist) {
# both are significantly negative: (means the size of an overlapping region got larger, so tandem element expansion)
if ($rdist > -1*$approximately_zero && $rdist < $approximately_zero && $qdist > -1*$approximately_zero) {
$typeguess = "Insertion";
# split into out of nowhere (rdist ~ 0) vs. rdist is > 0: insertion_in_unmapped_region
}
else {
if ($rdist < 0 || $qdist < 0) {
$typeguess = "Tandem_expansion";
} else {
$typeguess = "Repeat_expansion";
}
}
}
elsif ($qdist < $rdist) {
# both are significantly negative: (means the size of an overlapping region got smaller, so tandem element contraction)
if ($rdist > -1*$approximately_zero && $qdist > -1*$approximately_zero && $qdist < $approximately_zero) {
$typeguess = "Deletion";
# split into out of nowhere (rdist ~ 0) vs. rdist is > 0: deletion_in_unmapped_region
}
else {
if ($rdist < 0 || $qdist < 0) {
$typeguess = "Tandem_contraction";
} else {
$typeguess = "Repeat_contraction";
}
}
}
else {
$typeguess = "None";
}
if ($abs_event_size > $longrange) { # || abs($rdist) > $longrange || abs($qdist) > $longrange
$typeguess = "Longrange";
if (abs($qdist) > $max_query_dist) {
$typeguess = "None";
}
}
}
my $chromi_length = length $chromi; # length of the chromosome names: a way to filter to primary chromosomes and cut out alts and patches from the assembly
my $chromj_length = length $chromj;
if ($typeguess ne "Inversion" && $typeguess ne "None" && $abs_event_size >= $minimum_event_size) { # always required
if ($chromosome_filter eq "all-chromosomes" || ($chromi_length < 6 && $chromj_length < 6)) { # test for primary chromosomes unless "all-chromosomes" is chosen
if ($longrange_filter ne "exclude-longrange" || ($typeguess ne "Interchromosomal" && $typeguess ne "Longrange")) {
if ($longrange_filter ne "longrange-only" || ($typeguess eq "Interchromosomal" || $typeguess eq "Longrange")) {
if ($output_file eq "bedpe") {
print "$chromi\t$posi\t@{[$posi + 1]}\t$chromj\t$posj\t@{[$posj + 1]}\tAssemblytics_b_$sv_id_counter\t$abs_event_size\t$strandi\t$strandj\t$typeguess\t$rdist\t$qdist\t$qpos\t$abs_event_size\t$svtype\tbetween_alignments\n";
}
else {
use List::Util qw(min max);
my $ref_start = min(($posi, $posj));
my $ref_stop = max(($posi, $posj));
if ($ref_stop eq $ref_start) {
$ref_stop = $ref_start + 1;
}
# "chrom","start","stop","name","event.size","strand","event.type","ref.dist","query.dist","contig.name"
print "$chromi\t$ref_start\t$ref_stop\tAssemblytics_b_$sv_id_counter\t$abs_event_size\t+\t$typeguess\t$rdist\t$qdist\t$qpos\tbetween_alignments\n";
}
}
}
}
}
$candidatesvs++;
}
}
}
}
|