# HG changeset patch # User hathkul # Date 1482777446 18000 # Node ID 6540565ae995b4fe2eab181605135d7cf8c44bfe # Parent 0d1cf9024f0e3ebcfd22f972e8226917b0d927bb Uploaded diff -r 0d1cf9024f0e -r 6540565ae995 rapidcluster --- a/rapidcluster Mon Dec 26 11:05:18 2016 -0500 +++ b/rapidcluster Mon Dec 26 13:37:26 2016 -0500 @@ -128,7 +128,7 @@ print "**************************************************\n"; print "Total number of sequences to cluster: $entries.\n"; print "Total number of clusters to find: $max_clusters.\n"; - print "Cluster\tUnique Sequences\tReads\tRPM\tLevenshtein\tTime\n"; + print "Cluster\tUnique Sequences\tReads\tRPM\tLevenshtein\n"; } @@ -167,7 +167,6 @@ my $comparison_seq_rpm = $comparison_seq_metrics[2]; ## Take RPM to tally cluster size my $distance = levenshtein( $current_seq_info[1], $comparison_seq_info[1] ); ## sends comparison sequence to compare against current seed sequence, returns distances -# print "calculation number $levecounter. Distance between $current_seq_info[1] and $comparison_seq_info[1] is $distance \n"; $levecounter++; if ( $distance > $defined_edit_distance ) { ## If distance is greater than defined push @keepers, $_; ## Add to array for comparison in next iteration @@ -181,7 +180,7 @@ } } - unless ($quiet) { print "$current_cluster\t$cluster_rank\t$current_cluster_reads\t$current_cluster_rpm\t$defined_edit_distance\t"; } + unless ($quiet) { print "$current_cluster\t$cluster_rank\t$current_cluster_reads\t$current_cluster_rpm\t$defined_edit_distance\n"; } ## Display cluster number, number of unique sequences, reads and RPM $current_cluster++; ## Increment cluster number prior to next cluster @@ -196,9 +195,9 @@ my $duration = time - $start; ## Calculates how much time has elapsed since start unless ($quiet) { ## Displays summary report unless -q is invoked -# print "\nInput file: \"$infile\".\n"; -# print "Output file: \"$outfile\".\n"; - print "$duration\n"; + print "\nInput file: \"$infile\".\n"; + print "Output file: \"$outfile\".\n"; + print "Execution time: $duration s.\n";; } ####################################################################################