Relation Neighbours Filter

This workflow filters a given Ondex graph based on some neighbour parameters supplied by the user. The result is a new Ondex graph. The parameters that can be used with this service are as follows:

graphId - the ID of the input Graph. outputGraphId - the ID of the output Graph. Optional parameter. If no output graph is specified filtered items will be removed from the input graph. Depth - The Depth (distance from seed in relations) to apply the filter to ConceptID - The Concept ID to seed the algorithm with (Optional). ConceptAccession - Concept accession to apply relation neighbours search to all matching concepts (Optional). ConceptClass - ConceptClass to look for Concepts within if accession or name has been specified (Optional). ConceptAccessionCV - CV to look for Concept accession within (Optional). ConceptName - Concept name to apply relation neighbours search to all matching concepts (Optional). RelationTypeAtDepth - Restricts RelationType at a given depth define by an array of pairs (depth1,rta;depth2,rtb...) when no relation type at a depth is specified the default is any allowed. A valid relation will contain the relation in its relation type set. Where possible define the RelationType, this will be faster (Optional).