Does order in the output matter? The easiest solution I can see would be to sort your entries first by the first number ascending, and then by the second number descending. You can then cycle through the list, and any time the current second number is less than the biggest one you've seen so far, you know you've gotten a subset.
#!/usr/bin/perl use strict; use warnings; use 5.10.0; my @terms; while (<DATA>) { chomp; push @terms, [split /\s+/]; } my $biggest = 0; for my $term (sort sorter @terms) { if ($term->[2] > $biggest) { say join ' ', @$term; $biggest = $term->[2]; } } sub sorter { $a->[1] <=> $b->[1] || $b->[2] <=> $a->[2] } __DATA__ SEQ1 225 275 SEQ1 200 300 SEQ1 201 299 SEQ1 250 399 SEQ1 145 244 SEQ2 120 130 SEQ2 100 150 SEQ2 101 149 SEQ2 120 230 SEQ2 99 140
#11929 First ask yourself `How would I do this without a computer?' Then have the computer do it the same way.
In reply to Re: Discard if present within other coordinate range
by kennethk
in thread Discard if present within other coordinate range
by jnarayan81
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |