<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/37610?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/37610?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/7288/critical-to-discoveries-in-bioinformatics</guid>
	<pubDate>Mon, 16 Dec 2013 17:13:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/7288/critical-to-discoveries-in-bioinformatics</link>
	<title><![CDATA[Critical to discoveries in bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/MnKvMP8CeSQ" frameborder="0" allowfullscreen></iframe>EMBL-EBI distributes datasets worldwide using the Janet network. This biological data enables the discovery of new drugs, new diagnostics and increasingly new agro-chemicals.  Their work, which includes the 1000-genome project, has generated petabytes of data and this growth is showing no signs of abating.  On-demand bandwidth over Janet will therefore be critical to their ongoing work.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/7812/bioinformatics-infrastructure-speed-up-indian-agriculture</guid>
	<pubDate>Tue, 07 Jan 2014 12:44:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/7812/bioinformatics-infrastructure-speed-up-indian-agriculture</link>
	<title><![CDATA[Bioinformatics infrastructure speed up Indian agriculture]]></title>
	<description><![CDATA[<p>"<span>Realizing the paradigm shift it can bring about, the government is focusing on increased bioinformatics intervention in agri-sciences. Currently under process, the national grid on bioinformatics is expected make much better sense out of huge genomic" - </span></p><p><span></span><a href="http://www.biospectrumindia.com/biospecindia/features/203849/supercomputing-indian-agriculture-fast-track-mode/page/1">http://www.biospectrumindia.com/biospecindia/features/203849/supercomputing-indian-agriculture-fast-track-mode/page/1</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7483/research-associate-indian-institute-of-spices-research</guid>
  <pubDate>Wed, 25 Dec 2013 12:34:43 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate @ INDIAN INSTITUTE OF SPICES RESEARCH]]></title>
  <description><![CDATA[
<p>INDIAN INSTITUTE OF SPICES RESEARCH<br />(Indian Council of Agricultural Research)<br />Marikunnu P.O., Kozhikode – 673 012, Kerala</p>

<p>WALK -IN- TEST CUM INTERVIEW</p>

<p>Walk- in- Test cum Interview (based on test) for the selection of Research Associate (Bioinformatics) &amp; Bioinformatic Trainees under the scheme ‘Distributed Information Sub Centre- DISC’ will be held at this Institute as per details indicated below.</p>

<p>Research Associate</p>

<p>Date of Interview : 21 -01-2014 at 10.00 A.M</p>

<p>Qualifications : a) Essential: Doctorate degree in Bioinformatics or Biotechnology/Life Sciences/Biochemistry with expertise in  Bioinformatics as evidenced by publications.</p>

<p>OR</p>

<p>Three years research experience after MVSc/MPharm/ME/MTech with Bioinformatics  Specialization.</p>

<p>b Desirable: Experience in handling NGS data  Programming skills in Python/Bioperl</p>

<p>Emoluments : Rs:22000/- per month + HRA (higher pay upto Rs.24000/- can be paid  depending on the qualifications and experience.</p>

<p>Upper age limit : 40 years for Men &amp; 45 years for Women as on date of Interview (Upper Age limits are relaxable for SC, ST and OBC candidates as per Govt. of India norms (at present 5 years for SC/ST and 3 years for OBC)</p>

<p>Duration of Project : Till the closure of the project.</p>

<p>General Terms and conditions</p>

<p>1. The above positions are purely on temporary basis and is co-terminus with the closure of the project. There is no provision of re-employment after termination of project. The selected candidate will not have any right for claiming pay scale or absorption against any regular post being vacant on a later date at this Institute.<br />2 . No TA/DA will be paid for attending the Interview.<br />3. Canvassing in any form will lead to cancellation of candidate.<br />4. The decision of Director, IISR would be final and binding in all aspects.<br />5. Candidates will not be permitted to enter the Examination Hall after 10.00 A.M.<br />6. Candidates who secure the minimum marks prescribed by the Institute in written test  only will be eligible for calling for the interview. The number of candidates to be  called for the interview will be decided by the Director of the Institute.<br />7 Those who do not possess original Degree/PG certificate or Provisional certificate will not be allowed to attend the Test/Interview.</p>

<p>Note: All relevant certificates (in original) and bio data<br />No objection certificate in case he/she is employed elsewhere and experience certificate in original (if any) need to be produced at the time of interview.<br />Location of IISR Kozhikode Main Campus - Pallithazham bus stop between Moozhikkal East and Chelavoor on the NH 212 ”Kozhikode - Kollegal” Road.</p>

<p>Advertisement:  www.spices.res.in/pdf/DISC-Website.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/17885/international-conference-on-bioinformatics-models-methods-and-algorithms</guid>
	<pubDate>Sun, 05 Oct 2014 11:42:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17885/international-conference-on-bioinformatics-models-methods-and-algorithms</link>
	<title><![CDATA[International Conference on Bioinformatics Models, Methods and Algorithms]]></title>
	<description><![CDATA[<p><span>The purpose of the International Conference on Bioinformatics Models, Methods and Algorithms is to bring together researchers and practitioners interested in the application of computational systems and information technologies to the field of molecular biology, including for example the use of statistics and algorithms to understanding biological processes and systems, with a focus on new developments in genome bioinformatics and computational biology. Areas of interest for this community include sequence analysis, biostatistics, image analysis, scientific data management and data mining, machine learning, pattern recognition, computational evolutionary biology, computational genomics and other related fields.</span></p>
<p><span><span>Position Paper Submission Extension:</span><span>&nbsp;</span><span>October 9, 2014</span><span>&nbsp;</span><br><span>Regular Paper Authors Notification:</span><span>&nbsp;</span><span>November 3, 2014</span><span>&nbsp;</span><br><span>Position Paper Authors Notification:</span><span>&nbsp;</span><span>November 6, 2014</span><span>&nbsp;</span><br><span>Regular and Position Paper Camera Ready and Registration:</span><span>&nbsp;</span><span>November 17, 2014</span><span>&nbsp;</span></span></p><p>Address of the bookmark: <a href="http://www.bioinformatics.biostec.org/" rel="nofollow">http://www.bioinformatics.biostec.org/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/7913/the-genome-factory</guid>
	<pubDate>Thu, 16 Jan 2014 02:09:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/7913/the-genome-factory</link>
	<title><![CDATA[The genome factory !!!]]></title>
	<description><![CDATA[<p>Illumina, Inc. announced Tuesday that its new HiSeq X Ten Sequencing System has broken the &ldquo;sound barrier&rdquo; of human genomics by enabling the $1,000 genome. &ldquo;This platform includes dramatic technology breakthroughs that enable researchers to undertake studies of unprecedented scale by providing the throughput to sequence tens of thousands of human whole genomes in a single year in a single lab,&rdquo; Illumina stated.</p><p>Initial customers for the HiSeq X Ten System, which will ship in Q1 2014, include Macrogen, based in Seoul, South Korea and its CLIA laboratory in Rockville, Maryland, the Broad Institute in Cambridge, Massachusetts, and the Garvan Institute of Medical Research in Sydney, Australia.</p><p>&ldquo;For the first time, it looks like it will be possible to deliver the $1,000 genome, which is tremendously exciting,&rdquo; said Eric Lander, founding director of the Broad Institute and a professor of biology at MIT. &ldquo;The HiSeq X Ten should give us the ability to analyze complete genomic information from huge sample populations. Over the next few years, we have an opportunity to learn as much about the genetics of human disease as we have learned in the history of medicine.&rdquo;</p><p>&ldquo;The HiSeq X Ten is an ideal platform for scientists and institutions focused on the discovery of genotypic variation to enable a deeper understanding of human biology and genetic disease,&rdquo; Illumina stated. &ldquo;It can sequence tens of thousands of samples annually with high-quality, high-coverage sequencing, delivering a comprehensive catalog of human variation within and outside coding regions.&rdquo;</p><p>HiSeq X Ten utilizes a number of advanced design features to generate massive throughput. Patterned flow cells, which contain billions of nanowells at fixed locations, combined with a new clustering chemistry deliver a significant increase in data density (6 billion clusters per run). Using state-of-the art optics and faster chemistry, HiSeq X Ten can process sequencing flow cells more quickly than ever before &mdash; generating a 10x increase in daily throughput when compared to current HiSeq 2500 performance.</p><p>The HiSeq X Ten is sold as a set of 10 or more ultra-high throughput sequencing systems, each generating up to 1.8 terabases (Tb) of sequencing data in less than three days or up to 600 gigabases (Gb) per day, per system, providing the throughput to sequence tens of thousands of high-quality, high-coverage genomes per year. Illumina says the $1,000 includes typical instrument depreciation, DNA extraction, library preparation, and estimated labor.</p>]]></description>
	<dc:creator>Madhvan Reddy</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42974/list-of-bioinformatics-packages-for-ngs-analysis</guid>
	<pubDate>Sat, 20 Mar 2021 00:28:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42974/list-of-bioinformatics-packages-for-ngs-analysis</link>
	<title><![CDATA[List of bioinformatics packages for NGS analysis !]]></title>
	<description><![CDATA[<p>Package suites gather software packages and installation tools for specific languages or platforms. We have some for bioinformatics software.</p><ul>
<li><a href="https://github.com/Bioconductor">Bioconductor</a>&nbsp;&ndash; A plethora of tools for analysis and comprehension of high-throughput genomic data, including 1500+ software packages. [&nbsp;<a href="https://link.springer.com/article/10.1186/gb-2004-5-10-r80">paper-2004</a>&nbsp;|&nbsp;<a href="https://www.bioconductor.org/">web</a>&nbsp;]</li>
<li><a href="https://github.com/biopython/biopython">Biopython</a>&nbsp;&ndash; Freely available tools for biological computing in Python, with included cookbook, packaging and thorough documentation. Part of the&nbsp;<a href="http://open-bio.org/">Open Bioinformatics Foundation</a>. Contains the very useful&nbsp;<a href="https://biopython.org/DIST/docs/api/Bio.Entrez-module.html">Entrez</a>&nbsp;package for API access to the NCBI databases. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/19304878">paper-2009</a>&nbsp;|&nbsp;<a href="https://biopython.org/">web</a>&nbsp;]</li>
<li><a href="https://github.com/bioconda">Bioconda</a>&nbsp;&ndash; A channel for the&nbsp;<a href="http://conda.pydata.org/docs/intro.html">conda package manager</a>&nbsp;specializing in bioinformatics software. Includes a repository with 3000+ ready-to-install (with&nbsp;<code>conda install</code>) bioinformatics packages. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/29967506">paper-2018</a>&nbsp;|&nbsp;<a href="https://bioconda.github.io/">web</a>&nbsp;]</li>
<li><a href="https://github.com/BioJulia">BioJulia</a>&nbsp;&ndash; Bioinformatics and computational biology infastructure for the Julia programming language. [&nbsp;<a href="https://biojulia.net/">web</a>&nbsp;]</li>
<li><a href="https://github.com/rust-bio/rust-bio">Rust-Bio</a>&nbsp;&ndash; Rust implementations of algorithms and data structures useful for bioinformatics. [&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/early/2015/10/06/bioinformatics.btv573.short?rss=1">paper-2016</a>&nbsp;]</li>
<li><a href="https://github.com/seqan/seqan3">SeqAn</a>&nbsp;&ndash; The modern C++ library for sequence analysis.</li>
</ul>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7999/senior-research-fellow-indian-agricultural-statistics-research-institute</guid>
  <pubDate>Thu, 23 Jan 2014 06:22:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow @ Indian Agricultural Statistics Research Institute]]></title>
  <description><![CDATA[
<p>Indian Agricultural Statistics Research Institute<br />Library Avenue, Pusa, New Delhi – 110012</p>

<p>Walk-in-Interview</p>

<p>Walk-in-interview will be held on February 11, 2014 at 10:00 A.M. at IASRI, New Delhi for a project “Whole Genome Sequencing and Development of Allied Genomics Resources in Two Commercially Important Fish-Labeo rohita and Clarias batrachus” funded by Department of Biotechnology, Ministry of Science and Technology, Government of India, New Delhi for the following posts. The appointment will be on contractual basis upto September, 2016 or till the termination of the project whichever is earlier and the incumbent shall not have any claim for regular appointment under ICAR.</p>

<p>Senior Research Fellow Two</p>

<p>Post-Graduation in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application/ Biotechnology or equivalent with 1st Division</p>

<p> Knowledge of Statistical Analysis /Bioinformatics tools/computer programming for computational genomics.</p>

<p>Emoluments for Research Associate: Consolidated Rs: 16000/- per month + 30% HRA (1st Two years) and Rs: 18000/- per month + 30% HRA (3rd Year)</p>

<p>Age Limit: Age should be not more than 35 years (5 years relaxation for SC/ST/women candidates and 3 years for OBC candidates as on date of interview).<br />Interested candidates are requested to appear for Walk-in-Interview on the date and time as specified above in Room No. 106, Training Cum Administrative Block of the Institute along with their application giving bio-data with attested copies of certificates, degrees, testimonials, etc. and one passport size photograph. Original certificates/ Degrees are needed to be produced at the time of interview. No T.A. /D.A. will be paid for appearing in the interview.</p>

<p>Advertisement: http://www.iasri.res.in/employment/2014/srf_cabin.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23121/senior-sas-programmer-urgent-role-permanant-welwyn-garden-city-uk</guid>
  <pubDate>Fri, 03 Jul 2015 08:14:23 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior SAS Programmer - URGENT ROLE - Permanant - Welwyn Garden City - UK]]></title>
  <description><![CDATA[
<p>SAS Programmer URGENTLY required !! My client is looking for an experienced Senior SAS Programmer, to join their bubbly dynamic team in Welwyn Garden City. You must have experience within SAS and/or R programming language. I am looking for someone with a background within either Life Sciences, Statistics, Computer Science, Bioinformatics etc. I am looking for someone with leadership qualities, you must have excellent analyst skills. Please call Dareen Evans on 01772 278050 or email your cv to dareen.evans@itworkshealth.co.uk</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8108/jrf-institute-of-cytology-preventive-oncology</guid>
  <pubDate>Sat, 01 Feb 2014 13:47:29 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF @ Institute of Cytology &amp; Preventive Oncology]]></title>
  <description><![CDATA[
<p>Institute of Cytology &amp; Preventive Oncology (ICPO) which was initially established as Cytology Research Centre ( CRC ) by the Indian Council of Medical Research (ICMR) in 1979, came into the existence in 1989 when CRC was elevated to the level of Institute. ICPO was instituted with the main aim of promoting research in the field of cancers that are most prevalent in India with an emphasis on their early detection and prevention.</p>

<p>Candidates having the below mentioned qualifications may appear for Walk in Interview at ICPO on 5th Feb 2014 between 10.00 AM and 12.00 PM under the NIF project entitled "Prediction of drug tragets of chemical constituents present within non-codified medicinal plants" under Dr Subhash M.Agarwal, Scientist C</p>

<p>    Position : JRF<br />    No of Post : One<br />    Pay : Rs 12000/- + 30% HRA </p>

<p>    Desired Profile : M.Sc in Bioinformatics with good academic record. Candidate with experience in database development and scripting would be preferred<br />    Age Limit : Below 28 years<br />    Period : 2 months</p>

<p>Interested candidates may send their applications with bio-data by email (smagarwal@gmail.com) or post addressed to Dr Subhash M Agarwal, Scientist C, Bioinformatics Division, Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector 39, Noida-201301 so as to reach latest by 04.02.14</p>

<p>Deadline : 04.02.14</p>

<p>http://icmr.nic.in/icmrnews/icpo_jrf.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34552/edit-distance-application-in-bioinformatics</guid>
	<pubDate>Thu, 07 Dec 2017 08:46:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34552/edit-distance-application-in-bioinformatics</link>
	<title><![CDATA[Edit distance application in bioinformatics !]]></title>
	<description><![CDATA[<p>There are other popular measures of&nbsp;<a href="https://en.wikipedia.org/wiki/Edit_distance" title="Edit distance">edit distance</a>, which are calculated using a different set of allowable edit operations. For instance,</p><ul>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance" title="Damerau&ndash;Levenshtein distance">Damerau&ndash;Levenshtein distance</a>&nbsp;allows insertion, deletion, substitution, and the&nbsp;<a href="https://en.wikipedia.org/wiki/Transposition_(mathematics)" title="Transposition (mathematics)">transposition</a>&nbsp;of two adjacent characters;</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem" title="Longest common subsequence problem">longest common subsequence</a>&nbsp;(LCS) distance allows only insertion and deletion, not substitution;</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Hamming_distance" title="Hamming distance">Hamming distance</a>&nbsp;allows only substitution, hence, it only applies to strings of the same length.</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Jaro_distance" title="Jaro distance">Jaro distance</a>&nbsp;allows only&nbsp;<a href="https://en.wikipedia.org/wiki/Transposition_(mathematics)" title="Transposition (mathematics)">transposition</a>.</li>
</ul><p>&nbsp;</p><pre><span>use</span> Text<span>::</span>Levenshtein <span>qw</span><span>(</span>distance<span>);</span>

 <span>print</span> <span>distance</span><span>(</span><span>"foo"</span><span>,</span><span>"four"</span><span>);</span>
 <span># prints "2"</span>

 <span>my</span> <span>@words</span>     <span>=</span> <span>qw</span><span>/ four foo bar /</span><span>;</span>
 <span>my</span> <span>@distances</span> <span>=</span> <span>distance</span><span>(</span><span>"foo"</span><span>,</span><span>@words</span><span>);</span>

 <span>print</span> <span>"@distances"</span><span>;</span>
 <span># prints "2 0 3"</span><br /><br /><br /></pre><pre><span>use</span> Algorithm<span>::</span>LCSS <span>qw</span><span>(</span> LCSS CSS CSS_Sorted <span>);</span>
    <span>my</span> <span>$lcss_ary_ref</span> <span>=</span> <span>LCSS</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>  <span># ref to array</span>
    <span>my</span> <span>$lcss_string</span>  <span>=</span> <span>LCSS</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>    <span># string</span>
    <span>my</span> <span>$css_ary_ref</span> <span>=</span> <span>CSS</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>    <span># ref to array of arrays</span>
    <span>my</span> <span>$css_str_ref</span> <span>=</span> <span>CSS</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>      <span># ref to array of strings</span>
    <span>my</span> <span>$css_ary_ref</span> <span>=</span> <span>CSS_Sorted</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>  <span># ref to array of arrays</span>
    <span>my</span> <span>$css_str_ref</span> <span>=</span> <span>CSS_Sorted</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>    <span># ref to array of strings<br /><br /><br /><br /></span></pre><p>There are many different modules on CPAN for calculating the edit distance between two strings. Here's just a selection.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshteinXS">Text::LevenshteinXS</a>&nbsp;and&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3AXS">Text::Levenshtein::XS</a>&nbsp;are both versions of the Levenshtein algorithm that require a C compiler, but will be a lot faster than this module.</p><p>The Damerau-Levenshtein edit distance is like the Levenshtein distance, but in addition to insertion, deletion and substitution, it also considers the transposition of two adjacent characters to be a single edit. The module&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3ADamerau">Text::Levenshtein::Damerau</a>&nbsp;defaults to using a pure perl implementation, but if you've installed&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3ADamerau%3A%3AXS">Text::Levenshtein::Damerau::XS</a>&nbsp;then it will be a lot quicker.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3AWagnerFischer">Text::WagnerFischer</a>&nbsp;is an implementation of the Wagner-Fischer edit distance, which is similar to the Levenshtein, but applies different weights to each edit type.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ABrew">Text::Brew</a>&nbsp;is an implementation of the Brew edit distance, which is another algorithm based on edit weights.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3AFuzzy">Text::Fuzzy</a>&nbsp;provides a number of operations for partial or fuzzy matching of text based on edit distance.&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3AFuzzy%3A%3APP">Text::Fuzzy::PP</a>&nbsp;is a pure perl implementation of the same interface.</p><p><a href="http://search.cpan.org/perldoc?String%3A%3ASimilarity">String::Similarity</a>&nbsp;takes two strings and returns a value between 0 (meaning entirely different) and 1 (meaning identical). Apparently based on edit distance.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ADice">Text::Dice</a>&nbsp;calculates&nbsp;<a href="https://en.wikipedia.org/wiki/S%C3%B8rensen%E2%80%93Dice_coefficient">Dice's coefficient</a>&nbsp;for two strings. This formula was originally developed to measure the similarity of two different populations in ecological research.</p><pre><span>&nbsp;</span></pre>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>