Mercurial > repos > bgruening > hicexplorer_hicmergeloops
diff hicMergeLoops.xml @ 2:59d3fa4c16f5 draft
"planemo upload for repository https://github.com/galaxyproject/tools-iuc/tree/master/tools/hicexplorer commit 4b602d427e0fc0da5353a4510798349de98e4ae4"
author | iuc |
---|---|
date | Wed, 11 Mar 2020 17:03:53 -0400 |
parents | 49b82255b72f |
children | 94b552c6830a |
line wrap: on
line diff
--- a/hicMergeLoops.xml Wed Feb 05 19:47:27 2020 -0500 +++ b/hicMergeLoops.xml Wed Mar 11 17:03:53 2020 -0400 @@ -10,7 +10,7 @@ ln -s '$loopfile' '${counter}_loop_file.bedgraph' && #end for #set $m = ' '.join([ '\'%s_loop_file.bedgraph\'' % $counter for $counter, $inputfile in enumerate($inputFiles) ]) - + @BINARY@ --inputFiles $m --lowestResolution $lowestResolution @@ -19,11 +19,11 @@ <inputs> <param argument="--inputFiles" type="data" format='bed' label="Loop files to merge" - help="The loop files from hicDetectLoops. To use files from other sources, + help="The loop files from hicDetectLoops. To use files from other sources, please follow \'chr start end chr start end\' format and remove any header." multiple="true" /> <param argument="--lowestResolution" type="integer" value="" label="Lowest used resolution" - help='The lowest resolution of all loop files, i.e. 5kb, 10kb and 25kb, please use 25000.'/> + help='The lowest resolution of all loop files, i.e. 5kb, 10kb and 25kb, please use 25000.'/> </inputs> <outputs> <data name="mergedLoops" from_work_dir="merged_loops.bedgraph" format="bed" label="${tool.name} on [${on_string}]: Merged loops"/> @@ -42,12 +42,12 @@ This script merges the loop locations of different different resolutions. -Loops need to have format as follows: +Loops need to have the following format: chr start end chr start end -A merge happens if x and y position of a loop overlap with x and y position of another loop; all loops are considered as an overlap within +/- the bin size of the lowest resolution. -I.e. for a loop with coordinates x and y, the overlap to all other loops is search for (x - lowest resolution) and (y + lowest resolution). +A merge happens if x and y position of a loop overlaps with x and y position of another loop; all loops are considered as an overlap within +/- the bin size of the lowest resolution. +I.e. for a loop with coordinates x and y, the overlap to all other loops is searched for (x - lowest resolution) and (y + lowest resolution). If two or more locations should be merged, the one with the lowest resolution is taken as the merged loop. Example usage: