3 # Copyright (C) 2007 Martin A. Hansen.
5 # This program is free software; you can redistribute it and/or
6 # modify it under the terms of the GNU General Public License
7 # as published by the Free Software Foundation; either version 2
8 # of the License, or (at your option) any later version.
10 # This program is distributed in the hope that it will be useful,
11 # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 # GNU General Public License for more details.
15 # You should have received a copy of the GNU General Public License
16 # along with this program; if not, write to the Free Software
17 # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
19 # http://www.gnu.org/copyleft/gpl.html
22 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> DESCRIPTION <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
25 # Stuff for interacting with UCSC genome browser
28 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>><<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
32 use vars qw ( @ISA @EXPORT );
35 use Time::HiRes qw( gettimeofday );
62 @ISA = qw( Exporter );
64 my $TIME = gettimeofday();
67 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> BED format <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
70 # http://genome.ucsc.edu/goldenPath/help/hgTracksHelp.html#BED
73 sub bed_entry_get_array
75 # Martin A. Hansen, September 2008.
77 # Reads a BED entry given a filehandle.
79 # This is a new _faster_ BED entry parser that
80 # uses arrays and not hashrefs.
82 # IMPORTANT! This function does not correct the
83 # BED_END position that is kept the way UCSC
86 my ( $fh, # file handle
87 $cols, # columns to read - OPTIONAL (3,4,5,6, or 12)
96 $line =~ tr/\n\r//d; # some people have carriage returns in their BED files -> Grrrr
98 return if not defined $line;
100 if ( not defined $cols ) {
101 $cols = 1 + $line =~ tr/\t//;
104 @entry = split "\t", $line, $cols + 1;
106 pop @entry if scalar @entry > $cols;
108 return wantarray ? @entry : \@entry;
114 # Martin A. Hansen, December 2007.
116 # Reads a bed entry given a filehandle.
118 my ( $fh, # file handle
119 $columns, # number of BED columns to read - OPTIONAL
124 my ( $line, @fields, %entry );
128 $line =~ tr/\n\r//d; # some people have carriage returns in their BED files -> Grrrr
130 return if not defined $line;
132 @fields = split "\t", $line;
134 $columns ||= scalar @fields;
139 "CHR" => $fields[ 0 ],
140 "CHR_BEG" => $fields[ 1 ],
141 "CHR_END" => $fields[ 2 ] - 1,
144 elsif ( $columns == 4 )
147 "CHR" => $fields[ 0 ],
148 "CHR_BEG" => $fields[ 1 ],
149 "CHR_END" => $fields[ 2 ] - 1,
150 "Q_ID" => $fields[ 3 ],
153 elsif ( $columns == 5 )
156 "CHR" => $fields[ 0 ],
157 "CHR_BEG" => $fields[ 1 ],
158 "CHR_END" => $fields[ 2 ] - 1,
159 "Q_ID" => $fields[ 3 ],
160 "SCORE" => $fields[ 4 ],
163 elsif ( $columns == 6 )
166 "CHR" => $fields[ 0 ],
167 "CHR_BEG" => $fields[ 1 ],
168 "CHR_END" => $fields[ 2 ] - 1,
169 "Q_ID" => $fields[ 3 ],
170 "SCORE" => $fields[ 4 ],
171 "STRAND" => $fields[ 5 ],
174 elsif ( $columns == 12 )
177 "CHR" => $fields[ 0 ],
178 "CHR_BEG" => $fields[ 1 ],
179 "CHR_END" => $fields[ 2 ] - 1,
180 "Q_ID" => $fields[ 3 ],
181 "SCORE" => $fields[ 4 ],
182 "STRAND" => $fields[ 5 ],
183 "THICK_BEG" => $fields[ 6 ],
184 "THICK_END" => $fields[ 7 ] - 1,
185 "ITEMRGB" => $fields[ 8 ],
186 "BLOCKCOUNT" => $fields[ 9 ],
187 "BLOCKSIZES" => $fields[ 10 ],
188 "Q_BEGS" => $fields[ 11 ],
193 Maasha::Common::error( qq(Bad BED format in line->$line<-) );
196 $entry{ "REC_TYPE" } = "BED";
197 $entry{ "BED_LEN" } = $entry{ "CHR_END" } - $entry{ "CHR_BEG" } + 1;
198 $entry{ "BED_COLS" } = $columns;
200 return wantarray ? %entry : \%entry;
206 # Martin A. Hansen, January 2008.
208 # Given a path to a BED file, read in all entries
211 my ( $path, # full path to BED file
212 $columns, # number of columns in BED file - OPTIONAL (but is faster)
217 my ( $fh, $entry, @list );
219 $fh = Maasha::Common::read_open( $path );
221 while ( $entry = bed_get_entry( $fh ) ) {
227 return wantarray ? @list : \@list;
231 sub bed_entry_put_array
233 # Martin A. Hansen, Septermber 2008.
235 # Writes a BED entry array to file.
237 # IMPORTANT! This function does not correct the
238 # BED_END position that is assumed to be in the
239 # UCSC positions scheme.
242 $fh, # file handle - OPTIONAL
243 $cols, # number of columns in BED file - OPTIONAL
248 $fh = \*STDOUT if not defined $fh;
250 if ( defined $cols ) {
251 print $fh join( "\t", @{ $record }[ 0 .. $cols - 1 ] ), "\n";
253 print $fh join( "\t", @{ $record } ), "\n";
260 # Martin A. Hansen, Septermber 2007.
262 # Writes a BED entry to file.
264 # NB, this could really be more robust!?
266 my ( $record, # hashref
267 $fh, # file handle - OPTIONAL
268 $columns, # number of columns in BED file - OPTIONAL (but is faster)
275 $columns ||= 12; # max number of columns possible
279 push @fields, $record->{ "CHR" };
280 push @fields, $record->{ "CHR_BEG" };
281 push @fields, $record->{ "CHR_END" } + 1;
283 elsif ( $columns == 4 )
285 $record->{ "Q_ID" } =~ s/\s+/_/g;
287 push @fields, $record->{ "CHR" };
288 push @fields, $record->{ "CHR_BEG" };
289 push @fields, $record->{ "CHR_END" } + 1;
290 push @fields, $record->{ "Q_ID" };
292 elsif ( $columns == 5 )
294 $record->{ "Q_ID" } =~ s/\s+/_/g;
295 $record->{ "SCORE" } =~ s/\.\d*//;
297 push @fields, $record->{ "CHR" };
298 push @fields, $record->{ "CHR_BEG" };
299 push @fields, $record->{ "CHR_END" } + 1;
300 push @fields, $record->{ "Q_ID" };
301 push @fields, $record->{ "SCORE" };
303 elsif ( $columns == 6 )
305 $record->{ "Q_ID" } =~ s/\s+/_/g;
306 $record->{ "SCORE" } =~ s/\.\d*//;
308 push @fields, $record->{ "CHR" };
309 push @fields, $record->{ "CHR_BEG" };
310 push @fields, $record->{ "CHR_END" } + 1;
311 push @fields, $record->{ "Q_ID" };
312 push @fields, $record->{ "SCORE" };
313 push @fields, $record->{ "STRAND" };
317 $record->{ "Q_ID" } =~ s/\s+/_/g;
318 $record->{ "SCORE" } =~ s/\.\d*//;
320 push @fields, $record->{ "CHR" };
321 push @fields, $record->{ "CHR_BEG" };
322 push @fields, $record->{ "CHR_END" } + 1;
323 push @fields, $record->{ "Q_ID" };
324 push @fields, $record->{ "SCORE" };
325 push @fields, $record->{ "STRAND" };
326 push @fields, $record->{ "THICK_BEG" } if defined $record->{ "THICK_BEG" };
327 push @fields, $record->{ "THICK_END" } + 1 if defined $record->{ "THICK_END" };
328 push @fields, $record->{ "ITEMRGB" } if defined $record->{ "ITEMRGB" };
329 push @fields, $record->{ "BLOCKCOUNT" } if defined $record->{ "BLOCKCOUNT" };
330 push @fields, $record->{ "BLOCKSIZES" } if defined $record->{ "BLOCKSIZES" };
331 push @fields, $record->{ "Q_BEGS" } if defined $record->{ "Q_BEGS" };
335 print $fh join( "\t", @fields ), "\n";
337 print join( "\t", @fields ), "\n";
344 # Martin A. Hansen, January 2008.
346 # Write a list of BED entries.
348 my ( $entries, # list of entries,
349 $fh, # file handle - OPTIONAL
354 map { bed_put_entry( $_, $fh ) } @{ $entries };
360 # Martin A. Hansen, March 2008.
362 # Given a bed record, analysis this to give information
363 # about intron/exon sizes.
365 my ( $entry, # BED entry
370 my ( $i, @begs, @lens, $exon_max, $exon_min, $exon_len, $exon_tot, $intron_max, $intron_min, $intron_len, $intron_tot );
373 $exon_min = 9999999999;
375 $intron_min = 9999999999;
377 $entry->{ "EXONS" } = $entry->{ "BLOCKCOUNT" };
379 @begs = split /,/, $entry->{ "Q_BEGS" };
380 @lens = split /,/, $entry->{ "BLOCKSIZES" };
382 for ( $i = 0; $i < $entry->{ "BLOCKCOUNT" }; $i++ )
384 $exon_len = @lens[ $i ];
386 $entry->{ "EXON_LEN_$i" } = $exon_len;
388 $exon_max = $exon_len if $exon_len > $exon_max;
389 $exon_min = $exon_len if $exon_len < $exon_min;
391 $exon_tot += $exon_len;
394 $entry->{ "EXON_LEN_-1" } = $exon_len;
395 $entry->{ "EXON_MAX_LEN" } = $exon_max;
396 $entry->{ "EXON_MIN_LEN" } = $exon_min;
397 $entry->{ "EXON_MEAN_LEN" } = int( $exon_tot / $entry->{ "EXONS" } );
399 $entry->{ "INTRONS" } = $entry->{ "BLOCKCOUNT" } - 1;
400 $entry->{ "INTRONS" } = 0 if $entry->{ "INTRONS" } < 0;
402 if ( $entry->{ "INTRONS" } )
404 for ( $i = 1; $i < $entry->{ "BLOCKCOUNT" }; $i++ )
406 $intron_len = @begs[ $i ] - ( @begs[ $i - 1 ] + @lens[ $i - 1 ] );
408 $entry->{ "INTRON_LEN_" . ( $i - 1 ) } = $intron_len;
410 $intron_max = $intron_len if $intron_len > $intron_max;
411 $intron_min = $intron_len if $intron_len < $intron_min;
413 $intron_tot += $intron_len;
416 $entry->{ "INTRON_LEN_-1" } = $intron_len;
417 $entry->{ "INTRON_MAX_LEN" } = $intron_max;
418 $entry->{ "INTRON_MIN_LEN" } = $intron_min;
419 $entry->{ "INTRON_MEAN_LEN" } = int( $intron_tot / $entry->{ "INTRONS" } );
422 return wantarray ? %{ $entry } : $entry;
428 # Martin A. Hansen, Septermber 2008
430 # Sorts a BED file using the c program
431 # "bed_sort" specifing a sort mode:
433 # 1: chr AND chr_beg.
434 # 2: chr AND strand AND chr_beg.
436 # 4: strand AND chr_beg.
438 my ( $bed_file, # BED file to sort
439 $sort_mode, # See above.
440 $cols, # Number of columns in BED file
443 &Maasha::Common::run( "bed_sort", "--sort $sort_mode --cols $cols $bed_file" );
447 sub bed_split_to_files
449 # Martin A. Hansen, Septermber 2008
451 # Given a list of BED files, split these
452 # into temporary files based on the chromosome
453 # name. Returns a list of the temporary files.
455 my ( $bed_files, # list of BED files to split
456 $cols, # number of columns
457 $tmp_dir, # temporary directory
462 my ( $bed_file, $fh_in, $entry, $key, %fh_hash, @tmp_files );
464 foreach $bed_file ( @{ $bed_files } )
466 $fh_in = Maasha::Common::read_open( $bed_file );
468 while ( $entry = bed_entry_get_array( $fh_in, $cols ) )
470 $key = $entry->[ CHR ];
472 $fh_hash{ $key } = Maasha::Common::write_open( "$tmp_dir/$key.temp" ) if not exists $fh_hash{ $key };
474 bed_entry_put_array( $entry, $fh_hash{ $key } );
480 foreach $key ( sort keys %fh_hash )
482 push @tmp_files, "$tmp_dir/$key.temp";
484 close $fh_hash{ $key };
487 return wantarray ? @tmp_files : \@tmp_files;
491 sub bed_merge_entries
493 # Martin A. Hansen, February 2008.
495 # Merge a list of given BED entries in one big entry.
497 my ( $entries, # list of BED entries to be merged
502 my ( $i, @q_ids, @q_begs, @blocksizes, @new_q_begs, @new_blocksizes, %new_entry );
504 @{ $entries } = sort { $a->{ "CHR_BEG" } <=> $b->{ "CHR_BEG" } } @{ $entries };
506 for ( $i = 0; $i < @{ $entries }; $i++ )
508 Maasha::Common::error( qq(Attempted merge of BED entries from different chromosomes) ) if $entries->[ 0 ]->{ "CHR" } ne $entries->[ $i ]->{ "CHR" };
509 Maasha::Common::error( qq(Attempted merge of BED entries from different strands) ) if $entries->[ 0 ]->{ "STRAND" } ne $entries->[ $i ]->{ "STRAND" };
511 push @q_ids, $entries->[ $i ]->{ "Q_ID" } || sprintf( "ID%06d", $i );
513 if ( exists $entries->[ $i ]->{ "Q_BEGS" } )
515 @q_begs = split ",", $entries->[ $i ]->{ "Q_BEGS" };
516 @blocksizes = split ",", $entries->[ $i ]->{ "BLOCKSIZES" };
521 @blocksizes = $entries->[ $i ]->{ "CHR_END" } - $entries->[ $i ]->{ "CHR_BEG" } + 1;
524 map { $_ += $entries->[ $i ]->{ "CHR_BEG" } } @q_begs;
526 push @new_q_begs, @q_begs;
527 push @new_blocksizes, @blocksizes;
530 map { $_ -= $entries->[ 0 ]->{ "CHR_BEG" } } @new_q_begs;
533 CHR => $entries->[ 0 ]->{ "CHR" },
534 CHR_BEG => $entries->[ 0 ]->{ "CHR_BEG" },
535 CHR_END => $entries->[ -1 ]->{ "CHR_END" },
537 BED_LEN => $entries->[ -1 ]->{ "CHR_END" } - $entries->[ 0 ]->{ "CHR_BEG" } + 1,
539 Q_ID => join( ":", @q_ids ),
541 STRAND => $entries->[ 0 ]->{ "STRAND" } || "+",
542 THICK_BEG => $entries->[ 0 ]->{ "THICK_BEG" } || $entries->[ 0 ]->{ "CHR_BEG" },
543 THICK_END => $entries->[ -1 ]->{ "THICK_END" } || $entries->[ -1 ]->{ "CHR_END" },
545 BLOCKCOUNT => scalar @new_q_begs,
546 BLOCKSIZES => join( ",", @new_blocksizes ),
547 Q_BEGS => join( ",", @new_q_begs ),
550 return wantarray ? %new_entry : \%new_entry;
556 # Martin A. Hansen, February 2008.
558 # Splits a given BED entry into a list of blocks,
559 # which are returned. A list of 6 column BED entry is returned.
561 my ( $entry, # BED entry hashref
566 my ( @q_begs, @blocksizes, $block, @blocks, $i );
568 if ( exists $entry->{ "BLOCKCOUNT" } )
570 @q_begs = split ",", $entry->{ "Q_BEGS" };
571 @blocksizes = split ",", $entry->{ "BLOCKSIZES" };
573 for ( $i = 0; $i < @q_begs; $i++ )
577 $block->{ "CHR" } = $entry->{ "CHR" };
578 $block->{ "CHR_BEG" } = $entry->{ "CHR_BEG" } + $q_begs[ $i ];
579 $block->{ "CHR_END" } = $entry->{ "CHR_BEG" } + $q_begs[ $i ] + $blocksizes[ $i ] - 1;
580 $block->{ "Q_ID" } = $entry->{ "Q_ID" } . sprintf( "_%03d", $i );
581 $block->{ "SCORE" } = $entry->{ "SCORE" };
582 $block->{ "STRAND" } = $entry->{ "STRAND" };
583 $block->{ "BED_LEN" } = $block->{ "CHR_END" } - $block->{ "CHR_BEG" } + 1,
584 $block->{ "BED_COLS" } = 6;
585 $block->{ "REC_TYPE" } = "BED";
587 push @blocks, $block;
592 @blocks = @{ $entry };
595 return wantarray ? @blocks : \@blocks;
602 # Martin A. Hansen, February 2008.
604 # Checks if two BED entries overlap and
605 # return 1 if so - else 0;
607 my ( $entry1, # hashref
609 $no_strand, # don't check strand flag - OPTIONAL
614 return 0 if $entry1->{ "CHR" } ne $entry2->{ "CHR" };
615 return 0 if $entry1->{ "STRAND" } ne $entry2->{ "STRAND" };
617 if ( $entry1->{ "CHR_END" } < $entry2->{ "CHR_BEG" } or $entry1->{ "CHR_BEG" } > $entry2->{ "CHR_END" } ) {
625 sub bed_upload_to_ucsc
627 # Martin A. Hansen, September 2007.
629 # Upload a BED file to the UCSC database.
631 my ( $tmp_dir, # temporary directory
632 $file, # file to upload,
633 $options, # argument hashref
634 $append, # flag indicating table should be appended
639 my ( $args, $table, $sql_file, $fh_out, $fh_in );
642 $args = join " ", $options->{ "database" }, $options->{ "table" }, "-tmpDir=$tmp_dir", "-oldTable", $file;
644 $args = join " ", $options->{ "database" }, $options->{ "table" }, "-tmpDir=$tmp_dir", $file;
647 if ( $options->{ "sec_struct" } )
649 $table = $options->{ "table" };
651 Maasha::Common::error( "Attempt to load secondary structure track without 'rnaSecStr' in table name" ) if not $table =~ /rnaSecStr/;
653 $sql_file = "$tmp_dir/upload_RNA_SS.sql";
655 $fh_out = Maasha::Common::write_open( $sql_file );
658 CREATE TABLE $table (
659 bin smallint not null, # Bin number for browser speedup
660 chrom varchar(255) not null, # Chromosome or FPC contig
661 chromStart int unsigned not null, # Start position in chromosome
662 chromEnd int unsigned not null, # End position in chromosome
663 name varchar(255) not null, # Name of item
664 score int unsigned not null, # Score from 0-1000
665 strand char(1) not null, # + or -
666 size int unsigned not null, # Size of element.
667 secStr longblob not null, # Parentheses and '.'s which define the secondary structure
668 conf longblob not null, # Confidence of secondary-structure annotation per position (0.0-1.0).
671 INDEX(chrom(8), bin),
672 INDEX(chrom(8), chromStart)
678 Maasha::Common::run( "hgLoadBed", "-notItemRgb -sqlTable=$sql_file $options->{ 'database' } $options->{ 'table' } -tmpDir=$tmp_dir $file > /dev/null 2>&1" );
684 Maasha::Common::run( "hgLoadBed", "$args > /dev/null 2>&1" );
689 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PSL format <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
694 # Martin A. Hansen, August 2008.
696 # Reads PSL next entry from a PSL file and returns a record.
698 my ( $fh, # file handle of PSL filefull path to PSL file
703 my ( $line, @fields, %record );
705 while ( $line = <$fh> )
709 @fields = split "\t", $line;
711 if ( scalar @fields == 21 )
715 MATCHES => $fields[ 0 ],
716 MISMATCHES => $fields[ 1 ],
717 REPMATCHES => $fields[ 2 ],
718 NCOUNT => $fields[ 3 ],
719 QNUMINSERT => $fields[ 4 ],
720 QBASEINSERT => $fields[ 5 ],
721 SNUMINSERT => $fields[ 6 ],
722 SBASEINSERT => $fields[ 7 ],
723 STRAND => $fields[ 8 ],
724 Q_ID => $fields[ 9 ],
725 Q_LEN => $fields[ 10 ],
726 Q_BEG => $fields[ 11 ],
727 Q_END => $fields[ 12 ] - 1,
728 S_ID => $fields[ 13 ],
729 S_LEN => $fields[ 14 ],
730 S_BEG => $fields[ 15 ],
731 S_END => $fields[ 16 ] - 1,
732 BLOCKCOUNT => $fields[ 17 ],
733 BLOCKSIZES => $fields[ 18 ],
734 Q_BEGS => $fields[ 19 ],
735 S_BEGS => $fields[ 20 ],
738 $record{ "SCORE" } = $record{ "MATCHES" } + int( $record{ "REPMATCHES" } / 2 ) - $record{ "MISMATCHES" } - $record{ "QNUMINSERT" } - $record{ "SNUMINSERT" };
740 return wantarray ? %record : \%record;
750 # Martin A. Hansen, February 2008.
752 # Reads PSL entries and returns a list of records.
754 my ( $path, # full path to PSL file
759 my ( $fh, @lines, @fields, $i, %record, @records );
761 $fh = Maasha::Common::read_open( $path );
769 for ( $i = 5; $i < @lines; $i++ )
771 @fields = split "\t", $lines[ $i ];
773 Maasha::Common::error( qq(Bad PSL format in file "$path") ) if not @fields == 21;
779 MATCHES => $fields[ 0 ],
780 MISMATCHES => $fields[ 1 ],
781 REPMATCHES => $fields[ 2 ],
782 NCOUNT => $fields[ 3 ],
783 QNUMINSERT => $fields[ 4 ],
784 QBASEINSERT => $fields[ 5 ],
785 SNUMINSERT => $fields[ 6 ],
786 SBASEINSERT => $fields[ 7 ],
787 STRAND => $fields[ 8 ],
788 Q_ID => $fields[ 9 ],
789 Q_LEN => $fields[ 10 ],
790 Q_BEG => $fields[ 11 ],
791 Q_END => $fields[ 12 ] - 1,
792 S_ID => $fields[ 13 ],
793 S_LEN => $fields[ 14 ],
794 S_BEG => $fields[ 15 ],
795 S_END => $fields[ 16 ] - 1,
796 BLOCKCOUNT => $fields[ 17 ],
797 BLOCKSIZES => $fields[ 18 ],
798 Q_BEGS => $fields[ 19 ],
799 S_BEGS => $fields[ 20 ],
802 $record{ "SCORE" } = $record{ "MATCHES" } + int( $record{ "REPMATCHES" } / 2 ) - $record{ "MISMATCHES" } - $record{ "QNUMINSERT" } - $record{ "SNUMINSERT" };
804 push @records, { %record };
807 return wantarray ? @records : \@records;
813 # Martin A. Hansen, September 2007.
815 # Write a PSL header to file.
817 my ( $fh, # file handle - OPTIONAL
822 $fh = \*STDOUT if not $fh;
824 print $fh qq(psLayout version 3
825 match mis- rep. N's Q gap Q gap T gap T gap strand Q Q Q Q T T T T block blockSizes qStart match match count bases count bases name size start end name size start end count
826 ---------------------------------------------------------------------------------------------------------------------------------------------------------------
833 # Martin A. Hansen, September 2007.
835 # Write a PSL entry to file.
837 my ( $record, # hashref
838 $fh, # file handle - OPTIONAL
843 $fh = \*STDOUT if not $fh;
847 push @output, $record->{ "MATCHES" };
848 push @output, $record->{ "MISMATCHES" };
849 push @output, $record->{ "REPMATCHES" };
850 push @output, $record->{ "NCOUNT" };
851 push @output, $record->{ "QNUMINSERT" };
852 push @output, $record->{ "QBASEINSERT" };
853 push @output, $record->{ "SNUMINSERT" };
854 push @output, $record->{ "SBASEINSERT" };
855 push @output, $record->{ "STRAND" };
856 push @output, $record->{ "Q_ID" };
857 push @output, $record->{ "Q_LEN" };
858 push @output, $record->{ "Q_BEG" };
859 push @output, $record->{ "Q_END" } + 1;
860 push @output, $record->{ "S_ID" };
861 push @output, $record->{ "S_LEN" };
862 push @output, $record->{ "S_BEG" };
863 push @output, $record->{ "S_END" } + 1;
864 push @output, $record->{ "BLOCKCOUNT" };
865 push @output, $record->{ "BLOCKSIZES" };
866 push @output, $record->{ "Q_BEGS" };
867 push @output, $record->{ "S_BEGS" };
869 print $fh join( "\t", @output ), "\n";
873 sub psl_upload_to_ucsc
875 # Martin A. Hansen, September 2007.
877 # Upload a PSL file to the UCSC database.
879 my ( $file, # file to upload,
880 $options, # argument hashref
881 $append, # flag indicating table should be appended
889 $args = join " ", $options->{ "database" }, "-table=$options->{ 'table' }", "-clientLoad", "-append", $file;
891 $args = join " ", $options->{ "database" }, "-table=$options->{ 'table' }", "-clientLoad", $file;
894 Maasha::Common::run( "hgLoadPsl", "$args > /dev/null 2>&1" );
898 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> TRACK FILE <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
903 # Martin A. Hansen, September 2007.
905 # Update the /home/user/ucsc/my_tracks.ra file and executes makeCustomTracks.pl
907 my ( $options, # hashref
913 my ( $file, $fh_in, $fh_out, $line, $time );
915 $file = $ENV{ "HOME" } . "/ucsc/my_tracks.ra";
917 # ---- create a backup ----
919 $fh_in = Maasha::Common::read_open( $file );
920 $fh_out = Maasha::Common::write_open( "$file~" );
922 while ( $line = <$fh_in> ) {
929 # ---- append track ----
931 $time = Maasha::Common::time_stamp();
933 $fh_out = Maasha::Common::append_open( $file );
935 if ( $type eq "sec_struct" )
937 print $fh_out "\n\n# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>><<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\n";
939 print $fh_out "\n# Track added by 'upload_to_ucsc' $time\n\n";
941 print $fh_out "# Database $options->{ 'database' }\n\n";
943 print $fh_out "track $options->{ 'table' }\n";
944 print $fh_out "shortLabel $options->{ 'short_label' }\n";
945 print $fh_out "longLabel $options->{ 'long_label' }\n";
946 print $fh_out "group $options->{ 'group' }\n";
947 print $fh_out "priority $options->{ 'priority' }\n";
948 print $fh_out "visibility $options->{ 'visibility' }\n";
949 print $fh_out "color $options->{ 'color' }\n";
950 print $fh_out "type bed 6 +\n";
951 print $fh_out "mafTrack multiz17way\n";
953 print $fh_out "\n# //\n";
957 print $fh_out "\n\n# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>><<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\n";
959 print $fh_out "\n# Track added by 'upload_to_ucsc' $time\n\n";
961 print $fh_out "# Database $options->{ 'database' }\n\n";
963 print $fh_out "track $options->{ 'table' }\n";
964 print $fh_out "shortLabel $options->{ 'short_label' }\n";
965 print $fh_out "longLabel $options->{ 'long_label' }\n";
966 print $fh_out "group $options->{ 'group' }\n";
967 print $fh_out "priority $options->{ 'priority' }\n";
968 print $fh_out "useScore 1\n" if $options->{ 'use_score' };
969 print $fh_out "visibility $options->{ 'visibility' }\n";
970 print $fh_out "maxHeightPixels 50:50:11\n" if $type eq "wig 0";
971 print $fh_out "color $options->{ 'color' }\n";
972 print $fh_out "type $type\n";
974 print $fh_out "\n# //\n";
979 Maasha::Common::run( "ucscMakeTracks.pl", "-b > /dev/null 2>&1" );
983 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> fixedStep format <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
986 sub fixedstep_get_entry
988 # Martin A. Hansen, December 2007.
990 # Given a file handle to a PhastCons file get the
991 # next entry which is all the lines after a "fixedStep"
992 # line and until the next "fixedStep" line or EOF.
994 my ( $fh, # filehandle
997 # Returns a list of lines
999 my ( $entry, @lines );
1001 local $/ = "\nfixedStep ";
1007 @lines = split "\n", $entry;
1009 return if @lines == 0;
1011 $lines[ 0 ] =~ s/fixedStep?\s*//;
1013 return wantarray ? @lines : \@lines;
1017 sub fixedstep_index_create
1019 # Martin A. Hansen, January 2008.
1021 # Indexes a concatenated fixedStep file.
1022 # The index consists of a hash with chromosomes as keys,
1023 # and a list of [ chr_beg, next_chr_beg, chr_end, index_beg, index_len ] as values.
1025 my ( $path, # path to fixedStep file
1030 my ( $fh, $pos, $index_beg, $index_len, $entry, $locator, $chr, $step, $beg, $end, $len, %index, $i );
1032 $fh = Maasha::Common::read_open( $path );
1036 while ( $entry = Maasha::UCSC::fixedstep_get_entry( $fh ) )
1038 $locator = shift @{ $entry };
1040 if ( $locator =~ /chrom=([^ ]+) start=(\d+) step=(\d+)/ )
1043 $beg = $2 - 1; # fixedStep files are 1-based
1048 Maasha::Common::error( qq(Could not parse locator: $locator) );
1051 $pos += length( $locator ) + 11;
1055 # map { $pos += length( $_ ) + 1 } @{ $entry };
1057 $pos += 6 * scalar @{ $entry };
1059 $index_len = $pos - $index_beg;
1061 push @{ $index{ $chr } }, [ $beg, undef, $beg + scalar @{ $entry } - 1, $index_beg, $index_len ];
1066 foreach $chr ( keys %index )
1068 for ( $i = 0; $i < @{ $index{ $chr } } - 1; $i++ ) {
1069 $index{ $chr }->[ $i ]->[ NEXT_CHR_BEG ] = $index{ $chr }->[ $i + 1 ]->[ 0 ];
1072 $index{ $chr }->[ -1 ]->[ NEXT_CHR_BEG ] = $index{ $chr }->[ -1 ]->[ CHR_END ] + 1;
1075 return wantarray ? %index : \%index;
1079 sub fixedstep_index_store
1081 # Martin A. Hansen, January 2008.
1083 # Writes a fixedStep index to binary file.
1085 my ( $path, # full path to file
1086 $index, # list with index
1091 Maasha::Common::file_store( $path, $index );
1095 sub fixedstep_index_retrieve
1097 # Martin A. Hansen, January 2008.
1099 # Retrieves a fixedStep index from binary file.
1101 my ( $path, # full path to file
1108 $index = Maasha::Common::file_retrieve( $path );
1110 return wantarray ? %{ $index } : $index;
1114 sub fixedStep_index_lookup
1116 # Martin A. Hansen, January 2008.
1118 # Retrieve fixedStep scores from a indexed
1119 # fixedStep file given a chromosome and
1120 # begin and end positions.
1122 my ( $index, # data structure
1123 $fh, # filehandle to datafile
1125 $chr_beg, # chromosome beg
1126 $chr_end, # chromosome end
1127 $flank, # include flanking region - OPTIONAL
1132 my ( $index_beg, $index_end, $i, $c, $beg, $end, @vals, $scores );
1139 # print "chr_beg->$chr_beg chr_end->$chr_end flank->$flank\n";
1141 if ( exists $index->{ $chr } )
1143 $index_beg = Maasha::Matrix::interval_search( $index->{ $chr }, 0, 1, $chr_beg );
1145 if ( $index_beg < 0 ) {
1146 Maasha::Common::error( qq(Index search failed - begin index position doesn't exists: $chr_beg) );
1149 if ( $chr_end < $index->{ $chr }->[ $index_beg ]->[ 1 ] )
1151 $index_end = $index_beg;
1155 $index_end = Maasha::Matrix::interval_search( $index->{ $chr }, 0, 1, $chr_end );
1157 if ( $index_end < 0 ) {
1158 Maasha::Common::error( qq(Index search failed - end index position doesn't exists: $chr_end) );
1162 map { $scores->[ $_ ] = 0 } 0 .. $chr_end - $chr_beg;
1164 if ( $index_beg == $index_end )
1166 $beg = Maasha::Calc::max( $chr_beg, $index->{ $chr }->[ $index_beg ]->[ CHR_BEG ] );
1167 $end = Maasha::Calc::min( $chr_end, $index->{ $chr }->[ $index_end ]->[ CHR_END ] );
1169 if ( $beg <= $index->{ $chr }->[ $index_beg ]->[ CHR_END ] and $end >= $index->{ $chr }->[ $index_beg ]->[ CHR_BEG ] )
1171 @vals = split "\n", Maasha::Common::file_read(
1173 $index->{ $chr }->[ $index_beg ]->[ INDEX_BEG ] + 6 * ( $beg - $index->{ $chr }->[ $index_beg ]->[ CHR_BEG ] ),
1174 6 * ( $end - $beg + 1 ),
1178 for ( $c = 0; $c < @vals; $c++ ) {
1179 $scores->[ $c + $beg - $chr_beg ] = $vals[ $c ];
1184 $beg = Maasha::Calc::max( $chr_beg, $index->{ $chr }->[ $index_beg ]->[ CHR_BEG ] );
1186 # print Dumper( $beg, $index->{ $chr }->[ $index_beg ] );
1187 # print Dumper( "next", $index->{ $chr }->[ $index_beg ]->[ NEXT_CHR_BEG ] );
1193 if ( $beg <= $index->{ $chr }->[ $index_beg ]->[ CHR_END ] )
1195 @vals = split "\n", Maasha::Common::file_read(
1197 $index->{ $chr }->[ $index_beg ]->[ INDEX_BEG ] + 6 * ( $beg - $index->{ $chr }->[ $index_beg ]->[ CHR_BEG ] ),
1198 6 * ( $index->{ $chr }->[ $index_beg ]->[ CHR_END ] - $beg + 1 ),
1201 for ( $c = 0; $c < @vals; $c++ ) {
1202 $scores->[ $c + $beg - $chr_beg ] = $vals[ $c ];
1206 $end = Maasha::Calc::min( $chr_end, $index->{ $chr }->[ $index_end ]->[ CHR_END ] );
1208 if ( $end <= $index->{ $chr }->[ $index_end ]->[ CHR_END ] )
1210 @vals = split "\n", Maasha::Common::file_read(
1212 $index->{ $chr }->[ $index_end ]->[ INDEX_BEG ],
1213 6 * ( $end - $index->{ $chr }->[ $index_end ]->[ CHR_BEG ] + 1 ),
1216 for ( $c = 0; $c < @vals; $c++ ) {
1217 $scores->[ $c + $index->{ $chr }->[ $index_end ]->[ CHR_BEG ] - $chr_beg ] = $vals[ $c ];
1221 for ( $i = $index_beg + 1; $i <= $index_end - 1; $i++ )
1223 @vals = split "\n", Maasha::Common::file_read(
1225 $index->{ $chr }->[ $i ]->[ INDEX_BEG ],
1226 6 * ( $index->{ $chr }->[ $i ]->[ CHR_END ] - $index->{ $chr }->[ $i ]->[ CHR_BEG ] + 1 ),
1229 for ( $c = 0; $c < @vals; $c++ ) {
1230 $scores->[ $c + $index->{ $chr }->[ $i ]->[ CHR_BEG ] - $chr_beg ] = $vals[ $c ];
1237 Maasha::Common::error( qq(Chromosome "$chr" was not found in index) );
1240 return wantarray ? @{ $scores } : $scores;
1244 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> PhastCons format <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
1249 # Martin A. Hansen, July 2008
1251 # Create a fixedStep index for PhastCons data.
1253 my ( $file, # file to index
1254 $dir, # dir with file
1261 $index = fixedstep_index_create( "$dir/$file" );
1263 fixedstep_index_store( "$dir/$file.index", $index );
1267 sub phastcons_parse_entry
1269 # Martin A. Hansen, December 2007.
1271 # Given a PhastCons entry converts this to a
1272 # list of super blocks.
1274 my ( $lines, # list of lines
1275 $args, # argument hash
1280 my ( $info, $chr, $beg, $step, $i, $c, $j, @blocks, @super_blocks, @entries, $super_block, $block, @lens, @begs );
1282 $info = shift @{ $lines };
1284 if ( $info =~ /^chrom=([^ ]+) start=(\d+) step=(\d+)$/ )
1290 die qq(ERROR: step size $step != 1 -> problem!\n) if $step != 1; # in an ideal world should would be fixed ...
1295 while ( $i < @{ $lines } )
1297 if ( $lines->[ $i ] >= $args->{ "threshold" } )
1301 while ( $c < @{ $lines } )
1303 if ( $lines->[ $c ] < $args->{ "threshold" } )
1307 while ( $j < @{ $lines } and $lines->[ $j ] < $args->{ "threshold" } ) {
1311 if ( $j - $c > $args->{ "gap" } )
1313 if ( $c - $i >= $args->{ "min" } )
1317 CHR_BEG => $beg + $i - 1,
1318 CHR_END => $beg + $c - 2,
1336 if ( $c - $i >= $args->{ "min" } )
1340 CHR_BEG => $beg + $i - 1,
1341 CHR_END => $beg + $c - 2,
1356 while ( $i < @blocks )
1360 while ( $c < @blocks and $blocks[ $c ]->{ "CHR_BEG" } - $blocks[ $c - 1 ]->{ "CHR_END" } <= $args->{ "dist" } )
1365 push @super_blocks, [ @blocks[ $i .. $c - 1 ] ];
1370 foreach $super_block ( @super_blocks )
1372 foreach $block ( @{ $super_block } )
1374 push @begs, $block->{ "CHR_BEG" } - $super_block->[ 0 ]->{ "CHR_BEG" };
1375 push @lens, $block->{ "CHR_LEN" } - 1;
1381 CHR => $super_block->[ 0 ]->{ "CHR" },
1382 CHR_BEG => $super_block->[ 0 ]->{ "CHR_BEG" },
1383 CHR_END => $super_block->[ -1 ]->{ "CHR_END" },
1387 THICK_BEG => $super_block->[ 0 ]->{ "CHR_BEG" },
1388 THICK_END => $super_block->[ -1 ]->{ "CHR_END" } + 1,
1389 ITEMRGB => "0,200,100",
1390 BLOCKCOUNT => scalar @{ $super_block },
1391 BLOCKSIZES => join( ",", @lens ),
1392 Q_BEGS => join( ",", @begs ),
1399 return wantarray ? @entries : \@entries;
1403 sub phastcons_normalize
1405 # Martin A. Hansen, January 2008.
1407 # Normalizes a list of lists with PhastCons scores,
1408 # in such a way that each list contains the same number
1409 # or PhastCons scores.
1411 my ( $AoA, # AoA with PhastCons scores
1416 my ( $list, $max, $min, $mean, $diff );
1421 foreach $list ( @{ $AoA } )
1423 $min = scalar @{ $list } if scalar @{ $list } < $min;
1424 $max = scalar @{ $list } if scalar @{ $list } > $max;
1427 $mean = int( ( $min + $max ) / 2 );
1429 # print STDERR "min->$min max->$max mean->$mean\n";
1431 foreach $list ( @{ $AoA } )
1433 $diff = scalar @{ $list } - $mean;
1435 phastcons_list_inflate( $list, abs( $diff ) ) if $diff < 0;
1436 phastcons_list_deflate( $list, $diff ) if $diff > 0;
1439 return wantarray ? @{ $AoA } : $AoA;
1443 sub phastcons_list_inflate
1445 # Martin A. Hansen, January 2008.
1447 # Inflates a list with a given number of elements
1448 # in such a way that the extra elements are introduced
1449 # evenly over the entire length of the list. The value
1450 # of the extra elements is based on a mean of the
1451 # adjacent elements.
1453 my ( $list, # list of elements
1454 $diff, # number of elements to introduce
1459 my ( $len, $space, $i, $pos );
1461 $len = scalar @{ $list };
1463 $space = $len / $diff;
1465 for ( $i = 0; $i < $diff; $i++ )
1467 $pos = int( ( $space / 2 ) + $i * $space );
1469 splice @{ $list }, $pos, 0, ( $list->[ $pos - 1 ] + $list->[ $pos + 1 ] ) / 2;
1470 # splice @{ $list }, $pos, 0, "X";
1473 die qq(ERROR: bad inflate\n) if scalar @{ $list } != $len + $diff;
1477 sub phastcons_list_deflate
1479 # Martin A. Hansen, January 2008.
1481 # Deflates a list by removing a given number of elements
1482 # evenly distributed over the entire list.
1484 my ( $list, # list of elements
1485 $diff, # number of elements to remove
1490 my ( $len, $space, $i, $pos );
1492 $len = scalar @{ $list };
1494 $space = ( $len - $diff ) / $diff;
1496 for ( $i = 0; $i < $diff; $i++ )
1498 $pos = int( ( $space / 2 ) + $i * $space );
1500 splice @{ $list }, $pos, 1;
1503 die qq(ERROR: bad deflate\n) if scalar @{ $list } != $len - $diff;
1509 # Martin A. Hansen, January 2008.
1511 # Given a normalized PhastCons matrix in an AoA,
1512 # calculate the mean for each column and return as a list.
1514 my ( $AoA, # AoA with normalized PhastCons scores
1521 $AoA = Maasha::Matrix::matrix_flip( $AoA );
1523 map { push @list, Maasha::Calc::mean( $_ ) } @{ $AoA };
1525 return wantarray ? @list : \@list;
1529 sub phastcons_median
1531 # Martin A. Hansen, January 2008.
1533 # Given a normalized PhastCons matrix in an AoA,
1534 # calculate the median for each column and return as a list.
1536 my ( $AoA, # AoA with normalized PhastCons scores
1543 $AoA = Maasha::Matrix::matrix_flip( $AoA );
1545 map { push @list, Maasha::Calc::median( $_ ) } @{ $AoA };
1547 return wantarray ? @list : \@list;
1551 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> MULTIPLE ALIGNMENT FILES <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
1556 # Martin A. Hansen, April 2008.
1558 # Executes mafFrag to extract a subalignment from a multiz track
1559 # in the UCSC genome browser database.
1561 my ( $tmp_dir, # temporary directory
1562 $database, # genome database
1563 $table, # table with the multiz track
1565 $beg, # begin position
1566 $end, # end position
1570 # Returns a list of record
1572 my ( $tmp_file, $align );
1574 $tmp_file = "$tmp_dir/maf_extract.maf";
1576 Maasha::Common::run( "mafFrag", "$database $table $chr $beg $end $strand $tmp_file" );
1578 $align = maf_parse( $tmp_file );
1582 return wantarray ? @{ $align } : $align;
1588 # Martin A. Hansen, April 2008.
1591 my ( $path, # full path to MAF file
1594 # Returns a list of record.
1596 my ( $fh, $line, @fields, @align );
1598 $fh = Maasha::Common::read_open( $path );
1600 while ( $line = <$fh> )
1604 if ( $line =~ /^s/ )
1606 @fields = split / /, $line;
1609 SEQ_NAME => $fields[ 1 ],
1610 SEQ => $fields[ -1 ],
1612 ALIGN_LEN => length $fields[ -1 ],
1619 return wantarray ? @align : \@align;
1623 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WIGGLE FORMAT <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
1626 sub fixedstep_put_entry
1628 # Martin A. Hansen, April 2008.
1630 # Outputs a block of fixedStep values.
1631 # Used for outputting wiggle data.
1633 my ( $chr, # chromosome
1634 $beg, # start position
1635 $block, # list of scores
1636 $fh, # filehandle - OPTIONAL
1637 $log10, # flag indicating that log10 scores should be used
1642 $beg += 1; # fixedStep format is 1 based.
1646 print $fh "fixedStep chrom=$chr start=$beg step=1\n";
1649 map { printf( $fh "%f\n", Maasha::Calc::log10( $_ + 1 ) ) } @{ $block };
1651 map { printf( $fh "%d\n", ( $_ + 1 ) ) } @{ $block };
1656 sub wiggle_upload_to_ucsc
1658 # Martin A. Hansen, May 2008.
1660 # Upload a wiggle file to the UCSC database.
1662 my ( $tmp_dir, # temporary directory
1663 $wib_dir, # wib directory
1664 $wig_file, # file to upload,
1665 $options, # argument hashref
1672 # $args = join " ", "-tmpDir=$tmp_dir", "-pathPrefix=$wib_dir", $options->{ "database" }, $options->{ 'table' }, $wig_file;
1674 # Maasha::Common::run( "hgLoadWiggle", "$args > /dev/null 2>&1" );
1676 if ( $options->{ 'verbose' } ) {
1677 `cd $tmp_dir && hgLoadWiggle -tmpDir=$tmp_dir -pathPrefix=$wib_dir $options->{ 'database' } $options->{ 'table' } $wig_file`;
1679 `cd $tmp_dir && hgLoadWiggle -tmpDir=$tmp_dir -pathPrefix=$wib_dir $options->{ 'database' } $options->{ 'table' } $wig_file > /dev/null 2>&1`;
1684 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> MySQL CONF <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<
1689 # Martin A. Hansen, May 2008
1691 # Fetches the MySQL database user name from the
1692 # .hg.conf file in the users home directory.
1696 my ( $fh, $line, $user );
1698 $fh = Maasha::Common::read_open( "$ENV{ 'HOME' }/.hg.conf" );
1700 while ( $line = <$fh> )
1704 if ( $line =~ /^db\.user=(.+)/ )
1718 sub ucsc_get_password
1720 # Martin A. Hansen, May 2008
1722 # Fetches the MySQL database password from the
1723 # .hg.conf file in the users home directory.
1727 my ( $fh, $line, $password );
1729 $fh = Maasha::Common::read_open( "$ENV{ 'HOME' }/.hg.conf" );
1731 while ( $line = <$fh> )
1735 if ( $line =~ /^db\.password=(.+)/ )
1749 # >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>><<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<