Source code

Download source archive ↓

resources/META-INF/galaxy-operator.json

1{"categories": ["Galaxy", "Bioinformatics"], "description": "Find IUPAC nucleotide motifs in FASTA and emit zero-based half-open BED6 locations.", "documentation": {"example_job": "name: Find IUPAC nucleotide motifs in FASTA and emit zero-based half-open BED6 locations.\nsteps:\n- id: read\n  operator: read_item@1.0\n  inputs: {}\n  params:\n    uri: context:/galaxy/extended/find_subsequences.txt\n    view: bytes\n- id: process\n  operator: galaxy_find_subsequences@1.0\n  inputs:\n    source: read\n  params:\n    pattern: AC\n    strand: both\noutputs:\n  result: process\n", "inputs": {"source": "UTF-8 bytes stream. Uses reverse complement for reverse-strand search, correcting the upstream complement-only bug. Overlapping hits are consistently included. Maximum one million candidate comparisons per record times pattern length is bounded to 64 million."}, "outputs": {"result": "Find IUPAC nucleotide motifs in FASTA and emit zero-based half-open BED6 locations. Uses reverse complement for reverse-strand search, correcting the upstream complement-only bug. Overlapping hits are consistently included. Maximum one million candidate comparisons per record times pattern length is bounded to 64 million."}, "parameters": {"pattern": {"description": "Literal text or IUPAC DNA motif, as described by this operator.", "example": "AC", "help": "Literal text or IUPAC DNA motif, as described by this operator. Uses reverse complement for reverse-strand search, correcting the upstream complement-only bug. Overlapping hits are consistently included. Maximum one million candidate comparisons per record times pattern length is bounded to 64 million."}, "strand": {"description": "Search forward, reverse-complement, or both strands.", "example": "both", "help": "Search forward, reverse-complement, or both strands. Uses reverse complement for reverse-strand search, correcting the upstream complement-only bug. Overlapping hits are consistently included. Maximum one million candidate comparisons per record times pattern length is bounded to 64 million."}}}, "entrypoint": "xstream.galaxy.FindSubsequences", "fixture": {"data": ">g title\nACGT\n", "expected": "g\t0\t2\tg title\t\t+\ng\t2\t4\tg title\t\t-\n", "params": {"pattern": "AC", "strand": "both"}}, "icon": {"color": "#5265ad", "path": "M4 3h12l4 4v14H4zM8 11h8M8 15h8m-8 4h5"}, "name": "galaxy_find_subsequences", "parameters": {"additionalProperties": false, "properties": {"pattern": {"default": "AC", "description": "Literal text or IUPAC DNA motif, as described by this operator.", "maxLength": 128, "type": "string"}, "strand": {"default": "both", "description": "Search forward, reverse-complement, or both strands.", "enum": ["both", "forward", "reverse"], "maxLength": 4096, "type": "string"}}, "required": [], "type": "object"}, "params": {"pattern": "AC", "strand": "both"}, "scope": "Uses reverse complement for reverse-strand search, correcting the upstream complement-only bug. Overlapping hits are consistently included. Maximum one million candidate comparisons per record times pattern length is bounded to 64 million.", "upstream": {"path": "find_subsequences/find_subsequences.py", "repository": "https://github.com/bgruening/galaxytools"}, "version": "1.0"}