Source code

Download source archive ↓

resources/META-INF/galaxy-operator.json

1{"categories": ["Galaxy", "Bioinformatics", "Alignments"], "description": "Compute local affine-gap pairwise DNA alignment.", "documentation": {"example_job": "name: Compute local affine-gap pairwise DNA alignment.\nsteps:\n- id: read\n  operator: read_item@1.0\n  inputs: {}\n  params:\n    uri: context:/galaxy/extended/emboss_water.txt\n    view: bytes\n- id: read_reference\n  operator: read_item@1.0\n  inputs: {}\n  params:\n    uri: context:/galaxy/extended/emboss_water-reference.txt\n    view: bytes\n- id: process\n  operator: galaxy_emboss_water@1.0\n  inputs:\n    source: read\n    reference: read_reference\n  params: {}\noutputs:\n  result: process\n", "inputs": {"reference": "UTF-8 bytes stream. Local Smith-Waterman/Gotoh; score gap(k)=open+(k-1)*extend. At most 1000000 DP cells; deterministic first maximum. Zero-score alignments emit empty sequences with zero coordinates. Exactly one nonempty ACGT FASTA record per source/reference Arrow bytes input. Uppercase-normalized output; each sequence <=1000000 characters. No protein substitution matrices, database searches or native subprocesses.", "source": "UTF-8 bytes stream. Local Smith-Waterman/Gotoh; score gap(k)=open+(k-1)*extend. At most 1000000 DP cells; deterministic first maximum. Zero-score alignments emit empty sequences with zero coordinates. Exactly one nonempty ACGT FASTA record per source/reference Arrow bytes input. Uppercase-normalized output; each sequence <=1000000 characters. No protein substitution matrices, database searches or native subprocesses."}, "outputs": {"result": "Compute local affine-gap pairwise DNA alignment. Local Smith-Waterman/Gotoh; score gap(k)=open+(k-1)*extend. At most 1000000 DP cells; deterministic first maximum. Zero-score alignments emit empty sequences with zero coordinates. Exactly one nonempty ACGT FASTA record per source/reference Arrow bytes input. Uppercase-normalized output; each sequence <=1000000 characters. No protein substitution matrices, database searches or native subprocesses."}, "parameters": {"gap_extend": {"description": "Cost per additional gap base.", "example": 1, "help": "Cost per additional gap base. Local Smith-Waterman/Gotoh; score gap(k)=open+(k-1)*extend. At most 1000000 DP cells; deterministic first maximum. Zero-score alignments emit empty sequences with zero coordinates. Exactly one nonempty ACGT FASTA record per source/reference Arrow bytes input. Uppercase-normalized output; each sequence <=1000000 characters. No protein substitution matrices, database searches or native subprocesses."}, "gap_open": {"description": "Cost of opening a one-base gap.", "example": 3, "help": "Cost of opening a one-base gap. Local Smith-Waterman/Gotoh; score gap(k)=open+(k-1)*extend. At most 1000000 DP cells; deterministic first maximum. Zero-score alignments emit empty sequences with zero coordinates. Exactly one nonempty ACGT FASTA record per source/reference Arrow bytes input. Uppercase-normalized output; each sequence <=1000000 characters. No protein substitution matrices, database searches or native subprocesses."}, "match_score": {"description": "Score for an identical nucleotide.", "example": 2, "help": "Score for an identical nucleotide. Local Smith-Waterman/Gotoh; score gap(k)=open+(k-1)*extend. At most 1000000 DP cells; deterministic first maximum. Zero-score alignments emit empty sequences with zero coordinates. Exactly one nonempty ACGT FASTA record per source/reference Arrow bytes input. Uppercase-normalized output; each sequence <=1000000 characters. No protein substitution matrices, database searches or native subprocesses."}, "mismatch_score": {"description": "Score for a nucleotide mismatch.", "example": -1, "help": "Score for a nucleotide mismatch. Local Smith-Waterman/Gotoh; score gap(k)=open+(k-1)*extend. At most 1000000 DP cells; deterministic first maximum. Zero-score alignments emit empty sequences with zero coordinates. Exactly one nonempty ACGT FASTA record per source/reference Arrow bytes input. Uppercase-normalized output; each sequence <=1000000 characters. No protein substitution matrices, database searches or native subprocesses."}}}, "entrypoint": "xstream.galaxy.EmbossWater", "fixture": {"data": ">query\nACGT\n", "expected": ">query score=8.000000 start=1 end=4\nACGT\n>reference score=8.000000 start=1 end=4\nACGT\n", "inputs": {"reference": ">reference\nACGT\n"}, "params": {}}, "icon": {"color": "#5265ad", "path": "M4 3h12l4 4v14H4zM8 11h8M8 15h8m-8 4h5"}, "implementation": "AlignmentScience", "inputs": {"reference": {"formats": [], "representations": ["bytes"]}, "source": {"formats": [], "representations": ["bytes"]}}, "name": "galaxy_emboss_water", "parameters": {"additionalProperties": false, "properties": {"gap_extend": {"default": 1, "description": "Cost per additional gap base.", "maximum": 100, "minimum": 1, "type": "integer"}, "gap_open": {"default": 3, "description": "Cost of opening a one-base gap.", "maximum": 100, "minimum": 1, "type": "integer"}, "match_score": {"default": 2, "description": "Score for an identical nucleotide.", "maximum": 100, "minimum": 1, "type": "integer"}, "mismatch_score": {"default": -1, "description": "Score for a nucleotide mismatch.", "maximum": 0, "minimum": -100, "type": "integer"}}, "required": [], "type": "object"}, "params": {}, "scope": "Local Smith-Waterman/Gotoh; score gap(k)=open+(k-1)*extend. At most 1000000 DP cells; deterministic first maximum. Zero-score alignments emit empty sequences with zero coordinates. Exactly one nonempty ACGT FASTA record per source/reference Arrow bytes input. Uppercase-normalized output; each sequence <=1000000 characters. No protein substitution matrices, database searches or native subprocesses.", "upstream": {"path": "tools/emboss_5/emboss_water.xml", "repository": "https://github.com/galaxyproject/tools-iuc"}, "version": "1.0"}