NIH | National Cancer Institute | NCI Wiki  

Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

Section
Column
width75%

Anchor
ContentsofthisPage
ContentsofthisPage
Panel
titleContents of this Page
Table of Contents
minLevel2

Column
Include Page
LexEVS:LexEVS Code Pages to Include
LexEVS:LexEVS Code Pages to Include

Code Snippets

Supply the OWL manifest file URI

Include Page
LexEVS:SupplyOwlFileUri_Snippet
LexEVS:SupplyOwlFileUri_Snippet

Supply the non-OWL manifest file URI

Include Page
LexEVS:SupplyNonOwlFileUri_Snippet
LexEVS:SupplyNonOwlFileUri_Snippet

Find the immediate relations of a Concept

Include Page
LexEVS:ConceptImmediateRelations Snippet
LexEVS:ConceptImmediateRelations Snippet

Find the a given code, for example, code 'C1234' in the 'NCI Thesaurus' ontology

Include Page
LexEVS:FindGivenCode Snippet
LexEVS:FindGivenCode Snippet

Concept Resolution

Programmers access coded concepts by acquiring first a node set or graph. After specifying optional restrictions, the nodes in this set or graph can be resolved as a list of ConceptReference objects which in turn contain references to one or more Concept objects. The following example provides a simple query of concept codes:

Include Page
LexEVS:ConceptCodeQuery Snippet
LexEVS:ConceptCodeQuery Snippet

Service Metadata Retrieval

The LexEVS system maintains service metadata which can provide client programs with information about code system content and assigned copyright/licensing information. Below is an brief example showing how to access and print some of this metadata:

Include Page
LexEVS:ServiceMetadataRetrieval Snippet
LexEVS:ServiceMetadataRetrieval Snippet

Combinatorial Queries

One of the most powerful features of the LexEVS architecture is the ability to define multiple search and sort criteria without intermediate retrieval of data from the LexEVS service. Consider the following code snippet:

Include Page
LexEVS:CombinatorialQueries Snippet
LexEVS:CombinatorialQueries Snippet

Coded Node Graph Restriction

Include Page
LexEVS:CodedNodeGraphRestriction Snippet
LexEVS:CodedNodeGraphRestriction Snippet

Resolved Concept References Iterator

Include Page
LexEVS:ResolvedConceptReferencesIterator_Snippet
LexEVS:ResolvedConceptReferencesIterator_Snippet

Request Filter Match

Include Page
LexEVS:RequestFilterMatch_Snippet
LexEVS:RequestFilterMatch_Snippet

Request Filter

Include Page
LexEVS:RequestFilter_Snippet
LexEVS:RequestFilter_Snippet

Request Sort Compare

Include Page
LexEVS:RequestSortCompare_Snippet
LexEVS:RequestSortCompare_Snippet

Request Sort

Include Page
LexEVS:RequestSort_Snippet
LexEVS:RequestSort_Snippet

Concept Resolution

Include Page
LexEVS:ConceptResolution_Snippet
LexEVS:ConceptResolution_Snippet

Code Files

BuildTreeForCode

Attempts to provide a tree, based on a focus code, that includes the following information:

...

The second parameter is optional, and can indicate a hierarchy ID to navigate when resolving child nodes. If not provided, "is_a" is assumed.

CodingSchemeSelectionMenu

Displays a list of available coding schemes.

FindCodesForDescription

Example showing how to find codes matching descriptive text. The program accepts up to two parameters...

...

Example: FindCodesForDescription "blood" Example: FindCodesForDescription "breast cancer" "concept"

FindDescriptionForCode

Example showing how to find the entity description assigned to a specific code. The program accepts one parameter, the entity code.

FindPropsAndAssocForCode

Example showing how to find concept properties and associations based on a code.

FindRelatedCodes

Example showing how to find all concepts codes related to another code with distance 1.

Example showing how to find all concepts codes related to another code with distance 1, plus the Property Link relations.

FindRelatedNodesForTermAndAssoc

Example showing how to find all endpoints of a named association for which the given term matches as source or target.

Note: the match algorithm applied to the term is the standard lucene query syntax.

FindUMLSContextsForCUI

Example showing any source-asserted hierarchies (based on import of MRHIER HCD) for a CUI. The program takes a single argument (the UMLS CUI), prompts for the code system to query in the LexGrid repository, and displays the available hierarchical relationships.

ListHierarchy

Example showing how to determine and display an unsorted list of root and subsumed nodes, up to a specified depth, for hierarchical relationships.

...

The intent of the getHierarchy* methods on the LexBIGServiceConvenienceMethods interface is to simplify the process of hierarchy discovery and navigation. These methods significantly reduce the need to understand conventions for root nodes, associations, and direction of navigation for a specific source format.

ListHierarchyByCode

Example showing how to determine and display the hierarchical relationships for a specific code, ancestors or descendants, within a fixed distance.

...

The intent of the getHierarchy* methods on the LexBIGServiceConvenienceMethods interface is to simplify the process of hierarchy discovery and navigation. These methods significantly reduce the need to understand conventions for root nodes, associations, and direction of navigation for a specific source format.

ListHierarchyMetaBySource

Example showing how to determine and display an unsorted list of root and subsumed nodes, up to a specified depth, for hierarchical relationships. It is written specifically to handle display of relationships for a designated source within the NCI Metathesaurus.

...

The second parameter must provide the source abbreviation (SAB) of the Metathesaurus source to be evaluated (e.g. ICD9CM, MDR, SNOMEDCT).

ListHierarchyPathToRoot

Example showing how to determine and display paths from a given concept back to defined root nodes through any hierarchies registered for the coding scheme.

...

The intent of the getHierarchy* methods on the LexBIGServiceConvenienceMethods interface is to simplify the process of hierarchy discovery and navigation. These methods significantly reduce the need to understand conventions for root nodes, associations, and direction of navigation for a specific source format.

MetaDataSearch

Example how to query stored metadata for a code system. For the example, use the LoadSampleMetaDataData.bat to load the required code system and metadata.

MetaMatch

Example attempting to approximate some characteristics of the Metaphrase search algorithm. However, full Metaphrase compatibility is not anticipated.

ProfileScheme

Requires loading valid scheme (must have root node named @ pointing to top nodes) Profiles a coding scheme based on unique URN, version, relation and scheme name.

Note: If the URN and version values are unspecified, a list of available coding schemes will be presented for user selection.

ScoredIterator

Used to wrap scored results for consumption as a standard ResolvedConceptReferenceIterator.

ScoredTerm

Used to manage and sort search results based on a scoring algorithm.

ScoreTerm

Example showing a simple scoring algorithm that evaluates a provided term against available terms in a code system. A cutoff percentage can optionally be provided.

SoundsLike

Example showing how to list concepts with presentation text that 'sounds like' a specified value.

Util

Utility functions to support the examples.</html>

Scrollbar
iconsfalse