- LICENSE AND COPYRIGHT
Text::MostFreqKDistance - Estimate strings similarity.
In information theory, MostFreqKDistance is a string metric technique for quickly estimating how similar two ordered sets or strings are.The scheme was invented by Sadi Evren SEKER(2014) and initially used in text mining applications like author recognition.
use strict; use warnings; use Text::MostFreqKDistance; print MostFreqKHashing('seeking', 2), "\n"; print MostFreqKHashing('research', 2), "\n"; print MostFreqKSDF('seeking', 'research', 2, 10), "\n";
The method is suitable for bioinformatics to compare the genetic strings like in FASTA format.
use strict; use warnings; use Text::MostFreqKDistance; my $str1 = 'LCLYTHIGRNIYYGSYLYSETWNTGIMLLLITMATAFMGYVLPWGQMSFWGATVITNLFSAIPYIGTNLV'; my $str2 = 'EWIWGGFSVDKATLNRFFAFHFILPFTMVALAGVHLTFLHETGSNNPLGLTSDSDKIPFHPYYTIKDFLG'; print MostFreqKHashing($str1, 2), "\n"; print MostFreqKHashing($str2, 2), "\n"; print MostFreqKSDF($str1, $str2, 2, 10), "\n";
It simply gets an input
$str and an integer
$k value. It outputs the most frequent
$k characters from the input string. The only condition during the creation of output string is adding the first occurring character first, if the frequencies of two characters are equal.
use strict; use warnings; use Text::MostFreqKDistance; print MostFreqKHashing('seeking', 2), "\n"; print MostFreqKHashing('research', 2), "\n";
Mohammad S Anwar,
<mohammad.anwar at yahoo.com>
Please report any bugs or feature requests to
bug-text-mostfreqkdistance at rt.cpan.org, or through the web interface at http://rt.cpan.org/NoAuth/ReportBug.html?Queue=Text-MostFreqKDistance. I will be notified and then you'll automatically be notified of progress on your bug as I make changes.
You can find documentation for this module with the perldoc command.
You can also look for information at:
RT: CPAN's request tracker (report bugs here)
AnnoCPAN: Annotated CPAN documentation
Copyright (C) 2015 - 2017 Mohammad S Anwar.
This program is free software; you can redistribute it and / or modify it under the terms of the the Artistic License (2.0). You may obtain a copy of the full license at:
Any use, modification, and distribution of the Standard or Modified Versions is governed by this Artistic License.By using, modifying or distributing the Package, you accept this license. Do not use, modify, or distribute the Package, if you do not accept this license.
If your Modified Version has been derived from a Modified Version made by someone other than you,you are nevertheless required to ensure that your Modified Version complies with the requirements of this license.
This license does not grant you the right to use any trademark, service mark, tradename, or logo of the Copyright Holder.
This license includes the non-exclusive, worldwide, free-of-charge patent license to make, have made, use, offer to sell, sell, import and otherwise transfer the Package with respect to any patent claims licensable by the Copyright Holder that are necessarily infringed by the Package. If you institute patent litigation (including a cross-claim or counterclaim) against any party alleging that the Package constitutes direct or contributory patent infringement,then this Artistic License to you shall terminate on the date that such litigation is filed.
Disclaimer of Warranty: THE PACKAGE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS "AS IS' AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES. THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT ARE DISCLAIMED TO THE EXTENT PERMITTED BY YOUR LOCAL LAW. UNLESS REQUIRED BY LAW, NO COPYRIGHT HOLDER OR CONTRIBUTOR WILL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING IN ANY WAY OUT OF THE USE OF THE PACKAGE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.