NAME

WebService::UMLSKS::FormGraph - Form a graph by accepting parents and siblings from UMLS.

SYNOPSIS

Basic Usage

    use WebService::UMLSKS::FormGraph; 
    use WebService::UMLSKS::GetUserData;   
    
    # Creating object of class GetUserData 
        my $g = WebService::UMLSKS::GetUserData->new;
    
    $t1 = valid input CUI1;
    $t2 = valid input CUI2;
    $service = $g->getUserDetails($verbose);
    @sources,@relations,@directions,@attributes = read from configuration;
    $allowable_pattern_regex = read from pattern file;
    $test_flag = 1 for testing else 0;
   
    my $return_val = 
    form_graph-> form_graph($t1,$t2,$service, $verbose, \@sources, \@relations,\@directions
                        ,\@attributes,$allowable_pattern_regex,$test_flag);

DESCRIPTION

This module forms a graph of concepts connected to input concepts. It accepts the list of parents, children and siblings from GetNeighbors module. This module calls GetAllowablePaths module and finds the shortest allowable path between the input CUIs or concepts. It then calculates the semantic relatedness between the concepts using the shortest allowable path information.

SUBROUTINES

The subroutines are as follows:

new

This sub creates a new object of FormGraph.

form_graph

This sub gets neighbors for the input concepts and forms graph. It also calculates the semantic relatedness between the concepts.

printQueue

This subroutines prints the current contents of queue

call_getconceptproperties

This subroutines queries webservice getConceptProperties

printHoH

This subroutines prints the current contents of hash of hash

SEE ALSO

ValidateTerm.pm GetUserData.pm Query.pm ws-getUMLSInfo.pl FormGraph.pm GetAllowablePath.pm

AUTHORS

Mugdha Choudhari, University of Minnesota Duluth <chou0130 at d.umn.edu>

Ted Pedersen, University of Minnesota Duluth <tpederse at d.umn.edu>

COPYRIGHT

Copyright (C) 2011, Mugdha Choudhari, Ted Pedersen

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, write to The Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.