Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re: string similarity by using a function sort_by_similarity()

by shmem (Canon)
on Nov 08, 2009 at 12:20 UTC ( #805755=note: print w/replies, xml ) Need Help??

in reply to string similarity by using a function sort_by_similarity()

Hello roopa,

welcome to the monastery!
Please read the nodes given by gmargo above.

That said,

I am trying to compare string similarity based on the function sort_by_similarity().

It is next to impossible to help without a description (or better: code) of that subroutine. See I know what I mean. Why don't you?

I need to compare each of the strings in the inputsubs with the querysubs and get the best matching string for each of these strings using the function sort_by_similarity(),but I am unable to understand the value returned by the function and unable to access the values and print them.

I'm unable, too, since you provided no code. Anyways, thinking about the problem... here's how I would tackle it.

In Perl you want to use sort to sort a collection. sort optionally takes a subroutine or block which will carry out the comparison of the items to be sorted. That evaluation must return -1, 0, or 1, for sort to determine their order in the collection that will be returned. Inside that block or function the two items to be compared magically appear in the variables $a and $b.

Now, you want to sort a collection by similarity. Similarity is a relation between two elements. Sorting by that relation means: "are (a,b) more, less or equally similar to (a,c)?", i.e. sorting tuples by the amount of their similarity.

To do that you need a way to measure that similarity between the elements of a tuple, then you can sort the tuples by the amount of similarity.

use Math::Combinatorics qw( combine); my @collection; # list of strings my @tuples = combine( 2, @collection); my @similarity = sort { similarity($a) <=> similarity($b) } @tuples; sub similarity { my $tupel = shift; my $value; ... # determine similarity # between $tupel->[0] and $tupel->[1] # and store into $value ... return $value; }

To avoid the maybe expensive evaluation of similarity() for each tuple at each comparison, it is convenient to determine those beforehand. i.e. using the Schwartzian Transform (see map):

my @similarity = map { $_->[0] } sort { $a->[1] <=> $b->[1] } map { [ $_, similarity($_) ] } @tuples;

Further optimization comprises populating @tuples with indices into @collection, which is left as an exercise to the reader.

Replies are listed 'Best First'.
Re^2: string similarity by using a function sort_by_similarity()
by roopa (Initiate) on Nov 09, 2009 at 11:15 UTC
    Hello gmargo, I would like to explain my problem in detail as follows. I would like to compare a biological DNA sequence say, Input sequence: GATCAAGAGCCACAATATAGATGGTCCCACCGCACCGCTGGGCGTGCCCCCGGGGATTGTAAACGGGTTCCTTGCAACCCGCTGTCCAGCCCAGCTGATGTTATGGAATCTTCTGGCTCCCCGTATCCCCTCCAGGGACATCCTGCAGTGCAGCCTGGGACCCAGGTTTACAGTTCACTCCCAGCTTCTGCTGTGAGAACCCAGGAACCGGCACCCTGGGGATGG Query sequence with which I am comparing say, CTGAGGGGTGGCTCTCTGAAGAGGTGGGTTGCCCGTGAGCTGTTTTTACTGTCCTTGTTTGCCACTTATAAGGACTGGTTCCCCCCACCCCCAAGAGCAGCACAGATTCATAGCACCTGCTGCCTCCACCGAGCATCCCCCCTGCTCTGGAAAATCCTCCCTGCATCTGCAGCCTCGTACGTGCCTGAAGTCATTTGGTACCTGGGCGAGACCTTGCGGGGGGCC based on certain windowsize and threshold.If windowsize is 5,the sequence gets partitioned into strings of length 5 as follows. Input sequence strings(@inputsubs):-GATCA ATCAA TCAAG CAAGA AAGCG.... Query sequence strings(@querysubs):-CTGAG TGAGG GAGGG AGGGG GGGGT.... Now each string in the @inputsubs is being compared with each and every string in the @querysubs.If there are atleast 3(or more than 3) same bases i.e., three similar characters,then they can be grouped into an array i.e., here 3 is the threshold. So,I want all those strings which can show the similarity >=threshold.When I have used brute force method to compare the strings,by using count method.It was taking more time.So I tried to use the function sort_by_similarity By using this function,I could get the array of strings which are sorted in an ascending order ie., starting from strings that have strings of lowest similarity and ending with the strings that have highest similarity with the querystrings.But I would like to have only those strings which have a similarity >=threshold i.e., If input is abcdef,query is abcefg windowsize is 3,threshold is 2,I would like to have Output:- abc bcd def My code is as follows. use String::Similarity::Group ':all'; #use Smart::Comments '###'; print "Enter the input sequence\n"; chomp($input=<STDIN>); print "Enter the query sequence\n"; chomp($query=<STDIN>); print "Windowsize\n"; $ws=<STDIN>; print "Threshold\n"; $ts=<STDIN>; $ilength=length $input; $qlength=length $query; #print $qlength; for($i=0;$i<=$ilength-$ws;$i++){ #print "in"; push(@inputsubs,substr($input,$i,$ws)); } $r=@inputsubs; for($j=0;$j<=$qlength-$ws;$j++){ push(@querysubs,substr($query,$j,$ws)); } $s=@querysubs; for($t=0;$t<$s;$t++){ @b=sort_by_similarity(\@inputsubs,$querysubs$t); } $v=@b; for($i=0;$i<$v;$i++){ print "$b$i\n"; my($closestname,$match)=similarest(\@b,$querysubs$i); if($match>=0.66){ #print "$closestname\n"; } } Please suggest me in case of any improvements or other less time taking methods to get the desired output. Regards, Roopa.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://805755]
shmem rolls a barrel of beer into the refectorium at the request of jedikaiti
[Lady_Aleena]: Ratazong, you didn't know about Cookies?
[Lady_Aleena]: shmem, jedikaiti would appreciate that. 8)

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (10)
As of 2017-04-26 10:05 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (471 votes). Check out past polls.