- next if (/^#/);
- my @t = split;
- if ($t[0] ne $lastchr) {
- $lastchr = $t[0];
- } elsif (/NEIR=([\d\.]+)/) {
- push(@a, [$t[1] - $lastpos, $1, $t[1]]);
- }
- $lastpos = $t[1];
- }
- my $max = 1000000000;
- push(@a, [$max, 0, 0]); # end marker
- @a = sort {$a->[0]<=>$b->[0]} @a;
- my $next = $opts{s};
- my $last = $a[0];
- my @c = (0, 0, 0, 0);
- for my $p (@a) {
- print STDERR "$p->[0]\t$p->[1]\t$p->[2]\n" if ($is_print);
- if ($p->[0] == $max || ($p->[0] != $last && $c[0]/@a > $next)) {
- printf("%d\t%.2f\t%.4f\n", $c[1], $c[2]/$c[1], $c[3]/$c[1]);
- $c[1] = $c[2] = $c[3] = 0;
- $next = $c[0]/@a + $opts{s};
+ if (/^([^#\s]+)\s(\d+)/) {
+ my ($chr, $pos) = ($1, $2);
+ if (/NEIR=([\d\.]+)/) {
+ ++$n;
+ ++$y, $x += $pos - $last if ($lastchr eq $chr && $pos > $last && $1 > $cutoff);
+ }
+ $last = $pos; $lastchr = $chr;